Skip to Main content Skip to Navigation
Journal articles

Un dépliage par processus pour calculer le préfixe complet des réseaux de Petri

Abstract : The partial-order technique of the unfolding implicitly represents state-space of a Petri net (PN), by in particular preserving the concurrency relations between the events. That makes it possible to contain state-space explosion problem in case of strong concurrency. A complete prefix of unfolding is used to cover all the state-space of a bounded PN: its computation according to the classical approach is based on the concept of adequate order, taking directly into account only safe PN. In this paper, a new approach independent of the concept of adequate order and faithful to the partial-order semantics, consists in creating the events of the unfolding in the context of a single process at the same time. The results of the tests are conclusive for safe and nonsafe PN. Some solutions are presented to improve compactness of the prefix obtained.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01482853
Contributor : Médésu SOGBOHOSSOU Connect in order to contact the contributor
Submitted on : Friday, March 3, 2017 - 9:48:25 PM
Last modification on : Wednesday, March 16, 2022 - 3:22:37 PM
Long-term archiving on: : Tuesday, June 6, 2017 - 12:55:35 PM

File

article-CARI16-ARIMA2017.pdf
Files produced by the author(s)

Identifiers

Citation

Médésu Sogbohossou, Antoine Vianou. Un dépliage par processus pour calculer le préfixe complet des réseaux de Petri. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2017, Volume 27 - 2017 - Special issue CARI 2016, ⟨10.46298/arima.3177⟩. ⟨hal-01482853v1⟩

Share

Metrics

Record views

83

Files downloads

689