Accelerating the Computation of Dead and Concurrent Places using Reductions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Accelerating the Computation of Dead and Concurrent Places using Reductions

Résumé

We propose a new method for accelerating the computation of a concurrency relation, that is all pairs of places in a Petri net that can be marked together. Our approach relies on a state space abstraction, that involves a mix between structural reductions and linear algebra, and a new data-structure that is specifically designed for our task. Our algorithms are implemented in a tool, called Kong, that we test on a large collection of models used during the 2020 edition of the Model Checking Contest. Our experiments show that the approach works well, even when a moderate amount of reductions applies.
Fichier principal
Vignette du fichier
paper.pdf (615.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03268388 , version 1 (23-06-2021)

Identifiants

Citer

Nicolas Amat, Silvano Dal Zilio, Didier Le Botlan. Accelerating the Computation of Dead and Concurrent Places using Reductions. 27th International SPIN Symposium on Model Checking of Software, Jul 2021, Aarhus, Denmark. ⟨10.1007/978-3-030-84629-9_3⟩. ⟨hal-03268388⟩
66 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More