The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
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
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
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Advanced Ramsey-based Büchi automata inclusion testing
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th 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
| Hi-index | 0.00 |
We consider complementing Büchi automata by applying the Ramsey-based approach, which is the original approach already used by Büchi and later improved by Sistla et al. We present several heuristics to reduce the state space of the resulting complement automaton and provide experimental data that shows that our improved construction can compete (in terms of finished complementation tasks) also in practice with alternative constructions like rank-based complementation. Furthermore, we show how our techniques can be used to improve the Ramsey-based complementation such that the asymptotic upper bound for the resulting complement automaton is 2O(n log n) instead of 2O(n2).