Investigating reversibility of steps in Petri nets



Downloads per month over past year

Frutos Escrig, David de and Koutny, Maciej and Mikulski, Łukasz (2021) Investigating reversibility of steps in Petri nets. Fundamenta informaticae, 183 (1-2). pp. 67-96. ISSN 0169-2968

[thumbnail of defrutos_investigating_by.pdf]
Creative Commons Attribution.


Official URL:


In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the problem of reversing the effect of the execution of groups of actions (steps). Using Petri nets as a system model, we introduce concepts related to this new scenario, generalising notions used in the single action case. We then present properties arising when reverse actions are allowed in place/transition nets (PT-nets). We obtain both positive and negative results, showing that allowing steps makes reversibility more problematic than in the interleaving/sequential case. In particular, we demonstrate that there is a crucial difference between reversing steps which are sets and those which are true multisets. Moreover, in contrast to sequential semantics, splitting reverses does not lead to a general method for reversing bounded PT-nets. We then show that a suitable solution can be obtained by combining split reverses with weighted read arcs.

Item Type:Article
Uncontrolled Keywords:Petri net, Reversible computation, Step semantics, Action splitting, Net synthesis, Direct reversibility, Mixed reversibility, Weighted activator arcs
Subjects:Sciences > Computer science > Networks
Sciences > Mathematics > Topology
ID Code:73980
Deposited On:22 Jul 2022 07:16
Last Modified:03 Aug 2022 10:05

Origin of downloads

Repository Staff Only: item control page