Winning Cores in Parity Games

We introduce the novel notion of winning cores in parity games and develop a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation. Underlying this algorithm are a number properties about winning cores which are interesting in their own right. In particular, we show that the winning core and the winning region for a player in a parity game are equivalently empty. Moreover, the winning core contains all fatal attractors but is not necessarily a dominion itself. Experimental results are very positive both with respect to quality of approximation and running time. It outperforms existing state-of-the-art algorithms significantly on most benchmarks.

[1]  Oliver Friedmann,et al.  Recursive algorithm for parity games requires exponential time , 2011, RAIRO Theor. Informatics Appl..

[2]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[3]  Jan Obdrzálek,et al.  Fast Mu-Calculus Model Checking when Tree-Width Is Bounded , 2003, CAV.

[4]  Wolfgang Thomas,et al.  On the Synthesis of Strategies in Infinite Games , 1995, STACS.

[5]  Uri Zwick,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.

[6]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[7]  Angelika Mader,et al.  Verification of modal properties using Boolean equation systems , 1997 .

[8]  Sven Schewe Solving Parity Games in Big Steps , 2007, FSTTCS.

[9]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[10]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[11]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[12]  Andrzej Wlodzimierz Mostowski,et al.  Regular expressions for infinite trees and a standard form of automata , 1984, Symposium on Computation Theory.

[13]  Michael Huth,et al.  Fatal Attractors in Parity Games: Building Blocks for Partial Solvers , 2014, ArXiv.

[14]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[15]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[16]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[17]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  Michael Huth,et al.  Fatal Attractors in Parity Games , 2013, FoSSaCS.

[19]  Stephan Kreutzer,et al.  DAG-Width and Parity Games , 2006, STACS.

[20]  Jeroen Keiren,et al.  Benchmarks for Parity Games , 2014, FSEN.

[21]  Oliver Friedmann,et al.  Solving Parity Games in Practice , 2009, ATVA.

[22]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[23]  M. Paterson,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA 2006.

[24]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[25]  Stephan Kreutzer,et al.  Graph operations on parity games and polynomial-time algorithms , 2016, Theor. Comput. Sci..

[26]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

[27]  Colin Stirling,et al.  Lokal Model Checking Games , 1995, CONCUR.

[28]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[29]  Krishnendu Chatterjee,et al.  Linear Time Algorithm for Weak Parity Games , 2008, ArXiv.

[30]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[31]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[32]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[33]  Kazuhisa Makino,et al.  Parameterized Algorithms for Parity Games , 2015, MFCS.

[34]  Hugo Gimbert,et al.  Games Where You Can Play Optimally Without Any Memory , 2005, CONCUR.