Old and new algorithms for minimal coverability sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7347 LNCS, Issue , 2012, Pages 208-227

  Valmari, Antti ^a   Hansen, Henri ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COVERABILITY; DEPTH FIRST; FIRST ORDER; IMPLEMENTATION ASPECTS; SIMPLE ALGORITHM; SIMPLER ALGORITHMS;

ALGORITHMS;

PETRI NETS;

EID: 84862500459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31131-4_12     Document Type: Conference Paper

References (6)

1. Finkel, A.: The Minimal Coverability Graph for Petri Nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol. 674, pp. 210-243. Springer, Heidelberg (1993)
2. Finkel, A., Geeraerts, G., Raskin, J.-F., Van Begin, L.: A counter-example to the minimal coverability tree algorithm. Technical Report 535, Universite Libre de Bruxelles (2005)
3. Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the minimal coverability set of Petri nets. International Journal of Foundations of Computer Science 21(2), 135-165 (2010)
4. Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences 3(2), 147-195 (1969)
5. König, B., Koziura, V.: Incremental construction of coverability graphs. Information Processing Letters 103(5), 203-209 (2007)
6. Reynier, P.-A., Servais, F.: Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 69-88. Springer, Heidelberg (2011)