Goal-Driven Unfolding of Petri Nets

Thomas Chatain 1, 2 Loïc Paulevé 3
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
3 BioInfo - LRI - Bioinformatique (LRI)
LRI - Laboratoire de Recherche en Informatique
Abstract : Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm for computing a finite prefix of the unfolding of a 1-safe Petri net that preserves all minimal configurations reaching this goal. Our algorithm combines the unfolding technique with on-the-fly model reduction by static analysis aiming at avoiding the exploration of branches which are not needed for reaching the goal. We present some experimental results.
Type de document :
Communication dans un congrès
28th International Conference on Concurrency Theory (CONCUR 2017), Sep 2017, Berlin, Germany. 〈https://www.concur2017.tu-berlin.de/〉. 〈10.4230/LIPIcs.CONCUR.2017.14〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01392203
Contributeur : Loïc Paulevé <>
Soumis le : mardi 4 juillet 2017 - 16:08:50
Dernière modification le : vendredi 27 avril 2018 - 14:36:02
Document(s) archivé(s) le : mardi 23 janvier 2018 - 18:42:24

Fichier

godunf.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Thomas Chatain, Loïc Paulevé. Goal-Driven Unfolding of Petri Nets. 28th International Conference on Concurrency Theory (CONCUR 2017), Sep 2017, Berlin, Germany. 〈https://www.concur2017.tu-berlin.de/〉. 〈10.4230/LIPIcs.CONCUR.2017.14〉. 〈hal-01392203v2〉

Partager

Métriques

Consultations de la notice

248

Téléchargements de fichiers

95