Minimal Coverability Tree Construction Made Complete and Efficient - Archive ouverte HAL Access content directly
Conference Papers Year :

Minimal Coverability Tree Construction Made Complete and Efficient

(1) , (2, 1) , (2, 1)
1
2

Abstract

Downward closures of Petri net reachability sets can be finitely represented by their set of maximal elements called the minimal cover-ability set or Clover. Many properties (coverability, boundedness, ...) can be decided using Clover, in a time proportional to the size of Clover. So it is crucial to design algorithms that compute it efficiently. We present a simple modification of the original but incomplete Minimal Coverability Tree algorithm (MCT), computing Clover, which makes it complete: it memorizes accelerations and fires them as ordinary transitions. Contrary to the other alternative algorithms for which no bound on the size of the required additional memory is known, we establish that the additional space of our algorithm is at most doubly exponential. Furthermore we have implemented a prototype MinCov which is already very competitive: on benchmarks it uses less space than all the other tools and its execution time is close to the one of the fastest tool.
Fichier principal
Vignette du fichier
main.pdf (415.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02479879 , version 1 (14-02-2020)

Identifiers

  • HAL Id : hal-02479879 , version 1

Cite

Alain Finkel, Serge Haddad, Igor Khmelnitsky. Minimal Coverability Tree Construction Made Complete and Efficient. FoSSaCS 2020 - 23rd International Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin, Ireland. ⟨hal-02479879⟩
204 View
319 Download

Share

Gmail Facebook Twitter LinkedIn More