Discrete abstractions of hybrid systems
Top Cited Papers
- 1 July 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 88 (7), 971-984
- https://doi.org/10.1109/5.871304
Abstract
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.Keywords
This publication has 64 references indexed in Scilit:
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- Algorithmic analysis of nonlinear hybrid systemsIEEE Transactions on Automatic Control, 1998
- Towards continuous abstractions of dynamical and control systemsPublished by Springer Nature ,1997
- Deciding reachability for planar multi-polynomial systemsPublished by Springer Nature ,1996
- ε-Approximation of differential inclusionsPublished by Springer Nature ,1996
- Timing analysis in COSPANPublished by Springer Nature ,1996
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- A theory of timed automataTheoretical Computer Science, 1994
- Smart cars on smart roads: problems of controlIEEE Transactions on Automatic Control, 1993
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988