@inproceedings{12175,
  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 ω-languages recognised by HD-timed automata strictly extends that of deterministic ones. We provide a proof for this fact.},
  author       = {Bose, Sougata and Henzinger, Thomas A and Lehtinen, Karoliina and Schewe, Sven and Totzke, Patrick},
  booktitle    = {16th International Conference on Reachability Problems},
  isbn         = {9783031191343},
  issn         = {1611-3349},
  location     = {Kaiserslautern, Germany},
  pages        = {67--76},
  publisher    = {Springer Nature},
  title        = {{History-deterministic timed automata are not determinizable}},
  doi          = {10.1007/978-3-031-19135-0_5},
  volume       = {13608},
  year         = {2022},
}