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 2 Omathcal(n log n) instead of 2Omathcal(n 2). © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Breuers, S., Löding, C., & Olschewski, J. (2012). Improved ramsey-based büchi complementation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7213 LNCS, pp. 150–164). https://doi.org/10.1007/978-3-642-28729-9_10
Mendeley helps you to discover research relevant for your work.