A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes

Reachability graph (RG) generation suffers from the problem of exponential space and time complexity. To alleviate the more critical problem of time complexity, this paper presents the new approach for RG generation for the Petri net (PN) models of parallel processes. Independent RGs for each parallel process in the PN structure are generated in parallel and cross-product of these RGs turns into the exhaustive state space from which the RG of given parallel system is determined. The complexity analysis of the presented algorithm illuminates significant decrease in the time complexity cost of RG generation. The proposed technique is applicable to parallel programs having multiple threads with the synchronization problem. Keywords—Parallel processes, Petri net, reachability graph, time complexity.

[1]  Grzegorz Łabiak,et al.  Symbolic State Exploration of UML Statecharts for Hardware Description , 2005 .

[2]  Karsten Wolf,et al.  Stubborn Sets for Model Checking the EF/AG Fragment of CTL , 2000, Fundam. Informaticae.

[3]  Jiantao Zhou,et al.  On reachability graphs of Petri nets , 2003, Comput. Electr. Eng..

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

[5]  Peter Radford,et al.  Petri Net Theory and the Modeling of Systems , 1982 .

[6]  Lorenzo Capra.  Colored Petri nets state-space reduction via symbolic execution , 2005, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05).

[7]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[8]  Edmund M. Clarke,et al.  State space reduction using partial order techniques , 1999, International Journal on Software Tools for Technology Transfer.

[9]  Tommi A. Junttila.  New Canonical Representative Marking Algorithms for Place/Transition-Nets , 2004, ICATPN.

[10]  Karsten Wolf.  How to calculate symmetries of Petri nets , 2000, Acta Informatica.

[11]  Maciej Koutny,et al.  Optimal simulations, nets and reachability graphs , 1990, Applications and Theory of Petri Nets.

[12]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[13]  Hejiao Huang.  Enhancing the property-preserving petri net process algebra for component-based system design (with application to designing multi-agent systems and manufacturing systems) , 2004 .

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

[15]  Milan Ceska,et al.  Partial-Order Reduction in Model Checking Object-Oriented Petri Nets , 2003, EUROCAST.

[16]  Marta Z. Kwiatkowska,et al.  Compositional State Space Reduction Using Untangled Actions , 2006, EXPRESS.

[17]  Monika Heiner.  Petri Net Based System Analysis without State Explosion , 1998 .

[18]  Patrice Godefroid,et al.  Dynamic partial-order reduction for model checking software , 2005, POPL '05.

[19]  Andrei Karatkevich,et al.  Dynamic analysis of Petri net-based discrete systems , 2007 .

[20]  Hejiao Huang,et al.  Structure and behavior preservation by Petri-net-based refinements in system design , 2004, Theor. Comput. Sci..

[21]  Lars Michael Kristensen,et al.  Question-guided stubborn set methods for state properties , 2006, Formal Methods Syst. Des..

[22]  Piotr Miczulski,et al.  Calculating State Spaces of Hierarchical Petri Nets Using BDD , 2005 .