History-Deterministic Timed Automata Are Not Determinizable
Résumé
An automaton is history-deterministic (HD) if one can safely resolve its non-deterministic choices on the fly. In a recent paper, Henzinger, Lehtinen and Totzke studied this in the context of Timed Automata [9], where it was conjectured that the class of timed ω-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|