Static Analysis of Parity Games: Alternating Reachability Under Parity

@inproceedings{Huth2016StaticAO,
  title={Static Analysis of Parity Games: Alternating Reachability Under Parity},
  author={Michael Huth and Jim Huan-Pu Kuo and Nir Piterman},
  booktitle={Semantics, Logics, and Calculi},
  year={2016}
}
It is well understood that solving parity games is equivalent, upi¾?to polynomial time, to model checking of the modal mu-calculus. It is a long-standing open problem whether solving parity games or model checking modal mu-calculus formulas can be done in polynomial time. Ai¾?recent approach to studying this problem has been the design of partial solvers, algorithms that run in polynomial time and that may only solve parts of a parity game. Although it was shown that such partial solvers can… 
Parity game reductions
TLDR
This work reconsiders (governed) bisimulation and ( governed) stuttering bisimulations, and gives detailed proofs that these relations are equivalences, have unique quotients and they approximate the winning regions of parity games.
Partial Solvers for Parity Games: Effective Polynomial-Time Composition
TLDR
It is shown that use of such composition patterns discovers new partial solvers - including those that merge node sets that have the same but unknown winner - by studying games that composed partialsolvers can neither solve nor simplify.
Effective partial solvers for parity games 1
TLDR
It is shown that an implementation of this semantic framework manually discovers new partial solvers – including those that merge node sets that have the same but unknown winner – by studying games that composed partialsolvers can neither solve nor simplify.
Partial Solvers for Generalized Parity Games
TLDR
This paper combines the classical recursive algorithm for parity games due to Zielonka with partial solvers for generalized parity games that are games with conjunction of parity objectives or disjunction of parity objective.
Ju l 2 01 9 Partial Solvers for Generalized Parity Games
TLDR
This paper combines the classical recursive algorithm for parity games due to Zielonka with partial solvers for generalized parity games that are games with conjunction of parity objectives or disjunction of parity objective.

References

SHOWING 1-10 OF 34 REFERENCES
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.
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.
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.
The Descriptive Complexity of Parity Games
TLDR
This work investigates the case of an unbounded number of priorities, both for finite game graphs and for arbitrary ones, where winning regions are definable in guarded second-order logic but not in least-fixed point logic.
Fatal Attractors in Parity Games
TLDR
A new form of attractor in parity games is studied and used to define solvers that run in PTIME and are partial in that they do not solve all games completely, and it is proved that one partial solver solves all Buchi games.
An automata-theoretic approach to branching-time model checking
TLDR
It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.
Linear Time Algorithm for Weak Parity Games
TLDR
This work considers games played on graphs with the winning conditions for the players specified as weak-parity conditions and presents a linear time algorithm for solving weak-Parity games.
Model Checking Is Static Analysis of Modal Logic
TLDR
This paper proves thatFlow Logic can give an exact characterisation of the semantics of formulae in a modal logic and shows that model checking can be performed by means of state-of-the-art approaches to static analysis.
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.
Deciding the Winner in Parity Games is in UP \cap co-Up
...
1
2
3
4
...