History-deterministic timed automata are not determinizable

DOI10.1007/978-3-031-19135-0_5OpenAlexW4309389810MaRDI QIDQ6173103

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

Publication date: 21 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-19135-0_5

zbMATH Keywords

timed automatahistory-determinism

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On history-deterministic one-counter nets, History-deterministic timed automata are not determinizable

Cites Work

• Unnamed Item
• Unnamed Item
• Timed automata and recognizability
• A theory of timed automata
• Fair simulation
• Relating word and tree automata
• On Determinisation of Good-for-Games Automata
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
• History-deterministic timed automata are not determinizable
• Token Games and History-Deterministic Quantitative-Automata