A Cure for Stuttering Parity Games

We define governed stuttering bisimulation for parity games, weakening stuttering bisimulation by taking the ownership of vertices into account only when this might lead to observably different games. We show that governed stuttering bisimilarity is an equivalence for parity games and allows for a natural quotienting operation. Moreover, we prove that all pairs of vertices related by governed stuttering bisimilarity are won by the same player in the parity game. Thus, our equivalence can be used as a preprocessing step when solving parity games. Governed stuttering bisimilarity can be decided in $\mathcal{O}(n^2m)$ time for parity games with n vertices and m edges. Our experiments indicate that governed stuttering bisimilarity is mostly competitive with stuttering equivalence on parity games encoding typical verification problems.

[1]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

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

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

[4]  Jan Friso Groote,et al.  Verification of a sliding window protocol in μCRL and PVS , 2005, Formal Aspects of Computing.

[5]  Jaco van de Pol,et al.  State Space Reduction by Proving Confluence , 2002, CAV.

[6]  Pjl Pieter Cuijpers,et al.  Revised budget allocations for fixed-priority-scheduled periodic resources , 2012 .

[7]  Jan Obdrzálek,et al.  Clique-Width and Parity Games , 2007, CSL.

[8]  Jeroen Keiren,et al.  Bisimulation Minimisations for Boolean Equation Systems , 2009, Haifa Verification Conference.

[9]  Simona Orzan,et al.  Distributed Branching Bisimulation Reduction of State Spaces , 2003, Electron. Notes Theor. Comput. Sci..

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

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

[12]  Igor Walukiewicz,et al.  Games for synthesis of controllers with partial observation , 2003, Theor. Comput. Sci..

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

[14]  Sjoerd Cranen,et al.  Stuttering Mostly Speeds Up Solving Parity Games , 2011, NASA Formal Methods.

[15]  S. P. Luttik.  Description and formal specification of the Link Layer of P1394 , 1997, FME 1997.

[16]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[17]  Jaco van de Pol,et al.  Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems , 2007, CONCUR.

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

[19]  Thomas Wilke,et al.  Simulation Relations for Alternating Parity Automata and Parity Games , 2006, Developments in Language Theory.

[20]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

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

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

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

[24]  Carsten Fritz,et al.  Simulation-based simplification of omega-automata , 2013 .

[25]  Jan Friso Groote,et al.  Analysis of a distributed system for lifting trucks , 2003, J. Log. Algebraic Methods Program..

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

[27]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..