论文信息 - A primitive recursive algorithm for the general Petri net reachability problem

A primitive recursive algorithm for the general Petri net reachability problem

E. Mayr and R. Kosaraju (1981) proved the decidability of the general Petri net reachability problem. However their algorithms are non primitive recursive. Since then the primitive recursiveness of this problem was stated as an open problem. In this paper we give a double exponential space algorithm for the general Petri net reachability problem.

Zakaria Bouziane | Zakaria Bouziane

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

[2] Gérard P. Huet,et al. An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations , 1978, Inf. Process. Lett..

[3] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

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

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

[6] A. Meyer,et al. The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[7] Richard J. Lipton,et al. Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) , 1976, STOC '76.

[8] Michel Hack,et al. The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems , 1974, SWAT.