DeepAI AI Chat
Log In Sign Up

Simple Fixpoint Iteration To Solve Parity Games

by   Tom van Dijk, et al.

A naive way to solve the model-checking problem of the mu-calculus uses fixpoint iteration. Traditionally however mu-calculus model-checking is solved by a reduction in linear time to a parity game, which is then solved using one of the many algorithms for parity games. We now consider a method of solving parity games by means of a naive fixpoint iteration. Several fixpoint algorithms for parity games have been proposed in the literature. In this work, we introduce an algorithm that relies on the notion of a distraction. The idea is that this offers a novel perspective for understanding parity games. We then show that this algorithm is in fact identical to two earlier published fixpoint algorithms for parity games and thus that these earlier algorithms are the same. Furthermore, we modify our algorithm to only partially recompute deeper fixpoints after updating a higher set and show that this modification enables a simple method to obtain winning strategies. We show that the resulting algorithm is simple to implement and offers good performance on practical parity games. We empirically demonstrate this using games derived from model-checking, equivalence checking and reactive synthesis and show that our fixpoint algorithm is the fastest solution for model-checking games.


page 1

page 2

page 3

page 4


Attracting Tangles to Solve Parity Games

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

Featured Games

Feature-based SPL analysis and family-based model checking have seen rap...

A Compositional Approach to Parity Games

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

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants

We introduce a new game-theoretic semantics (GTS) for the modal mu-calcu...

Fixpoint Games on Continuous Lattices

Many analysis and verifications tasks, such as static program analyses a...

Higher-Order Model Checking Step by Step

We show a new simple algorithm that solves the model-checking problem fo...

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

Solving parity games, which are equivalent to modal μ-calculus model che...