Skip to Main content Skip to Navigation
Conference papers

Reversing Unbounded Petri Nets

Lukasz Mikulski 1 Ivan Lanese 2, 3 
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Ivan Lanese Connect in order to contact the contributor
Submitted on : Friday, November 22, 2019 - 2:39:41 PM
Last modification on : Thursday, January 20, 2022 - 4:13:45 PM


Files produced by the author(s)




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⟩



Record views


Files downloads