DeepAI AI Chat
Log In Sign Up

Oink: an Implementation and Evaluation of Modern Parity Game Solvers

01/11/2018
by   Tom van Dijk, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/03/2018

Attracting Tangles to Solve Parity Games

Parity games have important practical applications in formal verificatio...
07/16/2019

Partial Solvers for Generalized Parity Games

Parity games have been broadly studied in recent years for their applica...
07/26/2018

A Parity Game Tale of Two Counters

Parity games have important practical applications in formal verificatio...
09/17/2019

Simple Fixpoint Iteration To Solve Parity Games

A naive way to solve the model-checking problem of the mu-calculus uses ...
10/30/2019

Solving Parity Games Using An Automata-Based Algorithm

Parity games are abstract infinite-round games that take an important ro...
10/10/2017

Accelerating Energy Games Solvers on Modern Architectures

Quantitative games, where quantitative objectives are defined on weighte...
10/26/2018

Fixpoint Games on Continuous Lattices

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