Büchi Complementation Made Tight - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 University of Liverpool Liverpool

Abstract : The precise complexity of complementing \buchi\ 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 - \buchi\ complementation is more involved. Indeed, the construction of an EXPTIME complementation procedure took a quarter of a century from the introduction of \buchi\ automata in the early $60$s, and stepwise narrowing the gap between the upper and lower bound to a simple exponent of $6e^n$ for \buchi\ automata with $n$ states took four decades. % While the distance between the known upper $O\big0.96\,n^n\big$ and lower $\Omega\big0.76\,n^n\big$ bound on the required number of states has meanwhile been significantly reduced, an exponential factor remains between them. Also, the upper bound on the size of the complement automaton is not linear in the bound of its state space. These gaps are unsatisfactory from a theoretical point of view, but also because \buchi\ complementation is a useful tool in formal verification, in particular for the language containment problem. % This paper proposes a \buchi\ complementation algorithm whose complexity meets, modulo a quadratic $On^2$ factor, the known lower bound for \buchi\ complementation. It thus improves over previous constructions by an exponential factor and concludes the quest for optimal \buchi\ complementation algorithms.

Keywords : Automata and Formal Languages Büchi Complementation Automata Theory Nondeterministic Büchi Automata

Autor: Sven Schewe -

Fuente: https://hal.archives-ouvertes.fr/

DESCARGAR PDF