# Fatal Attractors in Parity Games: Building Blocks for Partial Solvers

@article{Huth2014FatalAI, title={Fatal Attractors in Parity Games: Building Blocks for Partial Solvers}, author={Michael Huth and Jim Huan-Pu Kuo and Nir Piterman}, journal={ArXiv}, year={2014}, volume={abs/1405.0386} }

Formal methods and verification rely heavily on algorithms that compute which states of a model satisfy a specified property. The un- derlying decision problems are often undecidable or have prohibitive com- plexity. Consequently, many algorithms represent partial solvers that may not terminate or report inconclusive results on some inputs but whose termi- nating, conclusive outputs are correct. It is therefore surprising that partial solvers have not yet been studied in verification based on…

## 8 Citations

Static Analysis of Parity Games: Alternating Reachability Under Parity

- Computer ScienceSemantics, Logics, and Calculi
- 2016

The determinacy of these games is proved and this determinacy is used to define, for each player, a monotone fixed point over an ordered domain of height linear in the size of the parity game such that all nodes in its greatest fixed point are won by said player in the paritygame.

Eﬀective partial solvers for parity games 1

- Computer Science
- 2016

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 Parity Games: Effective Polynomial-Time Composition

- Computer ScienceGandALF
- 2016

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.

Ju l 2 01 9 Partial Solvers for Generalized Parity Games

- Computer Science
- 2019

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.

Partial Solvers for Generalized Parity Games

- Computer ScienceRP
- 2019

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.

G T ] 5 F eb 2 01 6 Winning Cores in Parity Games

- Computer Science, Economics
- 2015

It is shown that the winning core and the winning region for a player in a parity game are equivalently empty, and a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation is developed.

Winning Cores in Parity Games

- Computer Science, Economics2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2016

It is shown that the winning core and the winning region for a player in a parity game are equivalently empty, and a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation is developed.

## References

SHOWING 1-10 OF 34 REFERENCES

Fatal Attractors in Parity Games

- Computer ScienceFoSSaCS
- 2013

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.

Fixed-Point Logics and Solitaire Games

- Computer ScienceTheory of Computing Systems
- 2004

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.

Solving Parity Games in Practice

- Computer ScienceATVA
- 2009

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.

A Discrete Stratety Improvement Algorithm for Solving Parity Games

- Computer Science
- 2000

A discrete strategy improvement algorithm is given for constructing winning strategies in parity games, thereby providing a new solution of the model-checking problem for the modal -calculus and providing a better conceptual understanding and easier analysis of strategy improvement algorithms for parity games.

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

- Computer ScienceGandALF
- 2013

It is shown that an optimisation of Zielonka's algorithm permits solving games from all three classes in polynomial time, and that there is a family of (non-special) games M that permits the algorithm to establish a lower bound of 2^(n/3), improving on the previous lower bound for the algorithm.

A Discrete Strategy Improvement Algorithm for Solving Parity Games

- Computer ScienceCAV
- 2000

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.…

Small Progress Measures for Solving Parity Games

- Computer ScienceSTACS
- 2000

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.

Counterexample-guided abstraction refinement for symbolic model checking

- Computer ScienceJACM
- 2003

An automatic iterative abstraction-refinement methodology that extends symbolic model checking to large hardware designs and devise new symbolic techniques that analyze such counterexamples and refine the abstract model correspondingly.

An O(n2) time algorithm for alternating Büchi games

- Computer ScienceSODA
- 2012

The first to break the O( n · m) boundary by presenting a new technique that reduces the running time to O(n2), and it is shown that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(N2), which is an improvement over earlier bounds for m > n4/3.