Improving Parity Games with Justifications

A software artifact to reproduce the experimental results in the paper: Improving Parity Games with Justifications.

Parity games are infinite two-player games played on node-weighted directed graphs. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game together with a winning strategy as a witness. In the accompanying paper, we improve three parity game algorithms by integrating a justification graph. These algorithms have been implemented and the improvements have been experimentally verified. This artifact aims to reproduce the claims made in Section 5, Experimental results in three steps. First, we provide the source code of the necessary software together with the necessary compilation scripts. Second, we provide the test data with scripts to reproduce the experiments. Third, we provide scripts to analyze the experimental data, generate the tables and equivalent figures. Finally, in order to anticipate possible problems, the result of every big step is provided in case some steps fail unexpectedly.

We provide an artifact file for the Virtual Machine located at https://struebli.informatik.uni-freiburg.de/vmcai2020ae/vmcai2020-v3.ova.
This file has sha256 39e227aeeb16e08264dc527cb93b8bd54affe931101f9ff6dff94d4fdeb77922.