The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Discrete abstractions of hybrid systems
Open accessAbstract
A hybrid system is a dynamical system with both discrete and continuous state changes. For analysis purposes, it is often useful to abstract a system in a way that preserves the properties being analysed while hiding the details that are of no interest. We show that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic. The classes that permit discrete abstractions fall into two categories. Either the continuous dynamics must be restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be restricted, as is the case for o-minimal hybrid systems. In this paper, we survey and unify results from both areas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Milner, R. (1989) · Cited by 6,877
Alur, R., & Dill, D. L. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90010-8 · Cited by 6,689
Self-citationCousot, P., & Cousot, R. (1977) · Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77 · doi:10.1145/512950.512973 · Cited by 6,279
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
Penczek, W. (1990) · Science of Computer Programming · doi:10.1016/0167-6423(90)90076-p · Cited by 3,954
The Temporal Logic of Reactive and Concurrent Systems
Manna, Z., & Pnueli, A. (1992) · Springer eBooks · doi:10.1007/978-1-4612-0931-7 · Cited by 2,958
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Larsen, K. G., Pettersson, P., & Yi, W. (1997) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s100090050010 · Cited by 2,193
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
Self-citationHenzinger, T. A. (2002) · Proceedings 11th Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1996.561342 · Cited by 1,837
Self-citationA 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
Perspectives and results on the stability and stabilizability of hybrid systems
Decarlo, R. A., Branicky, M. S., Pettersson, S., & Lennartson, B. (2000) · Proceedings of the IEEE · doi:10.1109/5.871309 · Cited by 1,625
Smart cars on smart roads: problems of control
Varaiya, P. (1993) · IEEE Transactions on Automatic Control · doi:10.1109/9.250509 · Cited by 1,383
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Specification and verification of concurrent systems in CESAR
Queille, J. P., & Sifakis, J. (1982) · Lecture Notes in Computer Science · doi:10.1007/3-540-11494-7_22 · Cited by 1,321
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
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
Alur, R., Courcoubetis, C., Henzinger, T. A., & Ho, P. H. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57318-6_30 · Cited by 1,106
Self-citationDESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
Conflict resolution for air traffic management: a study in multiagent hybrid systems
Tomlin, C., Pappas, G. J., & Sastry, S. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.664154 · Cited by 1,042
Self-citationSemianalytic and subanalytic sets
Bierstone, E., & Milman, P. D. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699126 · Cited by 671
What's Decidable about Hybrid Automata?
Henzinger, T. A., Kopke, P. W., Puri, A., & Varaiya, P. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1581 · Cited by 660
Self-citationGrossman, R. L., Nerode, A., Ravn, A. P., & Rischel, H. (1993) · Cited by 512
A game theoretic approach to controller design for hybrid systems
Tomlin, C. J., Lygeros, J., & Shankar Sastry, S. (2000) · Proceedings of the IEEE · doi:10.1109/5.871303 · Cited by 510
Control design of an automated highway system
Horowitz, R., & Varaiya, P. (2000) · Proceedings of the IEEE · doi:10.1109/5.871301 · Cited by 433
Characterizing finite Kripke structures in propositional temporal logic
Browne, M. C., Clarke, E. M., & Grümberg, O. (1988) · Theoretical Computer Science · doi:10.1016/0304-3975(88)90098-9 · Cited by 419
Algorithmic analysis of nonlinear hybrid systems
Henzinger, T. A., & Ho, P. H. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60045-0_53 · Cited by 308
Self-citationSupervisory control of hybrid systems
Koutsoukos, X. D., Antsaklis, P. J., Stiver, J. A., & Lemmon, M. D. (2000) · Proceedings of the IEEE · doi:10.1109/5.871307 · Cited by 305
Lafferriere, G., Pappas, G. J., & Sastry, S. (2000) · Mathematics of Control Signals and Systems · doi:10.1007/pl00009858 · Cited by 274
Self-citationEffective synthesis of switching controllers for linear systems
Asarin, E., Olivier Bournez, A., Dang, T., Maler, O., & Pnueli, A. (2000) · Proceedings of the IEEE · doi:10.1109/5.871306 · 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
Self-citationOptimal control of hybrid systems in manufacturing
Pepyne, D. L., & Cassandras, C. G. (2000) · Proceedings of the IEEE · doi:10.1109/5.871312 · Cited by 190
(1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57318-6 · Cited by 190
Hybrid systems III : verification and control
Alur, R., Henzinger, T. A., & Sontag, E. D. (1996) · Springer eBooks · Cited by 153
Self-citationPerformance benefits of hybrid control design for linear and nonlinear systems
McClamroch, N. H., & Kolmanovsky, I. V. (2000) · Proceedings of the IEEE · doi:10.1109/5.871310 · Cited by 111
Integration of task scheduling, action planning, and control in robotic manufacturing systems
Song, M., TARN, T. J., & Xi, N. (2000) · Proceedings of the IEEE · doi:10.1109/5.871311 · Cited by 62
A note on abstract interpretation strategies for hybrid automata
Henzinger, T. A., & Ho, P.-H. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60472-3_13 · Cited by 58
Self-citationHybrid Systems with Finite Bisimulations
Lafferriere, G., Pappas, G. J., & Sastry, S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49163-5_10 · Cited by 32
Self-citationTowards continuous abstractions of dynamical and control systems
Pappas, G. J., & Sastry, S. (1997) · Lecture notes in computer science · doi:10.1007/bfb0031567 · Cited by 26
Self-citationSubanalytic stratifications and bisimulations
Laflerriere, G., Pappas, G. J., & Sastry, S. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64358-3_41 · Cited by 10
Self-citation
Cited by
Dynamical properties of hybrid automata
Lygeros, J., Johansson, K. H., Simic, S. N., Zhang, J., & Sastry, S. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.806650 · Cited by 811
Cyber–Physical Systems: A Perspective at the Centennial
Kim, K.-D., & Kumar, P. R. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2189792 · Cited by 761
Temporal-Logic-Based Reactive Mission and Motion Planning
Kress-Gazit, H., Fainekos, G. E., & Pappas, G. J. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2030225 · Cited by 750
Self-citationResearch Directions in Requirements Engineering
Cheng, B. H. C., & Atlee, J. M. (2007) · Future of Software Engineering (FOSE '07) · doi:10.1109/fose.2007.17 · Cited by 660
A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
Kloetzer, M., & Belta, C. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.914952 · Cited by 514
Metadata
- Authors
- Alur, R., Henzinger, T. A., Lafferriere, G., & Pappas, G. J.
- Venue
- Proceedings of the IEEE
- Published
- 2000-07
- Volume
- 88
- Issue
- 7
- Pages
- 971-984
- ISSN
- 0018-9219 (ISSN-L)
- 1558-2256
- OpenAlex
- W2117218135
- Cited by
- 801
- References
- 41
- FWCI
- 32.40
- Type
- journal article
- Language
- en
- Open access
- green
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.