Symmetry Reduction in Infinite Games with Finite Branching

Symmetry reductions have been applied extensively for the verification of finite-state concurrent systems and hardware designs using model-checking of temporal logics such as LTL, CTL and CTLs, as well as real-time and probabilistic-system model-checking. In this paper we extend the technique to handle infinite-state games on graphs with finite branching where the objectives of the players can be very general. As particular applications, it is shown that the technique can be applied to reduce the state space in parity games as well as when doing model-checking of the temporal logic ATLs.

[1]  Thomas Wahl,et al.  SVISS: Symbolic Verification of Symmetric Systems , 2008, TACAS.

[2]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[4]  Marta Z. Kwiatkowska,et al.  Symmetry Reduction for Probabilistic Model Checking , 2006, CAV.

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

[6]  Nicolas Markey,et al.  ATL with Strategy Contexts: Expressiveness and Model Checking , 2010, FSTTCS.

[7]  Fabio Mogavero.  Reasoning About Strategies , 2013, FSTTCS 2013.

[8]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[9]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[10]  A. Prasad Sistla.  Symmetry Reductions in Model-Checking , 2003, VMCAI.

[11]  David L. Dill,et al.  Better verification through symmetry , 1996, Formal Methods Syst. Des..

[12]  Krishnendu Chatterjee,et al.  Strategy logic , 2007, Inf. Comput..

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

[14]  Gerd Behrmann,et al.  Adding Symmetry Reduction to Uppaal , 2003, FORMATS.

[15]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

[16]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[17]  A. Prasad Sistla,et al.  Symmetry Reductions in Model Checking , 1998, CAV.

[18]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[19]  Dénes König,et al.  Theorie der endlichen und unendlichen Graphen : kombinatorische Topologie der Streckenkomplexe , 1935 .

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