Partial Solvers for Generalized Parity Games

by   Véronique Bruyère, et al.

Parity games have been broadly studied in recent years for their applications to controller synthesis and verification. In practice, partial solvers for parity games that execute in polynomial time, while incomplete, can solve most games in publicly available benchmark suites. In this paper, we combine those partial solvers with the classical recursive algorithm for parity games due to Zielonka. We also extend partial solvers to generalized parity games that are games with conjunction of parity objectives or disjunction of parity objectives. We have implemented those algorithms and evaluated them on a large set of benchmarks proposed in the last LTL synthesis competition.


page 1

page 2

page 3

page 4


A Comparison of BDD-Based Parity Game Solvers

Parity games are two player games with omega-winning conditions, played ...

Oink: an Implementation and Evaluation of Modern Parity Game Solvers

Parity games have important practical applications in formal verificatio...

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP

We study stochastic games with energy-parity objectives, which combine q...

On-The-Fly Solving for Symbolic Parity Games

Parity games can be used to represent many different kinds of decision p...

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems

We give a direct polynomial-time reduction from parity games played over...

Priority Promotion with Parysian Flair

We develop an algorithm that combines the advantages of priority promoti...

A Compositional Approach to Parity Games

In this paper, we introduce open parity games, which is a compositional ...