An Approach to Distributed State Space Exploration for Coloured Petri Nets

We present an approach and associated computer tool support for conducting distributed state space exploration for Coloured Petri Nets (CPNs). The distributed state space exploration is based on the introduction of a coordinating process and a number of worker processes. The worker processes are responsible for the storage of states and the computation of successor states. The coordinator process is responsible for the distribution of states and termination detection. A main virtue of our approach is that it can be directly implemented in the existing single-threaded framework of Design/CPN and CPN Tools. This makes the distributed state space exploration and analysis largely transparent to the analyst. We illustrate the use of the developed tool on an example.

[1]  Flavio Lerda,et al.  Distributed-Memory Model Checking with SPIN , 1999, SPIN.

[2]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[3]  Orna Grumberg,et al.  Preface: volume 89 , 2003 .

[4]  Orna Grumberg Different directions in parallel and distributed model checking (invited talk) , 2002, Electron. Notes Theor. Comput. Sci..

[5]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[6]  Radu Mateescu,et al.  Parallel state space construction for model-checking , 2001, SPIN '01.

[7]  Philippe Schnoebelen,et al.  Systems and Software Verification , 2001, Springer Berlin Heidelberg.

[8]  Mieke Massink,et al.  Theoretical and Practical Aspects of SPIN Model Checking , 1999, Lecture Notes in Computer Science.

[9]  W. H. J. Feijen,et al.  Derivation of a termination detection algorithm for distributed computations , 1986 .

[10]  David L. Dill,et al.  Parallelizing the Murphi Verifier , 1997, CAV.

[11]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts , 1992 .

[12]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[13]  David L. Dill,et al.  Parallelizing the Murϕ Verifier , 2001, Formal Methods Syst. Des..

[14]  Philippe Schnoebelen,et al.  Systems and Software Verification, Model-Checking Techniques and Tools , 2001 .

[15]  Frits W. Vaandrager,et al.  Distributing Timed Model Checking - How the Search Order Matters , 2000, CAV.

[16]  Lubos Brim,et al.  Distributed LTL model-checking in SPIN , 2001, SPIN '01.

[17]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[18]  Stephan Merz,et al.  Model Checking , 2000 .

[19]  Lars Michael Kristensen,et al.  Comms/CPN: A Communication Infrastructure for External Communication with Design/CPN , 2001 .

[20]  Gerd Behrmann,et al.  A Performance Study of Distributed Timed Automata Reachability Analysis , 2002, PDMC@CONCUR.