Lookup NU author(s): Professor Maciej Koutny,
Dr Lukasz Mikulski
This is the authors' accepted manuscript of an article that has been published in its final definitive form by IOS Press, 2018.
For re-use rights please refer to the publisher's terms and conditions.
Reversible computation deals with mechanisms for undoing the effects of actions executed by a dynamic system. This paper is concerned with reversibility in the context of Petri nets which are a general formal model of concurrent systems. A key construction we investigate amounts to adding `reverse' versions of selected net transitions. Such a static modification can severely impact on the behaviour of the system, e.g., the problem of establishing whether the modified net has the same states as the original one is undecidable. We therefore concentrate on nets with finite state spaces and show, in particular, that every transition in such nets can be reversed using a suitable finite set of new transitions.
Author(s): Barylska K, Erofeev E, Koutny M, Mikulski L, Piatkowski M
Publication type: Article
Publication status: Published
Journal: Fundamenta Informaticae
Online publication date: 31/01/2018
Acceptance date: 31/05/2017
Date deposited: 14/06/2017
ISSN (print): 0169-2968
ISSN (electronic): 1875-8681
Publisher: IOS Press
Altmetrics provided by Altmetric