PGSolver

Description

PGSolver is a collection of tools for generating, manipulating and - most of all - solving parity games. It features implementations of (almost) all known algorithms for parity games as well as heuristics for pre-processing and speeding up the solving process.

PGSolver is being developed and maintained at the chair for theoretical computer science of the University of Munich, Germany.

Version History

The latest version is 3.1, released on February 27th, 2012. No warranty can be given. Source code can be downloaded below. It is distributed under the BSD license.
The program is written in OCaml. You will therefore need an OCaml compiler to produce the executables. We recommend version ≥ 3.09, but smaller versions may also suffice. If you want to have support for the reductions to SAT you will also need a SAT solver. Please consult the documentation for a description of which SAT solvers are currently supported or how to embed a new one.

Download

Click on the download button below to obtain a tar.gz archive with PGSolver's source code. It also contains guidelines on how to compile and run it.

If you want to be notified whenever a newer version is available please provide your details. Otherwise leave the following fields blank. Do not enter fake email addresses or keywords like "test". That just messes up our statistics file. You really do not need to enter anything. We will give you the implementation even if you don't give us your details. Believe me. If you enter nonsense into the fields think twice before you press the download button. If you are extremely lucky we have a nice day and let you get away with it. Equally, we may not.

Name:
Email:
Affiliation:

For installation instructions see the included documentation. It is also available here in PDF format: Documentation.

Contact

Please direct and questions, enquiries, suggestions, etc. to Oliver Friedmann or Martin Lange.



Last modified: Mon Feb 27 10:55:23 CET 2012