Determinization and limit-determinization of Emerson-Lei automata
From MaRDI portal
Publication:2147175
DOI10.1007/978-3-030-88885-5_2zbMath1497.68270arXiv2106.15892OpenAlexW3208208968MaRDI QIDQ2147175
Christel Baier, Sascha Klüppelholz, Tobias John, Simon Jantsch
Publication date: 22 June 2022
Full work available at URL: https://arxiv.org/abs/2106.15892
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SPIN
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Alternating finite automata on \(\omega\)-words
- Modalities for model checking: Branching time logic strikes back
- LTL to smaller self-loop alternating automata and back
- An Improved Construction of Deterministic Omega-automaton Using Derivatives
- New Optimizations and Heuristics for Determinization of Büchi Automata
- Generic Emptiness Check for Fun and Profit
- On-the-fly Emptiness Check of Transition-Based Streett Automata
- The complexity of probabilistic verification
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Tight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning
- One Theorem to Rule Them All
- Lazy probabilistic model checking without determinisation
- Are Good-for-Games Automata Good for Probabilistic Model Checking?
- Owl: a library for \(\omega \)-words, automata, and LTL
This page was built for publication: Determinization and limit-determinization of Emerson-Lei automata
