The minimal coverability graph for Petri nets

  • Alain Finkel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 674)


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.

Key words

Petri nets decidability Karp-Miller graph minimal coverability graph effective computation of the minimal coverability graph verification of protocols 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Alain Finkel
    • 1
  1. 1.Laboratoire d'Informatique Fondamentale et Appliquée de CachanENS CachanCedex CachanFrance

Personalised recommendations