Title
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
Abstract
We introduce the framework of hybrid automata as a model and specification language forhybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in whichthe behavior of variables is governed in each state by a set of differential equations. We show thatmany of the examples considered in the workshop can be defined by hybrid automata. Whilethe reachability problem is undecidable even for very restricted classes of hybrid automata, wepresent two semidecision...
Year
DOI
Venue
1992
10.1007/3-540-57318-6_30
Hybrid Systems
Keywords
Field
DocType
hybrid systems,algorithmic approach,hybrid automata,hybrid system,specification language,differential equation,technical report,computer science
Specification language,Automata theory,Programming language,Computer science,Automaton,Theoretical computer science,Reachability problem,Mutual exclusion,Hybrid system,Undecidable problem,Hybrid automaton
Conference
ISBN
Citations 
PageRank 
3-540-57318-6
491
65.63
References 
Authors
12
4
Search Limit
100491
Name
Order
Citations
PageRank
Rajeev Alur1172531413.65
Costas Courcoubetis23821467.42
Thomas A. Henzinger3148271317.51
Pei-hsin Ho42577305.29