Modular mix-and-match complementation of Büchi automata
From MaRDI portal
Publication:6535356
DOI10.1007/978-3-031-30823-9_13zbMATH Open1543.68171MaRDI QIDQ6535356FDOQ6535356
Authors: Vojtěch Havlena, Ondřej Lengál, Yong Li, Andrea Turrini 
Publication date: 13 December 2023
Recommendations
Cites Work
- Alternating finite automata on \(\omega\)-words
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- The complementation problem for Büchi automata with applications to temporal logic
- Complementing deterministic Büchi automata in polynomial time
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Weak alternating automata are not that weak
- Büchi complementation made tight
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- On complementing nondeterministic Büchi automata
- Mediating for reduction (on minimizing alternating Büchi automata)
- Simulation-based minimization
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- Unifying Büchi complementation constructions
- BÜCHI COMPLEMENTATION MADE TIGHTER
- Profile trees for Büchi word automata, with application to determinization
- Limit-deterministic Büchi automata for linear temporal logic
- Seminator 2 can complement generalized Büchi automata via improved semi-determinization
- A simple and optimal complementation algorithm for Büchi automata
- Complementing semi-deterministic Büchi automata
- Improved Ramsey-based Büchi complementation
- An improved construction of deterministic omega-automaton using derivatives
- New optimizations and heuristics for determinization of Büchi automata
- From LTL and limit-deterministic Büchi automata to deterministic parity automata
- Title not available (Why is that?)
- State of Büchi complementation
- On minimal odd rankings for Büchi complementation
- Learning to complement Büchi automata
- Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition
- Complementing Büchi Automata with Ranker
- Decidability for Sturmian words
- From Spot 2.0 to Spot 2.10: What’s New?
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Simulations in rank-based Büchi automata complementation
Cited In (2)
This page was built for publication: Modular mix-and-match complementation of Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535356)
