On Determinisation of Good-for-Games Automata

@inproceedings{Kuperberg2015OnDO,
  title={On Determinisation of Good-for-Games Automata},
  author={Denis Kuperberg and Michal Skrzypczak},
  booktitle={ICALP},
  year={2015}
}
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… 
Canonicity in GFG and Transition-Based Automata
TLDR
Limiting attention to the safe components is useful, and implies that the only minimal tDCWs that have no canonical form are these for which the transition to the GFG model results in strictly smaller automaton, which do have a canonical minimal form.
On Succinctness and Recognisability of Alternating Good-for-Games Automata
TLDR
The complexity of deciding "half-GFGness", a property specific to alternating automata that only requires nondeterministic choices to be resolved in an online manner, is studied, and it is shown that this problem is strictly more difficult than GFGness check.
Good for Games Automata: From Nondeterminism to Alternation
TLDR
It is shown that alternating G FG automata are as expressive as deterministic automata with the same acceptance conditions and indices, and that determinizing Buchi and co-Buchi alternating GFG automata involves a $2^{\Theta(n)}$ state blow-up.
Büchi Good-for-Games Automata Are Efficiently Recognizable
Good-for-Games (GFG) automata offer a compromise between deterministic and nondetermin-istic automata. They can resolve nondeterministic choices in a step-by-step fashion, without needing any
Computing the Width of Non-deterministic Automata
TLDR
It is shown that computing the width of an automaton is EXPTime-complete, which implies EXPTIME-completeness for multipebble simulation games on NFAs, and shows that checking whether a coB\"uchi automata is determinisable by pruning is NP-complete.
How Deterministic are Good-For-Games Automata?
TLDR
GFG automata enjoy the benefits of typeness, similarly to the case of deterministic automata, and are shown to be exponentially more succinct than deterministic ones.
Width of Non-deterministic Automata
TLDR
It is shown by proving that checking whether a coBuchi automaton is determinisable by pruning is NP-complete, and on finite or infinite words, it is shown that computing the width of an automaton are PSPACE-hard.
Eventually Safe Languages
TLDR
It is shown that GFG automata still enjoy exponential succinctness for LTL-definable languages and introduces a class of properties called “eventually safe” together with a specification language \( E \nu \mathrm {TL}\) for this class.
Minimising Good-for-Games automata is NP complete
TLDR
It is shown for the standard state based acceptance that the minimality of a GFG automaton is NP-complete for Buchi, Co-Buchi, and parity G FG automata, a surprisingly straight forward generalisation of the proofs from deterministic Buchi automata.
Minimization and Canonization of GFG Transition-Based Automata
TLDR
The minimization algorithm is described and used to show canonicity for transition-based GFG co-B¨uchi word automata: all minimal automata have isomorphic safe components and once the authors saturate the automata with α -transitions, they get full isomorphism.
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Solving Games Without Determinization
TLDR
The main insight is that a nondeterministic automaton is good for solving games if it fairly simulates the equivalent deterministicAutomata are constructed that omit the determinization step in game solving and reactive synthesis.
Are Good-for-Games Automata Good for Probabilistic Model Checking?
TLDR
It is shown how good-for-games automata can be used for the quantitative analysis of systems modeled by Markov decision processes against ω-regular specifications and evaluated by a series of experiments.
Nondeterminism in the Presence of a Diverse or Unknown Future
TLDR
It is shown that GFT=GFG⊃DBP, and described a determinization construction for GFG automata, which shows the possible succinctness of GFG and GFT automata compared to deterministic automata.
Forms of Determinism for Automata
TLDR
Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and various notions for finite words, infinite words, finite trees, infinite trees, data languages, and cost functions are instantiated.
Forms of Determinism for Automata (Invited Talk)
TLDR
Some variants of the notion of determinism are surveyed, refining the spectrum between non-determinism and determinism, and unambiguous automata are presented, strongly unambiguous Automata, prophetic automata, guidableAutomata, and history-deterministic automata.
Tree automata, mu-calculus and determinacy
  • E. Emerson, C. Jutla
  • Mathematics, Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
TLDR
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
TLDR
The propositional Mu-Calculus is equivalent in expressive power to finite automata on infinite trees and provides a radically simplified, alternative proof of Rabin's complementation lemma for tree automata, which is the heart of one of the deepest decidability results.
Solving sequential conditions by finite-state strategies
Our main purpose is to present an algorithm which decides whether or not a condition 𝕮(X, Y) stated in sequential calculus admits a finite automata solution, and produces one if it exists. This
Faster Solutions of Rabin and Streett Games
  • N. Piterman, A. Pnueli
  • Computer Science
    21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
  • 2006
TLDR
In order to prove completeness of the ranking method, a recursive fixpoint characterization of the winning regions in these games is given and it is shown that by keeping intermediate values during the fixpoint evaluation, such games can be solved symbolically in time O(nk+1k!) and space O( nk-1k!).
...
...