Mathematical control theory: deterministic systems
Mathematical control theory: deterministic systems
Handbook of theoretical computer science (vol. B)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Abstract verification of structured dynamical systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Analysis of Dynamical Systems Using Predicate Transformers - Attraction and Composition
Proceedings on Analysis of Dynamical and Cognitive Systems, Advanced Course
Assertion-Based Analysis of Hybrid Systems with PVS
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Assertion-Based Analysis of Hybrid Systems with PVS
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
| Hi-index | 0.00 |
In order to promote a deeper understanding of hybrid, i.e. mixed discrete and continuous, systems, we introduce a set of important properties of such systems and classify them. For the properties of stability and attraction which are central for continuous systems we discuss their relationship to discrete systems usually studied in computer science. An essential result is that the meaning of these properties for discrete systems vitally depends on the used topologies. Based on the classification we discuss the utility of a refinement notion based on trace inclusion. Furthermore, for proofs of stability the role of Liapunov functions as abstractions is emphasized by identifying conditions under which they define Galois connections.