David de Frutos Escrig ; Maciej Koutny ; Łukasz Mikulski - Investigating Reversibility of Steps in Petri Nets

fi:8621 - Fundamenta Informaticae, December 23, 2021, Volume 183, Issues 1-2: Petri Nets 2019
Investigating Reversibility of Steps in Petri Nets

Authors: David de Frutos Escrig ; Maciej Koutny ; Łukasz Mikulski

    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.


    Volume: Volume 183, Issues 1-2: Petri Nets 2019
    Published on: December 23, 2021
    Accepted on: October 28, 2021
    Submitted on: October 28, 2021
    Keywords: Computer Science - Formal Languages and Automata Theory,Computer Science - Software Engineering,68N30 (Primary) 68Q85 (Secondary),D.2.2

    Share

    Consultation statistics

    This page has been seen 100 times.
    This article's PDF has been downloaded 48 times.