History-deterministic timed automata
From MaRDI portal
Publication:6635511
DOI10.46298/LMCS-20(4:1)2024MaRDI QIDQ6635511
Sougata Bose, Patrick Totzke, Thomas A. Henzinger, Sven Schewe, Karoliina Lehtinen
Publication date: 12 November 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Borel determinacy
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Good-enough synthesis
- Relating word and tree automata
- On Determinisation of Good-for-Games Automata
- Undecidable Problems About Timed Automata
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Solving Games Without Determinization
- The Theory of Stabilisation Monoids and Regular Cost Functions
- The expressive power of clocks
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Minimizing GFG Transition-Based Automata
- Timed Parity Games: Complexity and Robustness
- Fair simulation
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
- Verifying abstractions of timed systems
- History-deterministic timed automata are not determinizable
- Token Games and History-Deterministic Quantitative-Automata
- History-deterministic timed automata
- History-deterministic timed automata
Related Items (1)
This page was built for publication: History-deterministic timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635511)
