Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning

Authors:
Pierre-Alain Reynier;Frédéric Servais
Affiliations:
Aix-Marseille Université, CNRS, LIF, UMR 7279, Marseille, France. pierre-alain.reynier@lif.univ-mrs.fr;Hasselt University and Transnational University of Limburg, Belgium. frederic.servais@uhasselt.be
Venue:
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Year:
2013

Citing 5
Cited 0

A generalization of the procedure of Karp and Miller to well structured transition systems

14th International Colloquium on Automata, languages and programming
Model-Checking with Coverability Graphs

Formal Methods in System Design
The Minimal Coverability Graph for Petri Nets

Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Forward Analysis for WSTS, Part II: Complete WSTS

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Parallel program schemata

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the Monotone-Pruning algorithm MP for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm K&M unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the K&M algorithm by adding pruning between branches of the K&M tree. This idea was first introduced in the Minimal Coverability Tree algorithm MCT, however it was recently shown to be incomplete. The MP algorithm can be viewed as the MCT algorithm with a slightly more aggressive pruning strategy which ensures completeness. Experimental results show that this algorithm is a strong improvement over the K&M algorithm as it dramatically reduces the exploration tree.