Corpus ID: 18124567

Antichains for Inclusion Games

  title={Antichains for Inclusion Games},
  author={Luk{\'a}s Hol{\'i}k and Roland Meyer and Sebastian Muskalla},
We study two-player games played on the infinite graph of sentential forms induced by a context-free grammar (that comes with an ownership partitioning of the non-terminals). The winning condition is inclusion in a regular language for the terminal words derived in maximal plays. Our contribution is an algorithm to compute a finite representation of all plays starting in a non-terminal. The representation is compositional and, once obtained for the non-terminals, immediate to lift to sentential… Expand


Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the saturation techniqueExpand
Note on winning positions on pushdown games with [omega]-regular conditions
  • O. Serre
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 2003
This work considers infinite two-player games on pushdown graphs and shows that the set of winning positions of each player is regular and an effective construction of an alternating automaton recognizing it, providing a DEXPTIME procedure to decide whether a position is winning for a given player. Expand
Symbolic Strategy Synthesis for Games on Pushdown Graphs
An automata theoretic approach is provided to compute uniformly the winning region of a player and corresponding winning strategies, if the goal set is regular, and two kinds of strategies are computed: positional ones which require linear execution time in each step, and strategies with pushdown memory where a step can be executed in constant time. Expand
Games for Active XML Revisited
The paper studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games, to decide whether the first player, Juliet, has a winning strategy for a given game and (nested) word; this corresponds to a successful rewriting strategy for an intensional document. Expand
Active Context-Free Games
The complexity of deciding the existence of winning strategies for JULIET is investigated, depending on properties of the grammar and of the target language, and on restrictions on the strategy. Expand
Ramsey Goes Visibly Pushdown
The solutions are more direct and generalize the so-called Ramsey-based inclusion-checking algorithms, which apply to classical finite-state automata and proved effective there, to visibly pushdown automata, and experimentally evaluate them thereby demonstrating the virtues of avoiding determinization and complementation constructions. Expand
Efficient Coverability Analysis by Proof Minimization
This paper considers multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure and presents a novel, sound and complete yet empirically much improved solution to the coverability problem for well-structured transition systems (WSTS). Expand
Advanced automata minimization
An efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language is presented, and methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances than before are described. Expand
Efficient Büchi Universality Checking
It is suggested that a portfolio approach may be the best approach to checking the universality of Buchi automata universality, because on many of the most difficult areas the rank-based approach provides the superior tool. Expand
Antichains: A New Algorithm for Checking Universality of Finite Automata
A new algorithm for checking the universality of nondeterministic finite automata, which computes the least fixed point of a monotone function on the lattice of antichains of state sets and evaluates the performance of this algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. Expand