## The Theory of Hybrid Automata (1996)

### Cached

### Download Links

- [www.eecs.berkeley.edu]
- [www.ee.ntu.edu.tw]
- [www.eecs.berkeley.edu]
- [www.ics.uci.edu]
- [www-cad.eecs.berkeley.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 483 - 9 self |

### BibTeX

@INPROCEEDINGS{Henzinger96thetheory,

author = {Thomas A. Henzinger},

title = {The Theory of Hybrid Automata},

booktitle = {},

year = {1996},

pages = {278--292},

publisher = {IEEE Computer Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording 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.