Universal Algorithms for Parity Games and Nested Fixpoints

@inproceedings{Jurdzinski2020UniversalAF,
  title={Universal Algorithms for Parity Games and Nested Fixpoints},
  author={Marcin Jurdzi'nski and R{\'e}mi Morvan and K. S. Thejaswini},
  booktitle={Principles of Systems Design},
  year={2020}
}
A bstract An attractor decomposition meta-algorithm for solving parity games is given that general-ises the classic McNaughton-Zielonka algorithm and its recent quasi-polynomial variants due to Parys ( 2019 ), and to Lehtinen, Schewe, and Wojtczak ( 2019 ). The central concepts studied and exploited are attractor decompositions of dominia in parity games and the ordered trees that describe the inductive structure of attractor decompositions. The universal algorithm yields McNaughton-Zielonka… 
View PDF on arXiv
2 Citations

2 Citations

A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games

This work pin-points the mechanism that is responsible for relative underperformance in the classic McNaughton-Zielonka algorithm, and proposes a new technique that eliminates it, based on enhancing the algorithm to compute attractor decompositions of subgames instead of just winning strategies on them.

Operations on Fixpoint Equation Systems

This work studies operations on fixpoint equation systems (FES) over arbitrary complete lattices and investigates under which conditions these operations, such as substituting variables by their definition, preserve the solution of a FES.

43 References

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games

The technical highlights are a quasi-polynomial lower bound on the size of universal ordered trees and a proof that every separating safety automaton has a universal tree hidden in its state space.

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

A black-box set-based symbolic algorithm based on the explicit progress measure algorithm that requires quasi-polynomially many symbolic operations and poly-logarithmic symbolic space for parity games and any future improvement in progress measure based explicit algorithms imply an efficiency improvement in this algorithm.

A Discrete Strategy Improvement Algorithm for Solving Parity Games

A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.…

Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time

A small modification of the Zielonka's algorithm is proposed, which ensures that the running time is at most quasi-polynomial, and it is hoped that this algorithm, after further optimizations, can lead to an algorithm that shares the good performance of the ziggurat's algorithm on typical inputs, while reducing the worst-case complexity on difficult inputs.

Fixpoint games on continuous lattices

A game-theoretical approach to the solution of systems of monotone equations over lattices, where for each single equation either the least or greatest solution is taken, which leads to a constructive formulation of progress measures as (least) fixpoints.

A modal μ perspective on solving parity games in quasi-polynomial time

We present a new quasi-polynomial algorithm for solving parity games. It is based on a new bisimulation invariant measure of complexity for parity games, called the register-index, which captures the…

A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation

Following a recent development for parity games, it is shown here that a quasi-polynomial number of queries is sufficient, namely nlg(d/ lg n)+O(1), an abstract version of several algorithms proposed recently by a number of authors, which involve (implicitly or explicitly) the structure of a universal tree.

Deciding parity games in quasipolynomial time

It is shown that the parity game can be solved in quasipolynomial time and it is proven that coloured Muller games with n nodes and m colours can be decided in time O((mm · n)5); it is also shown that this bound cannot be improved to O((2m · n), for any c, unless FPT = W[1].

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

It is shown that, unlike fair simulation, delayed simulation preserves the automaton language upon quotienting, and that it allows substantially better state reduction than direct simulation.

Lattice-theoretic progress measures and coalgebraic model checking

This paper identifies the essence of this workflow to be the notion of progress measure, and formalizes it in general, possibly infinitary, lattice-theoretic terms, to a general model-checking framework, where systems are categorically presented as coalgebras.