Backward coverability with pruning for lossy channel systems - Archive ouverte HAL
Communication Dans Un Congrès Année : 2017

Backward coverability with pruning for lossy channel systems

Résumé

Driven by the concurrency revolution, the study of the coverability problem for Petri nets has regained a lot of interest in the recent years. A promising approach, which was presented in two papers last year, leverages a downward-closed forward invariant to accelerate the classical backward coverability analysis for Petri nets. In this paper, we propose a generalization of this approach to the class of well-structured transition systems (WSTSs), which contains Petri nets. We then apply this generalized approach to lossy channel systems (LCSs), a well-known subclass of WSTSs. We propose three downward-closed forward invariants for LCSs. One of them counts the number of messages in each channel, and the other two keep track of the order of messages. An experimental evaluation demonstrates the benefits of our approach.
Fichier principal
Vignette du fichier
LerouxGeffroySutre-SPIN-2017.pdf (794.47 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02391841 , version 1 (04-03-2021)

Identifiants

Citer

Thomas Geffroy, Jérôme Leroux, Grégoire Sutre. Backward coverability with pruning for lossy channel systems. SPIN 2017 - 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Jul 2017, Santa Barbara, United States. pp.132-141, ⟨10.1145/3092282.3092292⟩. ⟨hal-02391841⟩

Collections

CNRS
57 Consultations
111 Téléchargements

Altmetric

Partager

More