ePrints

Reversing Transitions in Bounded 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, 2018.

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

Abstract

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.

Publication metadata

Author(s): Barylska K, Erofeev E, Koutny M, Mikulski L, Piatkowski M

Publication type: Article

Publication status: Published

Journal: Fundamenta Informaticae

Year: 2018

Volume: 157

Issue: 4

Pages: 341-357

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

URL: https://doi.org/10.3233/FI-2018-1631

DOI: 10.3233/FI-2018-1631

Altmetrics

Funding

Share