The minimal coverability graph for Petri nets

Abstract

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.

A short and partial version of this paper was presented at the 11^th Conference on Petri Nets under the following title: A minimal coverability graph for Petri nets. This paper was completed and corrected during the years 1990 and 1991.