BÜCHI COMPLEMENTATION MADE TIGHTER
From MaRDI portal
Publication:5484906
DOI10.1142/S0129054106004145zbMATH Open1096.68081OpenAlexW4246764629MaRDI QIDQ5484906FDOQ5484906
Authors: Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi 
Publication date: 21 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054106004145
Recommendations
Cites Work
- Temporal logic can be more expressive
- Reasoning about infinite computations
- Asymptotic Estimates of Stirling Numbers
- Alternating automata on infinite trees
- The complementation problem for Büchi automata with applications to temporal logic
- Weak alternating automata are not that weak
- Title not available (Why is that?)
- Fair simulation
- Partial orders on words, minimal elements of regular languages, and state complexity
Cited In (29)
- A complete characterization of deterministic regular liveness properties
- Büchi complementation made tight
- The Büchi Complementation Saga
- \( \omega \)-automata
- A tight lower bound for Streett complementation
- Tight upper bounds for Streett and parity complementation
- On the power of finite ambiguity in Büchi complementation
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Modular mix-and-match complementation of Büchi automata
- State of Büchi complementation
- Tools and Algorithms for the Construction and Analysis of Systems
- Complementing Büchi Automata with Ranker
- Tighter Bounds for the Determinisation of Büchi Automata
- Automata Theory and Model Checking
- Automated Technology for Verification and Analysis
- Congruence Relations for Büchi Automata
- Title not available (Why is that?)
- Automata-Theoretic Model Checking Revisited
- On complementing nondeterministic Büchi automata
- Profile trees for Büchi word automata, with application to determinization
- Formal Verification of Executable Complementation and Equivalence Checking for Büchi Automata
- Title not available (Why is that?)
- From complementation to certification
- Unifying Büchi complementation constructions
- Towards a grand unification of Büchi complementation constructions
- Title not available (Why is that?)
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation
- Simulations in rank-based Büchi automata complementation
- Multi-Valued Reasoning about Reactive Systems
This page was built for publication: BÜCHI COMPLEMENTATION MADE TIGHTER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484906)
