Justifications and a Reconstruction of Parity Game Solving Algorithms
Logic in Computer Science
2021-02-03 v1
Abstract
Parity games are infinite two-player games played on directed graphs. Parity game solvers are used in the domain of formal verification. This paper defines parametrized parity games and introduces an operation, Justify, that determines a winning strategy for a single node. By carefully ordering Justify steps, we reconstruct three algorithms well known from the literature.
Keywords
Cite
@article{arxiv.2102.01440,
title = {Justifications and a Reconstruction of Parity Game Solving Algorithms},
author = {Ruben Lapauw and Maurice Bruynooghe and Marc Denecker},
journal= {arXiv preprint arXiv:2102.01440},
year = {2021}
}
Comments
16 pages, to appear in "LNCS Honorary Volume for Manuel Hermenegildo" [AVERTIS 2019]