Reversible Computation vs. Reversibility in Petri Nets

Barylska, Kamila; Koutny, Maciej; Mikulski, Łukasz; Piatkowski, Marcin

doi:10.1007/978-3-319-40578-0_7

Cited by 15 publications

(24 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper proposes a reversible approach to Petri nets that allows the modelling of reversibility as realised by backtracking, causal reversing and out-of-causal-order reversing. To the best of our knowledge, this is the first such proposal, since the only related previous work of [2,3], having a different aim, implemented a very liberal way of reversing computation in Petri nets by introducing additional reversed transitions. Indeed, our proposal allows systems to reverse at any time leading to previously visited states or even to new ones without the need of additional forward actions.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Reversible Computation in Petri Nets

Philippou

Psara

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reversible computation is an unconventional form of computing where any executed sequence of operations can be executed in reverse at any point during computation. It has recently been attracting increasing attention in various research communities as on the one hand it promises low-power computation and on the other hand it is inherent or of interest in a variety of applications. In this paper, we propose a reversible approach to Petri nets by introducing machinery and associated operational semantics to tackle the challenges of the three main forms of reversibility, namely, backtracking, causal reversing and out-of-causal-order reversing. Our proposal concerns a variation of Petri nets where tokens are persistent and are distinguished from each other by an identity which allows for transitions to be reversed spontaneously in or out of causal order. Our design decisions are influenced by applications in biochemistry but the methodology can be applied to a wide range of problems that feature reversibility. In particular, to demonstrate the applicability of our approach we use an example of a biochemical system and an example of a transaction-processing system both of which naturally embed reversible behaviour.

show abstract

Section: Discussionmentioning

confidence: 99%

“…More recently the first study of reversible computation within Petri nets was proposed in [2,3]. In these works, the authors investigate the effects of adding reversed versions of selected transitions in a Petri net, where these transitions are obtained by reversing the directions of a transition's arcs.…”

Section: Introductionmentioning

confidence: 99%

Reversible Computation in Petri Nets

Philippou

Psara

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We remark that our proposal deals with reversing (undoing) computation in a Petri net and not with the classical problem of reversibility [3] which requires every computation to be able to reach back the initial state of the system (but not necessary by undoing the previous events). In this sense, the problem of making a net reversible equates to adding a minimal amount of transitions that make a net reversible [2]. Reversibility is a global property while reversing a computation is a local one, as discussed in [2].…”

Section: Introductionmentioning

confidence: 99%

“…In this sense, the problem of making a net reversible equates to adding a minimal amount of transitions that make a net reversible [2]. Reversibility is a global property while reversing a computation is a local one, as discussed in [2].…”

Section: Introductionmentioning

confidence: 99%

Reversing P/T Nets

Melgratti

Mezzina

Ulidowski

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Petri Nets are a well-known model of concurrency and provide an ideal setting for the study of fundamental aspects in concurrent systems. Despite their simplicity, they still lack a satisfactory causally reversible semantics. We develop such semantics for Place/Transitions Petri Nets (P/T nets) based on two observations. Firstly, a net that explicitly expresses causality and conflict among events, e.g., an occurrence net, can be straightforwardly reversed by adding reversal for each of its transitions. Secondly, the standard unfolding construction associates a P/T net with an occurrence net that preserves all of its computation. Consequently, the reversible semantics of a P/T net can be obtained as the reversible semantics of its unfolding. We show that such reversible behaviour can be expressed as a finite net whose tokens are coloured by causal histories. Colours in our encoding resemble the causal memories that are typical in reversible process calculi.

show abstract

“…A key construction we investigate here amounts to adding 'reverse' versions of selected net transitions, e.g., a 'straightforward' reverse simply changes the directions of arcs adjacent to a transition being reversed. As shown in [3], 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.…”

Section: Introductionmentioning

confidence: 99%

Reversing Transitions in Bounded Petri Nets

Barylska

Erofeev

Koutny

et al. 2018

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Reversible Computation vs. Reversibility in Petri Nets

Abstract: This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 Unported License Newcastle University ePrints -eprint.ncl.ac.uk

Cited by 15 publications

References 22 publications

Reversible Computation in Petri Nets

Reversible Computation in Petri Nets

Reversing P/T Nets

Reversing Transitions in Bounded Petri Nets

Contact Info

Product

Resources

About