New Optimizations and Heuristics for Determinization of Büchi Automata
From MaRDI portal
Publication:3297598
DOI10.1007/978-3-030-31784-3_18zbMath1437.68101arXiv1911.01759OpenAlexW2982119447MaRDI QIDQ3297598
Christof Löding, Anton Pirogov
Publication date: 20 July 2020
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.01759
Related Items
Determinization and limit-determinization of Emerson-Lei automata, On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Profile trees for Büchi word automata, with application to determinization
- An Improved Construction of Deterministic Omega-automaton Using Derivatives
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- On-the-Fly Stuttering in the Construction of Deterministic ω-Automata
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Tighter Bounds for the Determinisation of Büchi Automata
- A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
- Computing the Rabin Index of a Parity Automaton
- Manipulating LTL Formulas Using Spot 1.0
- From linear time to branching time
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- A Modular Approach for Büchi Determinization.
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Church’s Problem and a Tour through Automata Theory
- Testing and generating infinite sequences by a finite automaton
- Implementation and Application of Automata
- Model Checking Software
