@inbook{4513,
  abstract     = {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 finitestate systems. },
  author       = {Henzinger, Thomas A},
  booktitle    = {Verification of Digital and Hybrid Systems},
  editor       = {Inan, M. and Kurshan, Robert},
  isbn         = {9783642596155},
  pages        = {265 -- 292},
  publisher    = {Springer},
  title        = {{The theory of hybrid automata}},
  doi          = {10.1007/978-3-642-59615-5},
  volume       = {170},
  year         = {2000},
}