Attracting Tangles to Solve Parity Games

Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, because they are widely believed to admit a polynomial solution, but so far no such algorithm is known. We propose a new algorithm to solve parity games based on learning tangles, which are strongly connected subgraphs for which one player has a strategy to win all cycles in the subgraph. We argue that tangles play a fundamental role in the prominent parity game solving algorithms. We show that tangle learning is competitive in practice and the fastest solver for large random games.

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

[2]  Massimo Benerecetti,et al.  Solving Parity Games via Priority Promotion , 2016, CAV.

[3]  René Mazala,et al.  Infinite Games , 2001, Automata, Logics, and Infinite Games.

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

[5]  Tom van Dijk,et al.  Oink: an Implementation and Evaluation of Modern Parity Game Solvers , 2018, TACAS.

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

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

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

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

[10]  Maks Verver,et al.  Practical improvements to parity game solving , 2013 .

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

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

[13]  John Fearnley,et al.  Efficient Parallel Strategy Improvement for Parity Games , 2017, CAV.

[14]  Massimo Benerecetti,et al.  Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games , 2017, GandALF.

[15]  Sanjay Jain,et al.  An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space , 2017, International Journal on Software Tools for Technology Transfer.

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

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

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

[19]  Orna Kupferman,et al.  Weak alternating automata and tree automata emptiness , 1998, STOC '98.

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

[21]  Massimo Benerecetti,et al.  A Delayed Promotion Policy for Parity Games , 2016, GandALF.

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

[23]  Tim A. C. Willemse,et al.  Improvement in Small Progress Measures , 2015, GandALF.

[24]  Massimo Benerecetti,et al.  Improving Priority Promotion for Parity Games , 2016, Haifa Verification Conference.

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