Modular mix-and-match complementation of Büchi automata
From MaRDI portal
Publication:6535356
DOI10.1007/978-3-031-30823-9_13zbMATH Open1543.68171MaRDI QIDQ6535356
Andrea Turrini, Yong Li, Ondřej Lengál, Vojtěch Havlena, Unnamed Author
Publication date: 13 December 2023
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mediating for reduction (on minimizing alternating Büchi automata)
- Alternating finite automata on \(\omega\)-words
- Profile trees for Büchi word automata, with application to determinization
- The complementation problem for Büchi automata with applications to temporal logic
- Complementing deterministic Büchi automata in polynomial time
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- Complementing semi-deterministic Büchi automata
- Improved Ramsey-Based Büchi Complementation
- State of B\"uchi Complementation
- An Improved Construction of Deterministic Omega-automaton Using Derivatives
- Learning to Complement Büchi Automata
- New Optimizations and Heuristics for Determinization of Büchi Automata
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Weak alternating automata are not that weak
- On Minimal Odd Rankings for Büchi Complementation
- Limit-Deterministic Büchi Automata for Linear Temporal Logic
- Unifying B\"uchi Complementation Constructions
- A Simple and Optimal Complementation Algorithm for Büchi Automata
- Simulation-based minimization
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Büchi Complementation Made Tight
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Correct Hardware Design and Verification Methods
- Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- From Spot 2.0 to Spot 2.10: What’s New?
- Complementing Büchi Automata with Ranker
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Simulations in rank-based Büchi automata complementation
Related Items (1)
This page was built for publication: Modular mix-and-match complementation of Büchi automata
