Canonicity in GFG and Transition-Based Automata

  title={Canonicity in GFG and Transition-Based Automata},
  author={Bader Abu Radi and O. Kupferman},
Minimization of deterministic automata on finite words results in a {\em canonical\/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists, and a language may have different minimal deterministic Buchi (DBW) or co-Buchi (DCW) automata. In recent years, researchers have studied {\em good-for-games\/} (GFG) automata -- nondeterministic automata that can resolve their nondeterministic choices in a way that only depends on the past. Several applications of… Expand
3 Citations

Figures from this paper

Minimization and Canonization of GFG Transition-Based Automata
Their minimization algorithm is based on a sequence of transformations the authors apply to the automaton, on top of which a minimal quotient automaton is defined, and all minimal automata have isomorphic safe components and once they saturate the automata with α-transitions, they get full isomorphism. Expand
Technical Report Column
This report presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of manually cataloging and cataloging all the components of a smart phone. Expand
On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions
It is deduced that finding the chromatic memory requirements of a Muller condition is NP-complete, and it is proved that chromatic memories cannot be optimal in general, disproving a conjecture by Kopczyński. Expand


Limit-Deterministic Büchi Automata for Linear Temporal Logic
This work presents a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton, which yields much smaller automata for formulas with deep nesting of modal operators and performs at least as well as the existing approaches on general formulas. Expand
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
  • S. Schewe
  • Mathematics, Computer Science
  • 2010
The NP-completeness of the problem of minimising deterministic automata over finite and infinite words is established, and the introduction of almost equivalence is introduced, an equivalence class for strictly between language equivalence for deterministic \buchi\ or \cobuchi\ automata and language equivalenced automata. Expand
How Deterministic are Good-For-Games Automata?
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. Expand
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 anyExpand
On Determinisation of Good-for-Games Automata
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. Expand
Good-for-games ω-Pushdown Automata
These are automata whose nondeterminism can be resolved based on the run constructed thus far and it follows that the universality problem for ω-GFG-PDA is in EXPTIME as well. Expand
Solving Games Without Determinization
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. Expand
Nondeterminism in the Presence of a Diverse or Unknown Future
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. Expand
A Better Translation From LTL to Transition-Based Generalized Büchi Automata
This paper decomposes the translation from LTL to TGBA into three steps to give a step-wise description and improves all three steps, and introduces a new definition of acceptance conditions. Expand
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
This paper describes how, by labeling automata transitions rather than states, the size of automata generated by existing tableau-based translation algorithms is significantly reduced. Expand