Symbolic Reachability Computation for Fa
✍
Gerardo Lafferriere; George J. Pappas; Sergio Yovine
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 391 KB
The control paradigm of physical processes being supervised by digital programs has lead to the development of a theory of hybrid systems combining finite state automata with differential equations. One of the most important problems in the verification of hybrid systems is the reachability problem.