Efficient Algorithms for Three Reachability Problems in Safe Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Efficient Algorithms for Three Reachability Problems in Safe Petri Nets

Pierre Bouvier
Hubert Garavel

Abstract

We investigate three particular instances of the marking coverability problem in ordinary, safe Petri nets: the Dead Places Problem, the Dead Transitions Problem, and the Concurrent Places Problem. To address these three problems, which are of practical interest, although not yet supported by mainstream Petri net tools, we propose a combination of static and dynamic algorithms. We implemented these algorithms and applied them to a large collection of 13,000+ Petri nets obtained from realistic systems-including all the safe benchmarks of the Model Checking Contest. Experimental results show that 95% of the problems can be solved in a few minutes using the proposed approaches.
Fichier principal
Vignette du fichier
Bouvier-Garavel-21-a.pdf (363.57 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03286069 , version 1 (13-07-2021)

Identifiers

Cite

Pierre Bouvier, Hubert Garavel. Efficient Algorithms for Three Reachability Problems in Safe Petri Nets. PETRI NETS 2021 - 42nd International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2021, Paris, France. pp.339-359, ⟨10.1007/978-3-030-76983-3_17⟩. ⟨hal-03286069⟩
70 View
177 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More