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.

翻译：均等游戏是无穷的双玩游戏,在定向图形上播放。对等游戏的解决者在正式验证领域使用。本文定义了准美对等游戏,并引入了为单一节点确定赢取策略的操作,即合理性。通过仔细排序“合理性步骤 ”, 我们从文献中重建了三个众所周知的算法。