论文信息 - Normal Petri Nets

Normal Petri Nets

Abstract A class of Petri nets, called normal Petri nets, is introduced, and it is shown that, for each initial marking, the reachability set of a normal marked Petri net is an effectively computable semilinear set. More generally, we show that the reachability set of a marked Petri net is an effectively computable semilinear set unless the total number of tokens in a minimal circuit is decreased to 0. We also show that a Petri net is normal if and only if it is weakly persistent for each initial marking without token-free circuits.

Hideki Yamasaki

[1] Amir Pnueli,et al. Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[2] Michel Hack,et al. The Equality Problem for Vector Addition Systems is Undecidable , 1976, Theor. Comput. Sci..

[3] Tadao Kasami,et al. Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets , 1977, Theor. Comput. Sci..

[4] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .

[5] Horst Müller. Decidability of Reachability in Persistent Vector Replacement Systems , 1980, MFCS.

[6] Edward L. Robertson,et al. Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[7] Jan Grabowski,et al. The Decidability of Persistence for Vector Addition Systems , 1980, Information Processing Letters.

[8] Hideki Yamasaki. On Weak Persistency of Petri Nets , 1981, Inf. Process. Lett..

[9] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..