Approaching the Coverability Problem Continuously - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Approaching the Coverability Problem Continuously

Résumé

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstrate the effectiveness of our approach on standard benchmarks from the literature, which shows that our approach decides significantly more instances than any existing tool and is in addition often much faster, in particular on large instances.
Fichier principal
Vignette du fichier
arxiv15-BFHH.pdf (293.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01408044 , version 1 (14-03-2017)

Identifiants

Citer

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad. Approaching the Coverability Problem Continuously. 22nd International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS 2016), Apr 2016, Eindhoven, Netherlands. pp.480-496, ⟨10.1007/978-3-662-49674-9_28⟩. ⟨hal-01408044⟩
247 Consultations
112 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More