History-Deterministic Timed Automata Are Not Determinizable-Reference-Cited by-同舟云学术

History-Deterministic Timed Automata Are Not Determinizable

Published:2022 Issue: Volume: Page:67-76
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

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

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-19135-0_5

Reference14 articles.

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoret. Comput. Sci. 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8

2. Bagnol, M., Kuperberg, D.: Büchi good-for-games automata are efficiently recognizable. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics (LIPIcs), vol. 122, pp. 1–14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https://doi.org/10.4230/LIPIcs.FSTTCS.2018.16

3. Boker, U., Lehtinen, K.: Good for games automata: from nondeterminism to alternation. In: International Conference on Concurrency Theory (CONCUR). LIPIcs, vol. 140, pp. 1–16 (2019)

4. Boker, U., Lehtinen, K.: History determinism vs. good for gameness in quantitative automata. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics. (LIPIcs), vol. 213, pp. 1–20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.FSTTCS.2021.38

5. Lecture Notes in Computer Science;U Boker,2022

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On History-Deterministic One-Counter Nets;Lecture Notes in Computer Science;2023