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 analyzed 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 severely restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be severely restricted, as is the case for o-minimal hybrid systems. In this paper, we survey and unify the main results in both areas. 1.
|
1393
|
A theory of timed automata
– Alur, Dill
- 1994
|
|
1266
|
Abstract interpretation : a unified lattice model for the static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
568
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
449
|
The algorithmic analysis of hybrid systems
– Alur, Courcoubetis, et al.
- 1995
|
|
292
|
Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems
– Alur, Courcoubetis, et al.
|
|
210
|
The tool KRONOS
– Daws, Olivero, et al.
- 1996
|
|
107
|
Characterizing finite Kripke structures in propositional temporal logic
– Browne, Clarke, et al.
- 1988
|
|
97
|
Model checking in dense real time
– Alur, Courcoubetis, et al.
- 1993
|
|
71
|
Models for Hybrid Systems
– Kohn, Nerode
- 1993
|
|
65
|
Minimal model generation
– Bouajjani, Fernandez, et al.
|
|
58
|
Reachability analysis via face-lifting
– Dang, Maler
- 1998
|
|
44
|
The algorithmic analysis of hybrid systems. Theoretical Computer Science
– Alur, Courcoubetis, et al.
- 1995
|
|
44
|
Effective Synthesis of Switching Controllers for Linear Systems
– Asarin, Bournez, et al.
|
|
43
|
Abstract Interpretation: a Uni ed Lattice Model for Static AnalysisofProgramsby Construction or Approximation of Fixpoints
– Cousot, Cousot
- 1977
|
|
41
|
Timing analysis in COSPAN
– Alur, Kurshan
- 1996
|
|
30
|
Modular specification of hybrid systems
– ALUR, GROSU, et al.
- 2000
|
|
30
|
Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations
– Chutinam, Krogh
- 1999
|
|
27
|
A.L.: Automotive engine control and hybrid systems: Challenges and opportunities
– Balluchi, Benvenuti, et al.
|
|
27
|
Hierarchical Hybrid Control Systems : A lattice theoretic formulation
– Caines, Wei
- 1998
|
|
26
|
Semianalytic and subanalytic sets
– Bierstone, Milman
- 1988
|
|
22
|
A Theory of Timed Automata: Theoret
– Alur, Dill
- 1994
|
|
12
|
Timing analysis
– ALUR, KURSHAN
- 1996
|
|
12
|
Linear Systems
– Antsaklis, Michel
- 1997
|
|
11
|
Topologies, continuity and bisimulations
– Davoren
- 1999
|
|
9
|
Semianalytic and subanalytic sets, Inst
– Bierstone, Milman
- 1988
|
|
9
|
Deciding reachability for planar multi-polynomial systems
– Cerāns, Vīksna
- 1996
|
|
7
|
Modular speci cation of hybrid systems in charon
– Alur, Grosu, et al.
- 2000
|
|
6
|
Characterizing nite kripke structures in propositional temporal logic
– BROWNE, CLARKE, et al.
- 1988
|
|
5
|
Effective controller synthesis of switching controllers for linear systems
– Asarin, Bournez, et al.
- 2000
|
|
4
|
Veri cation of polyhedral-invariant hybrid automata using polygonal ow pipe approximations
– Chutinan, Krogh
- 1999
|
|
1
|
Systems IV
– Hybrid
- 1997
|
|
1
|
Minimal model generation,” in CAV 90: Computer-Aided Verification
– Bouajjani, Fernandez, et al.
- 1990
|
|
1
|
Hybrid control in automotive applications
– Balluchi, Benvenuti, et al.
|
|
