History-Deterministic Timed Automata Are Not Determinizable - Archive ouverte HAL Access content directly
Conference Papers Year : 2022

History-Deterministic Timed Automata Are Not Determinizable

Sougata Bose
  • Function : Author
Thomas A Henzinger
  • Function : Author
Sven Schewe
  • Function : Author
Patrick Totzke
  • Function : Author


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.
Fichier principal
Vignette du fichier
BHLST2022.pdf (401.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03849398 , version 1 (17-11-2022)



Sougata Bose, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke. History-Deterministic Timed Automata Are Not Determinizable. 16th International Conference on Reachability Problems 2022, Oct 2022, KAISERSLAUTERN, Germany. pp.67-76, ⟨10.1007/978-3-031-19135-0_5⟩. ⟨hal-03849398⟩
7 View
6 Download



Gmail Facebook Twitter LinkedIn More