Reversing Steps in Petri Nets

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 acti...

Full description

Bibliographic Details
Authors: Frutos Escrig, David De, Koutny, Maciej, Mikulski, Łukasz
Format: article
Publication Date:2019
Country:España
Institution:Universidad Complutense de Madrid (UCM)
Repository:Docta Complutense
Language:English
OAI Identifier:oai:docta.ucm.es:20.500.14352/12425
Online Access:https://hdl.handle.net/20.500.14352/12425
Access Level:Open access
Keyword:519.7
Petri net
Reversible computation
Step semantics
Inteligencia artificial (Informática)
Cibernética matemática
Topología
1203.04 Inteligencia Artificial
1207.03 Cibernética
1210 Topología
Description
Summary: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 a number of properties which arise in the context of reversing of steps of executed transitions in place/transition nets. We obtain both positive and negative results, showing that dealing with steps makes reversibility more involved than in the sequential case. In particular, we demonstrate that there is a crucial difference between reversing steps which are sets and those which are true multisets.