History-deterministic Timed Automata

We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Logical methods in computer science Ročník 20, Issue 4
Hlavní autoři: Bose, Sougata, Henzinger, Thomas A., Lehtinen, Karoliina, Schewe, Sven, Totzke, Patrick
Médium: Journal Article
Jazyk:angličtina
Vydáno: Logical Methods in Computer Science Association 01.10.2024
Logical Methods in Computer Science e.V
Edice:Logical Methods in Computer Science
Témata:
Computer Science
computer science - formal languages and automata theory
computer science - logic in computer science
synthesis
History-determinism
fair simulation
Good-for-games
Timed Automata
ISSN:1860-5974, 1860-5974
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and HD specifications allow for game-based verification without an expensive determinization step. We show that the class of timed $\omega$-languages recognized by HD timed automata strictly extends that of deterministic ones, and is strictly included in those recognised by fully non-deterministic TA. For non-deterministic timed automata it is known that universality is already undecidable for safety/reachability TA. For history-deterministic TA with arbitrary parity acceptance, we show that timed universality, inclusion, and synthesis all remain decidable and are EXPTIME-complete. For the subclass of TA with safety or reachability acceptance, one can decide (in EXPTIME) whether such an automaton is history-deterministic. If so, it can effectively determinized without introducing new automaton states.
ISSN:1860-5974
1860-5974
DOI:10.46298/lmcs-20(4:1)2024