Reversing Unbounded Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Reversing Unbounded Petri Nets


In Petri nets, computation is performed by executing transitions. An effect-reverse of a given transition b is a transition that, when executed, undoes the effect of b. A transition b is reversible if it is possible to add enough effect-reverses of b so to always being able to undo its effect, without changing the set of reachable markings. This paper studies the transition reversibility problem: in a given Petri net, is a given transition b reversible? We show that, contrarily to what happens for the subclass of bounded Petri nets, the transition reversibility problem is in general undecidable. We show, however, that the same problem is decidable in relevant subclasses beyond bounded Petri nets, notably including all Petri nets which are cyclic, that is where the initial marking is reachable from any reachable marking. We finally show that some non-reversible Petri nets can be restructured, in particular by adding new places, so to make them reversible, while preserving their behaviour.
Fichier principal
Vignette du fichier
main.pdf (356.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02376158 , version 1 (22-11-2019)



Lukasz Mikulski, Ivan Lanese. Reversing Unbounded Petri Nets. PETRI NETS 2019 - Applications and Theory of Petri Nets, Jun 2019, Aachen, Germany. ⟨10.1007/978-3-030-21571-2_13⟩. ⟨hal-02376158⟩
65 View
191 Download



Gmail Facebook Twitter LinkedIn More