2012/10/09 by Daniel Neider, Roman Rabinovich, Martin Zimmermann · 1 citation
Computer Science · #cs.LO #cs.GT
paper · pdf · doi:10.4204/eptcs.96.13
published as EPTCS 96, 2012, pp. 169-182 · In Proceedings GandALF 2012, arXiv:1210.2028
arxiv created 2012/10/09 · arxiv updated 2012/10/10
We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite-state winning strategy for one player. This yields a novel antichain-based memory structure and a natural notion of permissive strategies for Muller games. Moreover, we generalize our construction by presenting a new type of game reduction from infinite games to safety games and show its applicability to several other winning conditions.