Solving parity games with tangles

Description

Parity games are well known for their applications in formal verification and synthesis, especially to solve both the model-checking and synthesis problems of the modal mu-calculus and related logics like LTL. We have published two novel contributions to this field in the past year and are working on a third. This presentation is based on publications at TACAS'2018 and CAV'2018 containing the following contributions. Oink is a new implementation of parity game solvers much like the well known PGSolver, but it has a much improved practical performance and we use Oink to perform a new modern comparison of parity game solvers. The tool is designed for easy integration with other toolchains and for easy replication of research results.

Period	19 Sept 2018
Event title	Conference, Highlights of Logic, Games and Automata, Berlin
Event type	Conference
Location	GermanyShow on map