Parity games are two-player zero-sum games of infinite duration played on finite graphs for
which no solution in polynomial time is still known. Solving a parity game is an NP∩ co-NP …

In this paper we provide a broad investigation of the symbolic approach for solving Parity
Games. Specifically, we implement in a fresh tool, called, four symbolic algorithms to solve …

Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest
among the many existing parity game algorithms. However, its complexity is exponential …

In this paper, we review a broad investigation of the symbolic approach for solving Parity
Games. Specifically, we implement in a tool, called SymPGSolver, four symbolic algorithms …

Parity games are abstract infinite-round games that take an important role in formal
verification. In the basic setting, these games are two-player, turn-based, and played under …

Parity games can be used to represent many different kinds of decision problems. In
practice, tools that use parity games often rely on a specification in a higher-order logic from …

Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time
algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial …

Alpaga is a solver for two-player parity games with imperfect information. Given the
description of a game, it determines whether the first player can ensure to win and, if so, it …

We consider parity games, a special form of two-player infinite-duration games on
numerically labelled graphs, whose winning condition requires that the maximal value of a …

This is a selective survey of algorithms for solving parity games, which are infinite games
played on finite graphs. Parity games are an important class of omega-regular games, ie …