< Terug naar vorige pagina

Publicatie

Improving Parity Game Solvers with Justifications

Boekbijdrage - Boekhoofdstuk Conferentiebijdrage

Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over parity games. The core problem of parity game solving is deciding the winner of some (or all) nodes in a parity game. In this paper, we improve several parity game solvers by using a justification graph. Experimental evaluation shows our algorithms improve upon the state-of-the-art.
Boek: Proceedings of VMCAI 2020
Pagina's: 449 - 470
Aantal pagina's: 22
ISBN:978-3-030-39321-2
Jaar van publicatie:2020
BOF-keylabel:ja
IOF-keylabel:ja
Authors from:Higher Education
Toegankelijkheid:Open