Reversing Steps in Petri Nets

Frutos-Escrig, David de; Koutny, Maciej; Mikulski, Łukasz

doi:10.1007/978-3-030-21571-2_11

Cited by 6 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the format has its syntactic constraints while our approach abstracts from them. Finally, [9] presents a number of properties such as, for example, backward confluence, which arise in the context of reversing of steps of executed transitions in Place/Transition nets.…”

Section: Conclusion Related and Future Workmentioning

confidence: 99%

“…In order to prove properties of the reversible systems they build they use our theory (taken from the conference version of the present paper [33]), hence this can be taken as an additional case study for our results. Finally, [17] presents a number of properties such as, for example, backward confluence, which arise in the context of reversing of multiple transitions at the same time (called a step) in Place/Transition nets.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Axiomatic Approach to Reversible Computation

Lanese

Phillips

Ulidowski

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Undoing computations of a concurrent system is beneficial in many situations, e.g., in reversible debugging of multi-threaded programs and in recovery from errors due to optimistic execution in parallel discrete event simulation. A number of approaches have been proposed for how to reverse formal models of concurrent computation including process calculi such as CCS, languages like Erlang, prime event structures and occurrence nets. However it has not been settled what properties a reversible system should enjoy, nor how the various properties that have been suggested, such as the parabolic lemma and the causal-consistency property, are related. We contribute to a solution to these issues by using a generic labelled transition system equipped with a relation capturing whether transitions are independent to explore the implications between these properties. In particular, we show how they are derivable from a set of axioms. Our intention is that when establishing properties of some formalism it will be easier to verify the axioms rather than proving properties such as the parabolic lemma directly. We also introduce two new notions related to causal consistent reversibility, namely causal safety and causal liveness, and show that they are derivable from our axioms.

show abstract

Section: Conclusion Related and Future Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An Axiomatic Approach to Reversible Computation

Lanese

Phillips

Ulidowski

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Proposition 12 below formalises what are called mixed-reverse transitions in [11], namely a correspondence between the steps in a reversible occurrence net and the sequences of reachable configurations of the associated rpes. We now introduce some auxiliary notation.…”

Section: And # Is the Conflict Relation Defined On The Occurrence Net C E mentioning

confidence: 99%

Reversible Occurrence Nets and Causal Reversible Prime Event Structures

Melgratti

Mezzina

Phillips

et al. 2020

Reversible Computation

View full text Add to dashboard Cite

One of the well-known results in concurrency theory concerns the relationship between event structures and occurrence nets: an occurrence net can be associated with a prime event structure, and vice versa. More generally, the relationships between various forms of event structures and suitable forms of nets have been long established. Good examples are the close relationship between inhibitor event structures and inhibitor occurrence nets, or between asymmetric event structures and asymmetric occurrence nets. Several forms of event structures suited for the modelling of reversible computation have recently been developed; also a method for reversing occurrence nets has been proposed. This paper bridges the gap between reversible event structures and reversible nets. We introduce the notion of reversible occurrence net, which is a generalisation of the notion of reversible unfolding. We show that reversible occurrence nets correspond precisely to a subclass of reversible prime event structures, the causal reversible prime event structures.

show abstract

“…In such systems one can execute more than one action at the same time, including the situation when a single action is executed multiple times (auto-concurrence). Reversing atomic transitions in such systems is discussed in [49]. In simple cases, where auto-concurrence is excluded, one can reduce reversing under the concurrent semantics to the sequential case.…”

Section: Petri Netsmentioning

confidence: 99%

Foundations of Reversible Computation

Aman

Ciobanu

Glück

et al. 2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled "Reversible Computation-Extending Horizons of Computing", which took place in the years 2015-2019.

show abstract

Reversing Steps in Petri Nets

Cited by 6 publications

References 19 publications

An Axiomatic Approach to Reversible Computation

An Axiomatic Approach to Reversible Computation

Reversible Occurrence Nets and Causal Reversible Prime Event Structures

Foundations of Reversible Computation

Contact Info

Product

Resources

About