论文信息 - A Structure to Decide Reachability in Petri Nets

A Structure to Decide Reachability in Petri Nets

Abstract A new structure to analyse Petri nets and decide reachability is presented. Originated in Mary's regular constraint graphs with a consistent marking, it is simplified, cleared and made more flexible by the introduction of the new structure of precovering graph . With its help we prove new results for languages generated by a Petri net and initial and final markings constraints.

Jean-Luc Lambert | J. Lambert

[1] Elisabeth Pelz,et al. A logical formalism for the study of the infinite behaviour of Petri nets , 1985, Applications and Theory in Petri Nets.

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

[3] Richard M. Karp,et al. Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[4] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[5] Zohar Manna,et al. Proving termination with multiset orderings , 1979, CACM.

[6] Horst Müller,et al. The reachability problem for VAS , 1984, European Workshop on Applications and Theory in Petri Nets.

[7] James Lyle Peterson,et al. Petri net theory and the modeling of systems , 1981 .

[8] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

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

[10] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[11] J. L. Lambert,et al. Finding a partial solution to a linear system of equations in positive integers , 1988 .

[12] Matthias Jantzen,et al. On the hierarchy of Petri net languages , 1979, RAIRO Theor. Informatics Appl..