The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Differential Dynamic Logic for Hybrid Systems
Open accessAbstract
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equations. With the goal of developing a theoretical and practical foundation for deductive verification of hybrid systems, we introduce a dynamic logic for hybrid programs, which is a program notation for hybrid systems. As a verification technique that is suitable for automation, we introduce a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic. The calculus is compositional, i.e., it reduces properties of hybrid programs to properties of their parts. Our main result proves that this calculus axiomatises the transition behaviour of hybrid systems completely relative to differential equations. In a case study with cooperating traffic agents of the European Train Control System, we further show that our calculus is well-suited for verifying realistic hybrid systems with parametric system dynamics.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Clarke, E. M., Grümberg, O., & Long, D. (1996) · Cited by 6,813
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Clarke, E. M., & Schlingloff, B. (1999) · Cited by 4,226
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
The algorithmic analysis of hybrid systems
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T. A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., & Yovine, S. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00202-t · Cited by 1,876
Henzinger, T. A. (2002) · Proceedings 11th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1996.561342 · Cited by 1,837
A Decision Method for Elementary Algebra and Geometry
Tarski, A. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_3 · Cited by 1,643
Harel, D., Kozen, D. C., & Tiuryn, J. (2000) · Cited by 1,439
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
Branicky, M. S., Borkar, V. S., & Mitter, S. K. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.654885 · Cited by 1,313
A Decision Method for Elementary Algebra and Geometry
Tarski, A., & McKinsey, J. C. C. (1951) · University of California Press eBooks · doi:10.1525/9780520348097 · Cited by 1,206
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
First-Order Logic and Automated Theorem Proving
Fitting, M. (1996) · Springer eBooks · doi:10.1007/978-1-4612-2360-3 · Cited by 950
Model-checking for real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (2002) · [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1990.113766 · Cited by 897
Differential Equations and Dynamical Systems
Perko, L. (1991) · Texts in Applied Mathematics · doi:10.1007/978-1-4684-0392-3 · Cited by 723
Using branching time temporal logic to synthesize synchronization skeletons
Emerson, E. A., & Clarke, E. M. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(83)90017-5 · Cited by 660
(1979) · Lecture notes in computer science · doi:10.1007/3-540-09237-4 · Cited by 648
Fitting, M., & Mendelsohn, R. L. (2023) · Synthese Library · doi:10.1007/978-3-031-40714-7 · Cited by 619
Proving termination with multiset orderings
Dershowitz, N., & Manna, Z. (1979) · Communications of the ACM · doi:10.1145/359138.359142 · Cited by 562
PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech
Frehse, G. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31954-2_17 · Cited by 478
Soundness and Completeness of an Axiom System for Program Verification
Cook, S. A. (1978) · SIAM Journal on Computing · doi:10.1137/0207005 · Cited by 461
Goldblatt, R. (1986) · Journal of Symbolic Logic · doi:10.2307/2273958 · Cited by 433
Studies in hybrid systems: modeling, analysis, and control
Branicky, M. S. (1996) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 403
Computational techniques for hybrid system verification
Chutinan, A., & Krogh, B. H. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.806655 · Cited by 339
Dowek, G., Hardin, T., & Kirchner, C. (2003) · Journal of Automated Reasoning · doi:10.1023/a:1027357912519 · Cited by 228
Differential automata and their discrete simulators
Tavernini, L. (1987) · Nonlinear Analysis: Theory, Methods & Applications · doi:10.1016/0362-546x(87)90034-4 · Cited by 226
A New Class of Decidable Hybrid Systems
Lafferriere, G., Pappas, G. J., & Yovine, S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48983-5_15 · Cited by 205
Universal computation and other capabilities of hybrid and continuous dynamical systems
Branicky, M. S. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00147-b · Cited by 166
Computability with polynomial differential equations
Graça, D. S., Campagnolo, M. L., & Buescu, J. (2007) · Advances in Applied Mathematics · doi:10.1016/j.aam.2007.02.003 · Cited by 62
Metadata
- Authors
- Platzer, A.
- Venue
- Journal of Automated Reasoning
- Published
- 2008-08
- Volume
- 41
- Issue
- 2
- Pages
- 143-189
- ISSN
- 0168-7433 (ISSN-L)
- 1573-0670
- OpenAlex
- W1977444293
- Cited by
- 390
- References
- 29
- FWCI
- 18.29
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.