Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
Pierre-Alain Reynier, Frédéric Servais · Fundamenta Informaticae · 2013
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 ensu