Partial Order Reduction for Reachability Games

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability/safety objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.

[1]  Peter Niebert,et al.  Partial Order Reductions for Bisimulation Checking , 1998, FSTTCS.

[2]  Kim G. Larsen,et al.  Discrete and continuous strategies for timed-arc Petri net games , 2017, International Journal on Software Tools for Technology Transfer.

[3]  Scott A. Smolka,et al.  Partial-Order Reduction in the Weak Modal Mu-Calculus , 1997, CONCUR.

[4]  Serge Haddad,et al.  Concurrent Games on VASS with Inhibition , 2012, CONCUR.

[5]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

[6]  Jirí Srba,et al.  TAPAAL and Reachability Analysis of P/T Nets , 2016, Trans. Petri Nets Other Model. Concurr..

[7]  Pierre Castagna,et al.  Product Specification in a Service-Oriented Holonic Manufacturing System using Petri-Nets , 2013 .

[8]  Brian Logan,et al.  On the Complexity of Resource-Bounded Logics , 2016, RP.

[9]  Alfons Laarman,et al.  Partial-Order Reduction for Multi-core LTL Model Checking , 2014, Haifa Verification Conference.

[10]  Kim G. Larsen,et al.  Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems , 2018, CAV.

[11]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[12]  Armin Zimmermann,et al.  Making Workflow Models Sound Using Petri Net Controller Synthesis , 2004, CoopIS/DOA/ODBASE.

[13]  Reggie Davidrajuh,et al.  Detecting Existence of Cycles in Petri Nets - An Algorithm that Computes Non-redundant (Nonzero) Parts of Sparse Adjacency Matrix , 2016, SOCO-CISIS-ICEUTE.

[14]  Wojciech Penczek,et al.  Towards Partial Order Reductions for Strategic Ability , 2018, AAMAS.

[15]  Niels Lohmann,et al.  Stubborn Sets for Simple Linear Time Properties , 2012, Petri Nets.

[16]  Michael R. Hansen,et al.  Synthesis of Railway-Signaling Plans using Reachability Games , 2016, IFL 2016.

[17]  Kim G. Larsen,et al.  Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization , 2016, SPIN.

[18]  Kim G. Larsen,et al.  A Distributed Fixed-Point Algorithm for Extended Dependency Graphs , 2018, Fundam. Informaticae.

[19]  Rustam Tagiew,et al.  Multi-Agent Petri-Games , 2008, 2008 International Conference on Computational Intelligence for Modelling Control & Automation.

[20]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[21]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[22]  Peter Gjøl Jensen,et al.  Artifact for "Partial Order Reduction for Reachability Games" , 2019 .

[23]  Pierre Wolper,et al.  Partial-order methods for model checking: from linear time to branching time , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[24]  Jirí Srba,et al.  TAPAAL 2.0: Integrated Development Environment for Timed-Arc Petri Nets , 2012, TACAS.

[25]  Kim G. Larsen,et al.  PTrie: Data Structure for Compressing and Storing Sets via Prefix Sharing , 2017, ICTAC.

[26]  Antti Valmari,et al.  Stubborn Set Intuition Explained , 2016, PNSE @ Petri Nets.