{"article_processing_charge":"No","type":"conference","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"publication_status":"published","quality_controlled":"1","volume":13608,"_id":"12175","status":"public","citation":{"short":"S. Bose, T.A. Henzinger, K. Lehtinen, S. Schewe, P. Totzke, in:, 16th International Conference on Reachability Problems, Springer Nature, 2022, pp. 67–76.","apa":"Bose, S., Henzinger, T. A., Lehtinen, K., Schewe, S., &#38; Totzke, P. (2022). History-deterministic timed automata are not determinizable. In <i>16th International Conference on Reachability Problems</i> (Vol. 13608, pp. 67–76). Kaiserslautern, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">https://doi.org/10.1007/978-3-031-19135-0_5</a>","mla":"Bose, Sougata, et al. “History-Deterministic Timed Automata Are Not Determinizable.” <i>16th International Conference on Reachability Problems</i>, vol. 13608, Springer Nature, 2022, pp. 67–76, doi:<a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">10.1007/978-3-031-19135-0_5</a>.","ista":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. 2022. History-deterministic timed automata are not determinizable. 16th International Conference on Reachability Problems. RC: Reachability Problems, LNCS, vol. 13608, 67–76.","ieee":"S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in <i>16th International Conference on Reachability Problems</i>, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.","ama":"Bose S, Henzinger TA, Lehtinen K, Schewe S, Totzke P. History-deterministic timed automata are not determinizable. In: <i>16th International Conference on Reachability Problems</i>. Vol 13608. Springer Nature; 2022:67-76. doi:<a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">10.1007/978-3-031-19135-0_5</a>","chicago":"Bose, Sougata, Thomas A Henzinger, Karoliina Lehtinen, Sven Schewe, and Patrick Totzke. “History-Deterministic Timed Automata Are Not Determinizable.” In <i>16th International Conference on Reachability Problems</i>, 13608:67–76. Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19135-0_5\">https://doi.org/10.1007/978-3-031-19135-0_5</a>."},"month":"10","author":[{"last_name":"Bose","first_name":"Sougata","full_name":"Bose, Sougata"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Karoliina","last_name":"Lehtinen","full_name":"Lehtinen, Karoliina"},{"last_name":"Schewe","first_name":"Sven","full_name":"Schewe, Sven"},{"last_name":"Totzke","first_name":"Patrick","full_name":"Totzke, Patrick"}],"scopus_import":"1","date_created":"2023-01-12T12:11:57Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093, the EPSRC project EP/V025848/1, and the EPSRC project EP/X017796/1.","date_published":"2022-10-12T00:00:00Z","title":"History-deterministic timed automata are not determinizable","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"doi":"10.1007/978-3-031-19135-0_5","publication":"16th International Conference on Reachability Problems","ec_funded":1,"conference":{"start_date":"2022-10-17","location":"Kaiserslautern, Germany","name":"RC: Reachability Problems","end_date":"2022-10-21"},"publication_identifier":{"isbn":["9783031191343"],"eissn":["1611-3349"],"eisbn":["9783031191350"],"issn":["0302-9743"]},"intvolume":"     13608","main_file_link":[{"open_access":"1","url":"https://hal.science/hal-03849398/"}],"year":"2022","language":[{"iso":"eng"}],"day":"12","date_updated":"2023-09-05T15:12:08Z","oa":1,"abstract":[{"text":"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.","lang":"eng"}],"publisher":"Springer Nature","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","page":"67-76"}