论文信息 - A concurrency characteristic in Petri net unfolding

A concurrency characteristic in Petri net unfolding

Unfolding, originally introduced by McMillan (1995), is gaining ground as a partial-order based method for the verification of concurrent systems without state-space explosion. However, it can be exposed to redundancy, which may increase its size exponentially. So far, there have been trials to reduce such redundancy resulting from conflicts by improving McMillan's cut-off criterion. In this paper, we show that concurrency is also another cause of redundancy in unfolding, and we present an algorithm to reduce such redundancy in live, bounded and reversible Petri nets, which is independent of any cut-off algorithm.

Dongik Lee | Chang-Hee Hwang

[1] A. Valmari,et al. Stubborn Sets for Reduced State Space Generation, Proc. 11th Internat. Conf. on Application and Theory of Petri Nets , 1990 .

[2] Glynn Winskel,et al. Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[3] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

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

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

[6] Antti Valmari,et al. Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

[7] Michael Kishinevsky,et al. A Structural Approach for the Analysis of Petri Nets by Reduced Unfoldings , 1996, Application and Theory of Petri Nets.

[8] Patrice Godefroid,et al. Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[9] Patrice Godefroid,et al. On the costs and benefits of using partial-order methods for the verification of concurrent systems , 1996, Partial Order Methods in Verification.

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