On the Reversibility of Well-Behaved Weighted Choice-Free Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

On the Reversibility of Well-Behaved Weighted Choice-Free Systems


A Petri net is reversible if its initial marking is a home marking, a marking reachable from any reachable marking. Under the assumption of well-behavedness we investigate the property of reversibility for strongly connected weighted Choice-Free Petri nets, nets which structurally avoid conflicts. Several characterizations of liveness and reversibility as well as exponential methods for building live and home markings are available for these nets. We provide a new characterization of reversibility leading to the construction in polynomial time of an initial marking with a polynomial number of tokens that is live and reversible. We also introduce a polynomial time transformation of well-formed Choice-Free systems into well-formed T-systems and we deduce from it a polynomial time sufficient condition of liveness and reversibility for well-formed Choice-Free systems. We show that neither one of these two approaches subsumes the other.
Fichier principal
Vignette du fichier
Petri Nets 2014.pdf (399.42 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01017044 , version 1 (13-05-2019)



Thomas Hujsa, Jean-Marc Delosme, Alix Munier-Kordon. On the Reversibility of Well-Behaved Weighted Choice-Free Systems. 35th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2014, Jun 2014, Tunis, Tunisia. pp.334-353, ⟨10.1007/978-3-319-07734-5_18⟩. ⟨hal-01017044⟩
131 View
89 Download



Gmail Facebook X LinkedIn More