History-Deterministic Timed Automata Are Not Determinizable

Download PDF
Open Webpage

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke

Published: 01 Jan 2022, Last Modified: 27 Apr 2025RP 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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 \(\omega \)-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact.