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.
Work partly supported by the French projects ECSPER (ANR-09-JCJC-0069) and DOTS (ANR-06-SETI-003), by the PAI program Moves funded by the Federal Belgian Government, by the European project QUASIMODO (FP7-ICT-STREP-214755), and by the ESF project GASICS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Finkel, A.: A generalization of the procedure of Karp and Miller to well structured transition system. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 499–508. Springer, Heidelberg (1987)
Finkel, A.: The minimal coverability graph for Petri nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol. 674, pp. 210–243. Springer, Heidelberg (1993)
Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: Completions. In: Proc. STACS 2009. LIPIcs, vol. 3, pp. 433–444. Leibniz-Zentrum für Informatik (2009)
Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188–199. Springer, Heidelberg (2009)
Finkel, A., Raskin, J.-F., Samuelides, M., Begin, L.V.: Monotonic extensions of petri nets: Forward and backward search revisited. Electr. Notes Theor. Comput. Sci. 68(6) (2002)
Geeraerts, G.: Coverability and Expressiveness Properties of Well-structured Transitions Systems. Thèse de doctorat, Université Libre de Bruxelles, Belgique (2007)
Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the coverability set for petri nets. International Journal of Foundations of Computer Science 21(2), 135–165 (2010)
Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences 3(2), 147–195 (1969)
Luttge, K.: Zustandsgraphen von Petri-Netzen. Master’s thesis, Humboldt-Universitat (1995)
Reynier, P.-A., Servais, F.: Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. Research Report 00554919, HAL (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reynier, PA., Servais, F. (2011). Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-21834-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21833-0
Online ISBN: 978-3-642-21834-7
eBook Packages: Computer ScienceComputer Science (R0)