Minimal coverability set for petri nets: Karp and Miller algorithm with pruning

Authors:
Pierre-Alain Reynier;Frédéric Servais
Affiliations:
LIF, Université Aix-Marseille & CNRS, France;Department of Computer & Decision Engineering, ULB, Belgium
Venue:
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Year:
2011

Citing 4
Cited 2

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

14th International Colloquium on Automata, languages and programming
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

Old and new algorithms for minimal coverability sets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Old and New Algorithms for Minimal Coverability Sets

Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012

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.