The Minimal Coverability Graph for Petri Nets

We present the unique minimal coverability graph for Petri nets. When the reachability graph of a Petri net is infinite, the minimal coverability graph allows us to decide the same problems as the well-known Karp-Miller graph: the Finite Reachability Tree Problem, the Finite Reachability Set Problem, the Boundedness Problem, the Quasi-Liveness Problem and the Regularity Problem. The algorithm given for computing the minimal coverability graph is based on a new optimization of the Karp and Miller procedure.

[1]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

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

[3]  Rüdiger Valk,et al.  The residue of vector sets with applications to decidability problems in Petri nets , 1985, Acta Informatica.

[4]  Rodney R. Howell,et al.  Recent results on the complexity of problems related to Petri nets , 1986, European Workshop on Applications and Theory of Petri Nets.

[5]  Mohamed G. Gouda,et al.  On Deciding Progress for a Class of Communication Protocols , 1983 .

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

[7]  Alain Finkel,et al.  A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems , 1987, ICALP.

[8]  Raymond E. Miller,et al.  Homomorphisms between Models of Parallel Computation , 1982, J. Comput. Syst. Sci..

[9]  Kurt Jensen,et al.  Coloured Petri Nets: Modelling and Validation of Concurrent Systems , 2009 .

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

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

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

[13]  Fritz Krückeberg,et al.  Mathematical methods for calculating invariants in Petri nets , 1986, European Workshop on Applications and Theory of Petri Nets.

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

[15]  Colette Johnen.  Analyse algorithmique des réseaux de Petri : vérification d'espace d'accueil, systèmes de réécriture , 1987 .

[16]  Gérard Berthelot,et al.  Transformations and Decompositions of Nets , 1986, Advances in Petri Nets.

[17]  Laure Petrucci.  Techniques d'analyse des reseaux de petri algebriques , 1991 .

[18]  Rüdiger Valk,et al.  Petri Nets and Regular Languages , 1981, J. Comput. Syst. Sci..

[19]  Kurt Lautenbach.  Linear Algebraic Techniques for Place/Transition Nets , 1986, Advances in Petri Nets.

[20]  Kenneth McAloon,et al.  Petri Nets and Large Finite Sets , 1984, Theor. Comput. Sci..

[21]  D. Koenig.  Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[22]  Kurt Jensen.  Computer Tools for Construction, Modification and Analysis of Petri Nets , 1986, Advances in Petri Nets.

[23]  Mohamed G. Gouda,et al.  Proving liveness for networks of communicating finite state machines , 1986, TOPL.

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