HAL: hal-00554919, version 1

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

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

Pierre-Alain Reynier (  Corresponding author ) 1, Frédéric Servais (  Corresponding author ) 2

(2011-01-10)

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.

1:	Laboratoire d'informatique Fondamentale de Marseille (LIF)
	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I
2:	Computer Science Department, Université Libre de Bruxelles, Belgium
	Université Libre de Bruxelles

Subject

:

Computer Science/Logic in Computer Science

Keyword(s): Petri nets – Coverability

hal-00554919, version 1

http://hal.archives-ouvertes.fr/hal-00554919

oai:hal.archives-ouvertes.fr:hal-00554919

From: Pierre-Alain Reynier <>

Submitted on: Tuesday, 11 January 2011 16:59:52

Updated on: Wednesday, 12 January 2011 10:03:39