The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Complementation of Büchi Automata Revised
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
Observations on determinization of Büchi automata
Theoretical Computer Science - Implementation and application of automata
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Complementation, Disambiguation, and Determinization of Büchi Automata Unified
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Büchi Complementation and Size-Change Termination
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
On Minimal Odd Rankings for Büchi Complementation
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
GOAL extended: towards a research tool for omega automata and temporal logic
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Improved ramsey-based büchi complementation
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
Büchi complementation has been studied for five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches. For the performance of these approaches, there have been several complexity analyses but very few experimental results. What especially lacks is a comparative experiment on all the four approaches to see how they perform in practice. In this paper, we review the state of Büchi complementation, propose several optimization heuristics, and perform comparative experimentation on the four approaches. The experimental results show that the determinizationbased Safra-Piterman construction outperforms the other three and our heuristics substantially improve the Safra-Piterman construction and the slice-based construction.