A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
LTL Model Checking of Time-Inhomogeneous Markov Chains
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
On Minimal Odd Rankings for Büchi Complementation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Büchi store: an open repository of büchi automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A decision procedure for CTL* based on tableaux and automata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Efficient inclusion testing for simple classes of unambiguous ω-automata
Information Processing Letters
Improved ramsey-based büchi complementation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
We present a uniform framework for (1) complementing Büchi automata, (2) turning Büchi automata into equivalent unambiguous Büchi automata, and (3) turning Büchi automata into equivalent deterministic automata. We present the first solution to (2) which does not make use of McNaughton's theorem (determinization) and an intuitive and conceptually simple solution to (3).Our results are based on Muller and Schupp's procedure for turning alternating tree automata into non-deterministic ones.