On Determinisation of Good-for-Games Automata

Abstract

In this work we study Good-For-Games (GFG) automata over $\omega$-words: non-deterministic automata where the non-determinism can be resolved by a strategy depending only on the prefix of the $\omega$-word read so far. These automata retain some advantages of determinism: they can be composed with games and trees in a sound way, and inclusion $\mathrm {L} (\mathcal {A})\supseteq \mathrm {L} (\mathcal {B})$ can be reduced to a parity game over $\mathcal {A} \times \mathcal {B}$ if $\mathcal {A}$ is GFG. Therefore, they could be used to some advantage in verification, for instance as solutions to the synthesis problem.

The main results of this work answer the question whether parity GFG automata actually present an improvement in terms of state-complexity (the number of states) compared to the deterministic ones. We show that a frontier lies between the Büchi condition, where GFG automata can be determinised with only quadratic blow-up in state-complexity; and the co-Büchi condition, where GFG automata can be exponentially smaller than any deterministic automaton for the same language. We also study the complexity of deciding whether a given automaton is GFG.

Research funded by ANR/DGA project Cx (ref. ANR-13-ASTR-0006); and by fondation STAE project BRIefcaSE. The second author has been supported by Poland’s National Science Centre grant (decision DEC-2014-13/B/ST6/03595).