par Raskin, Jean-François 
Référence Lecture notes in computer science, 6945, page (28-30)
Publication Publié, 2011
Référence Lecture notes in computer science, 6945, page (28-30)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This negative result has triggered several research lines, leading among others to: - the definition of subclasses of hybrid automata with a decidable reachability problem; - the definition of semi-algorithms that are useful in practice to attack the reachability problem; - the definition of variants of the reachability problem that are decidable for larger classes of hybrid automata. In this talk, we summarize classical and more recent results about those three research lines. © 2011 Springer-Verlag. |
