An algorithm for the general Petri net reachability problem

An algorithm is presented for the general Petri net reachability problem based on a generalization of the basic reachability construction which is symmetric with respect to the initial and final marking. Sets of transition sequences described by finite automata are used for approximations to firing sequences, and the approximation error is assessed by uniformly constructable Presburger expressions. The approximation algorithm is iterated until a sufficient criterion for reachability can be given, not-withstanding the remaining uncertainty.

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

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

[3]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

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

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

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

[7]  Stefano Crespi-Reghizzi.  Petri Nets and Szilard Languages , 1977, Inf. Control..

[8]  Derek C. Oppen,et al.  A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[9]  James L. Peterson,et al.  A Comparison of Models of Parallel Computation , 1974, IFIP Congress.

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

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

[12]  G. Berthelot,et al.  Reduction of Petri-Nets , 1976, MFCS.

[13]  Raymond E. Miller,et al.  A Comparison of Some Theoretical Models of Parallel Computation , 1973, IEEE Transactions on Computers.

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

[15]  Larry L. Kinney,et al.  REDUCTION OF PETRI NETS. , 1976 .

[16]  Sheila A. Greibach.  Remarks on Blind and Partially Blind One-Way Multicounter Machines , 1978, Theor. Comput. Sci..

[17]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[18]  Richard L. Tenney,et al.  The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.

[19]  Jan van Leeuwen.  A partial solution to the reachability-problem for vector-addition systems , 1974, STOC '74.

[20]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

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