Nondeterminism in the Presence of a Diverse or Unknown Future

  title={Nondeterminism in the Presence of a Diverse or Unknown Future},
  author={Udi Boker and Denis Kuperberg and Orna Kupferman and Michal Skrzypczak},
Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that… 
A Hierarchy of Nondeterminism
It is shown that the hierarchy is strict, the expressive power of the different levels in it is studied, as well as the complexity of deciding the membership of a language in a given level, which relates the level of nondeterminism with the probability that a random run on a word in the language is accepting.
Between Deterministic and Nondeterministic Quantitative Automata
The possible generalization of such notions from Boolean to quantitative automata is analyzed, and it is suggested that it depends on the following key characteristics of the considered notion N– whether it is syntactic or semantic, and if semantic,Whether it is word-based or language-based.
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.
Minimization and Canonization of GFG Transition-Based Automata
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.
On (I/O)-Aware Good-For-Games Automata
(I/O)-aware GFG automata are unboundedly more succinct than deterministic and even GFG automation, using them circumvents determinization, and their study leads to new and interesting insights about hostile vs. collaborative nondeterminism, as well as the theoretical bound for realizing systems.
On Succinctness and Recognisability of Alternating Good-for-Games Automata
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.
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
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.
Good for Games Automata: From Nondeterminism to Alternation
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.
Canonicity in GFG and Transition-Based Automata
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 the complexity of omega -automata
  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.
Safraless decision procedures
This paper translations are significantly simpler than the standard approach, less difficult to implement, and have practical advantages like being amenable to optimizations and a symbolic implementation, and it is shown that the approach yields better complexity bounds.
Decision problems forω-automata
  • L. Landweber
  • Computer Science, Mathematics
    Mathematical systems theory
  • 2005
This paper considers various definitions for machines of this type, including ones introduced by Biichi and McNaughton, and classify the complexity of definable sets of sequences for each type of finite automaton.
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.
Deciding branching time logic
The decision procedure exploits the special structure of the finite state ω-automata for linear temporal formulae which allows them to be determinized with only a single exponential blowup in size.
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
Finite Automata and Their Decision Problems
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Reasoning About Infinite Computations
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
Trees, automata, and games
This work gives here an alternative and transparent proof of Rabin's result on tree automata, which is based on ideas of his predecessors and especially those of B- and-uuml;chi-&-mdash;.
Weakly Definable Relations and Special Automata