Oink: an Implementation and Evaluation of Modern Parity Game Solvers

TL;DR

This paper introduces Oink, a high-performance tool implementing modern parity game algorithms, and provides an extensive empirical evaluation showing its superior performance over existing solvers.

Contribution

The paper presents Oink, a new extensible implementation of modern parity game algorithms, along with a comprehensive empirical evaluation on real and random benchmarks.

Findings

Oink outperforms existing state-of-the-art parity game solvers.

Modern algorithms can be effectively implemented and extended in a unified tool.

Empirical results demonstrate the efficiency of the proposed methods.

Abstract

Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, as they are widely believed to admit a polynomial solution, but so far no such algorithm is known. In recent years, a number of new algorithms and improvements to existing algorithms have been proposed. We implement a new and easy to extend tool Oink, which is a high-performance implementation of modern parity game algorithms. We further present a comprehensive empirical evaluation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games. Our experiments show that our new tool Oink outperforms the current state-of-the-art.