ePrints

Investigating Reversibility of Steps in Petri Nets

Lookup NU author(s): Professor Maciej KoutnyORCiD, Dr Lukasz Mikulski

Downloads

• Accepted version [.pdf]

Licence

This is the authors' accepted manuscript of an article that has been published in its final definitive form by IOS Press, 2022.

For re-use rights please refer to the publisher's terms and conditions.

Abstract

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.

Publication metadata

Author(s): de Frutos Escrig M, Koutny M, Mikulski L

Publication type: Article

Publication status: Published

Journal: Fundamenta Informaticae

Year: 2022

Volume: 183

Issue: 1

Pages: 67-96

Online publication date: 10/01/2022

Acceptance date: 11/08/2020

Date deposited: 24/11/2020

ISSN (electronic): 0169-2968

Publisher: IOS Press

URL: https://doi.org/10.3233/FI-2021-2082

DOI: 10.3233/FI-2021-2082

Altmetrics

Share