History-deterministic timed automata
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- Borel determinacy
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Event-clock automata: a determinizable class of timed automata
- Fair simulation
- Good for games automata: from nondeterminism to alternation
- Good-enough synthesis
- History-deterministic timed automata
- History-deterministic timed automata
- History-deterministic timed automata are not determinizable
- scientific article; zbMATH DE number 1256652 (Why is no real title available?)
- scientific article; zbMATH DE number 7799616 (Why is no real title available?)
- Minimizing GFG Transition-Based Automata
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- On Determinisation of Good-for-Games Automata
- Relating word and tree automata
- Solving Games Without Determinization
- The expressive power of clocks
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Timed Parity Games: Complexity and Robustness
- Undecidable Problems About Timed Automata
- Verifying abstractions of timed systems
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)