Sogbohossou, Médésu and Vianou, Antoine - Unfolding through processes to compute the complete prefix of Petri nets

arima:3177 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, July 24, 2017, Volume 27 - 2017 - Special issue CARI 2016
Unfolding through processes to compute the complete prefix of Petri nets

Authors: Sogbohossou, Médésu and Vianou, Antoine

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.


Source : oai:HAL:hal-01482853v1
Volume: Volume 27 - 2017 - Special issue CARI 2016
Published on: July 24, 2017
Submitted on: March 8, 2017
Keywords: bounded Petri nets, complete prefix of unfolding, adequate order, alternative processes,réseaux de Petri bornés, préfixe complet de dépliage, ordre adéquat, processus alternatifs,[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation,[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]


Share

Consultation statistics

This page has been seen 158 times.
This article's PDF has been downloaded 66 times.