An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi-bi-linear complexity in the number of states and edges for a fixed number of colours, matching lower bounds for the algorithm of Calude et al., and a complexity index associated to our approach, which we compare to the recently proposed register index.

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

[2]  Cristian S. Calude,et al.  Deciding parity games in quasipolynomial time , 2017, STOC.

[3]  Karoliina Lehtinen,et al.  A modal μ perspective on solving parity games in quasi-polynomial time , 2018, LICS.

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

[5]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[6]  Marcin Jurdzinski,et al.  Succinct progress measures for solving parity games , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

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

[8]  Nir Piterman From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata , 2007, Log. Methods Comput. Sci..

[9]  A. Puri Theory of hybrid systems and discrete event systems , 1996 .

[10]  Oliver Friedmann,et al.  An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms , 2011, Log. Methods Comput. Sci..

[11]  Thomas Wilke,et al.  Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .

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

[13]  Lijun Zhang,et al.  A Simple Algorithm for Solving Qualitative Probabilistic Parity Games , 2016, CAV.

[14]  Keijo Heljanko,et al.  Solving parity games by a reduction to SAT , 2012, Journal of computer and system sciences (Print).

[15]  Moshe Y. Vardi Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[16]  Krishnendu Chatterjee,et al.  Improved Algorithms for One-Pair and k-Pair Streett Objectives , 2014, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

[18]  Bernd Finkbeiner,et al.  Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus , 2006, CSL.

[19]  John Fearnley,et al.  Non-oblivious Strategy Improvement , 2010, LPAR.

[20]  D. Kozen Results on the Propositional µ-Calculus , 1982 .

[21]  Sven Schewe,et al.  An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games , 2008, CSL.

[22]  Sven Schewe,et al.  Solving parity games in big steps , 2007, J. Comput. Syst. Sci..

[23]  M. Lange,et al.  The PGSolver Collection of Parity Game Solvers Version 3 , 2010 .

[24]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

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

[26]  L. Goddard Information Theory , 1962, Nature.

[27]  Sven Schewe,et al.  Symmetric Strategy Improvement , 2015, ICALP.

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

[29]  Walter Ludwig,et al.  A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem , 1995, Inf. Comput..

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

[31]  Somesh Jha,et al.  An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1997, Theor. Comput. Sci..

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

[33]  Thomas A. Henzinger,et al.  From verification to control: dynamic programs for omega-regular objectives , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[34]  Sanjay Jain,et al.  An ordered approach to solving parity games in quasi polynomial time and quasi linear space , 2017, SPIN.

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

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

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

[38]  Bernd Finkbeiner,et al.  Synthesis of Asynchronous Systems , 2006, LOPSTR.

[39]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discret. Appl. Math..