论文信息 - Parallel computation of reachable dead states in a free-choice Petri net

Parallel computation of reachable dead states in a free-choice Petri net

Free-choice Petri nets are a prominent tool for modeling and analyzing communication protocols, multiprocessor systems, parallel programs, flexible manufacturing systems and workflow scripts. Unfortunately, analysis is often hampered by the state-explosion phenomenon. Even for free-choice Petri nets, the reachability problem is known to be EXPSPACE-hard. In this paper we discuss a technique for the parallel computation of the reachable dead states. This technique is based on the partitioning of tokens instead of the Petri net.

W.M.P. van der Aalst | Wil M.P. van der Aalst

[1] Jörg Desel,et al. A Proof of the Rank Theorem for Extended Free Choice Nets , 1992, Application and Theory of Petri Nets.

[2] Wil M. P. van der Aalst. Using Interval Timed Coloured Petri Nets to Calculate Performance Bounds , 1994, Computer Performance Evaluation.

[3] G. Conte,et al. Parallel State Space Exploration for GSPN Models , 1995, Application and Theory of Petri Nets.

[4] Theodore Gyle Lewis. Foundations of parallel programming - a machine-independent approach , 1994 .

[5] C. Petri. Kommunikation mit Automaten , 1962 .

[6] Jens Palsberg,et al. Complexity Results for 1-Safe Nets , 1993, Theor. Comput. Sci..

[7] Javier Esparza. Synthesis Rules for Petri Nets, and How they Lead to New Results , 1990, CONCUR.

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

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

[10] Eike Best,et al. Structure Theory of Petri Nets: the Free Choice Hiatus , 1986, Advances in Petri Nets.

[11] Gianni Conte,et al. Experiences on SIMD Massively Parallel GSPN Analysis , 1994, Computer Performance Evaluation.

[12] M. J. Quinn,et al. Parallel Computing: Theory and Practice , 1994 .

[13] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .