The theory of hybrid automata. (English) Zbl 0959.68073

Inan, M. Kemal (ed.) et al., Verification of digital and hybrid systems. Proceedings of the NATO ASI, Antalya, Turkey, May 26-June 6, 1997. Berlin: Springer. NATO ASI Ser., Ser. F, Comput. Syst. Sci. 170, 265-292 (2000).
Summary: A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata according to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discrete-continuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various model-checking techniques that were originally developed for finite-state systems.
For the entire collection see [Zbl 0935.00051].


68Q45 Formal languages and automata