Concurrent Small Progress Measures

We report on multi-core implementations of parity game solvers based on Small Progress Measures. We revisit a known implementation of multi-core machines (PW solver), and change, in what we call the PWe solver, the way it computes progress measures. We then suggest an alternative implementation (CSPM), that reduces logical dependency on configuration state and makes performance less dependent on configuration details. In experimental evaluation, both PWe and CSPM out-perform PW. On most benchmarks, especially larger ones, CSPM performs better than PWe. The observed linear speed-up of parallelization shows great promise for parallel implementations of game solvers.

[1]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

[2]  Hadas Kress-Gazit,et al.  Where's Waldo? Sensor-Based Temporal Logic Motion Planning , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[3]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[4]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[7]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[8]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[9]  Oliver Friedmann,et al.  A Decision Procedure for CTL* Based on Tableaux and Automata , 2010, IJCAR.

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

[11]  Jaco van de Pol,et al.  A Multi-Core Solver for Parity Games , 2008, Electron. Notes Theor. Comput. Sci..

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

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

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

[15]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

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

[17]  Kousha Etessami,et al.  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.