Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds

@inproceedings{Gazda2013ZielonkasRA,
  title={Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds},
  author={Maciej Gazda and Tim A. C. Willemse},
  booktitle={GandALF},
  year={2013}
}
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We investigate the complexity of Zielonka's Recursive algorithm for solving these special games, showing that the algorithm runs in O(d (n + m)) on weak games, and, somewhat surprisingly, that it requires exponential time to solve dull games and (nested… 

Figures and Tables from this paper

BDD-based parity game solving
TLDR
Zielonka’s BDD-based algorithm beats the B DD-based Priority Promotion algorithm by a small margin for games that are characteristic of practical verification problems, and the Fixpoint-Iteration algorithm performs similar to Ziel onka‘s algorithm for games with at most 5 different priorities.
Fatal Attractors in Parity Games: Building Blocks for Partial Solvers
TLDR
New forms of attractors are proposed that are monotone in that they are aware of specific static patterns of colors encountered in reaching a given node set in alternating fashion and can be embedded within greatest fixed-point computations to design solvers of parity games that run in polynomial time but are partial in thatthey may not decide the winning status of all nodes in the input game.
A Comparison of BDD-Based Parity Game Solvers
TLDR
This paper describes experiments with BDD-based implementations of four parity game solving algorithms, viz.
Oink: an Implementation and Evaluation of Modern Parity Game Solvers
TLDR
A new and easy to extend tool Oink is implemented, which is a high-performance implementation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games.
Improvement in Small Progress Measures
TLDR
The algorithm is modified so that it derives the winning strategy for both players in one pass, which reduces the upper bound on strategy derivation for SPM to O(dm.(n/floor(d/2))^floor( d/2)).
A Parity Game Tale of Two Counters
TLDR
This paper presents a parameterized parity game called the Two Counters game, which provides an exponential lower bound for a wide range of parity game solving algorithms and is the first to provide an exponentialLower bound to priority promotion with the delayed promotion policy, and theFirst to provide such a lower bound to tangle learning.
Practical Improvements to Parity Game Solving
TLDR
The empirical results will support the conclusion that considerable improvements over the state of the art are possible using a combination of careful tool design and implementation, application of powerful preprocessing operations, and the use of advanced heuristics in the implementation of the Small Progress Measures algorithm.
Practical improvements to parity game solving
TLDR
The empirical results will support the conclusion that considerable improvements over the state of the art are possible using a combination of careful tool design and implementation, application of powerful preprocessing operations, and the use of advanced heuristics in the implementation of the Small Progress Measures algorithm.
Strategy Derivation for Small Progress Measures
TLDR
This work provides a novel operational interpretation of progress measures, and modify the algorithm so that it derives the winning strategies for both players in one pass, and reduces the upper bound on strategy derivation for SPM.
Evidence extraction from parameterised Boolean equation systems
TLDR
This paper shows how to extract witnesses and counterexamples from parameterised Boolean equation systems encoding the model checking problem for the first-order modal μ-calculus in the modelling and analysis toolset mCRL2.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Fixed-Point Logics and Solitaire Games
TLDR
Solitaire-LFP, a fragment of least fixed-point logic, whose evaluation games are nested soltaire games, is studied, which means that on each strongly connected component of the game, only one player can make nontrivial moves.
An experimental study of algorithms and optimisations for parity games, with an application to
TLDR
The practical use of various optimisation techniques for solving parity games is investigated, showing that decomposition into strongly connected components and applying efficient algorithms for special cases are highly beneficial and the theoretic dependency on the number of priorities manifests itself in practice.
Small Progress Measures for Solving Parity Games
TLDR
A new algorithm for deciding the winner in parity games, and hence also for the modal µ-calculus model checking, based on a notion of game progress measures, characterized as pre-fixed points of certain monotone operators on a complete lattice.
Solving parity games in big steps
  • S. Schewe
  • Computer Science
    J. Comput. Syst. Sci.
  • 2007
Solving Parity Games in Practice
TLDR
A generic solver is presented that intertwines optimisations with any of the existing parity game algorithms which is only called on parts of a game that cannot be solved faster by simpler methods, showing that using this approach vastly speeds up the solving process.
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
  • W. Zielonka
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1998
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.
On the Complexity of Parity Word Automata
TLDR
It is shown that the special structure of the acceptance condition of parity automata can be used in order to solve the nonemptiness problem directly, with a dynamic graph algorithm of complexity O((n + m) log k).
Infinite Games Played on Finite Graphs
...
...