Simulation of Petri Net Processes

Abstract System simulation using Petri nets generates and visualizes possible runs of a Petri net model. Simulation is used for model validation, i.e., by means of simulation the correctness of the model with respect to the modeled system can be validated. If the model can be assumed to be valid then simulation provides information about the modeled system because every run of the model corresponds to a run of the system and vice versa. The aim of this paper is twofold: First, we argue that Petri net processes, i.e. partially ordered runs of Petri nets, have significant advantages compared to sequential simulation runs. These advantages concern in particular expressiveness and efficiency of the simulation. Second, we show how relevant processes can be generated in an efficient way.

[1]  Eike Best,et al.  Nonsequential Processes , 1988, EATCS Monographs on Theoretical Computer Science.

[2]  Wolfgang Reisig,et al.  Petri Net Models of Distributed Algorithms , 1995, Computer Science Today.

[3]  Javier Esparza Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[4]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[5]  Jörg Desel,et al.  A test case generator for the validation of high-level Petri nets , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.

[6]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[7]  Hartmann J. Genrich,et al.  The Calculus of Facts , 1976, MFCS.

[8]  Kurt Jensen,et al.  Coloured Petri Nets , 1997, Monographs in Theoretical Computer Science An EATCS Series.