History-deterministic timed automata are not determinizable

DOI10.1007/978-3-031-19135-0_5MaRDI QIDQ6173103zbMATH OpenOpenAlexFDO

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

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

history-determinismtimed automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Büchi Good-for-Games Automata Are Efficiently Recognizable
• Fair simulation
• Good for games automata: from nondeterminism to alternation
• History-deterministic timed automata are not determinizable
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• On Determinisation of Good-for-Games Automata
• Relating word and tree automata
• Solving Games Without Determinization
• The Theory of Stabilisation Monoids and Regular Cost Functions
• Timed automata and recognizability

Cited in

(5)

• On history-deterministic one-counter nets
• History-deterministic timed automata are not determinizable
• History-deterministic timed automata
• History-deterministic vector addition systems
• Resolving nondeterminism by chance

This page was built for publication: History-deterministic timed automata are not determinizable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173103)