Hybrid Systems' Properties - Classification and Relation to Computer Science

摘要

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.