The Büchi Complementation Saga
نویسنده
چکیده
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset construction is justified by a tight lower bound. For Büchi automata on infinite words, which are required for the modeling of liveness properties, optimal complementation constructions are quite complicated, as the subset construction is not sufficient. We review here progress on this problem, which dates back to its introduction in Büchi’s seminal 1962 paper.
منابع مشابه
Büchi Complementation: A Forty-Year Saga
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In order to check that the language of an automaton A1 is contained in the language of a second automaton A2, one checks that the intersection of A1 with an automaton that complements A2 is empty. Many problems in verification and design are reduced to language containment. In model ...
متن کاملComplementation Constructions for Nondeterministic Automata on Infinite Words
The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis tech...
متن کاملBüchi Complementation Made Tight
The precise complexity of complementing Büchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple – it suffices to determinize them using a simple subset construction and to dualize the acceptance condition of the resulting automaton – Büchi complementation is more involved. Indeed, the construction of an EXPTIME complemen...
متن کاملTight Bounds for the Determinisation and Complementation of Generalised Büchi Automata
Generalised Büchi automata are Büchi automata with multiple accepting sets. They form a class of automata that naturally occurs, e.g., in the translation from LTL to ω-automata. In this paper, we extend current determinisation techniques for Büchi automata to generalised Büchi automata and prove that our determinisation is optimal. We show how our optimal determinisation technique can be used a...
متن کاملLower Bounds for Complementation of ω-Automata via the Full Automata Technique
In this paper, we first introduce a new lower bound technique for the state complexity of transformations of automata. Namely we suggest considering the class of full automata in lower bound analysis. Then we apply such technique to the complementation of nondeterministic ωautomata and obtain several lower bound results. Particularly, we prove anΩ((0.76n)) lower bound for Büchi complementation,...
متن کامل