Reversible Occurrence Nets and Causal Reversible Prime Event Structures

Melgratti, Hernán; Mezzina, Claudio Antares; Phillips, Iain; Pinna, G.; Ulidowski, Irek

doi:10.1007/978-3-030-52482-1_2

Cited by 12 publications

(16 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a matter of fact, we still lack a procedure to associate a Petri net to a given rPES. Previous attempts [15] do this job just for the subclass of cause-respecting rPESes, i.e., rPESes that allow the reversing of an event once all events it caused have been reversed. For instance, the transition system associated with a cause-respecting reversible version of the event structure P in Figure 1b is depicted in Figure 2a.…”

Section: Introductionmentioning

confidence: 99%

A distributed operational view of Reversible Prime Event Structures

Melgratti

Mezzina

Pinna

2021

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Self Cite

View full text Add to dashboard Cite

Reversible prime event structures extend the wellknown model of prime event structures to represent reversible computational processes. Essentially, they give abstract descriptions of processes capable of undoing computation steps. Since their introduction, event structures have played a pivotal role in connecting operational models (traditionally, Petri nets and process calculi) with denotational ones (algebraic domains). For this reason, there has been a lot of interest in linking different classes of operational models with different kinds of event structures. Hence, it is natural to ask which is the operational counterpart of reversible prime event structures. Such question has been previously addressed for a subclass of reversible prime event structures in which the interplay between causality and reversibility is restricted to the so-called causerespecting reversible structures. In this paper, we present an operational characterisation of the full-fledged model and show that reversible prime event structures correspond to a subclass of contextual Petri nets, called reversible causal nets. The distinctive feature of reversible causal nets is that causality is recovered from inhibitor arcs instead of the usual overlap between post and presets of transitions. In this way, we are able to operationally explain also out-of-causal order reversibility.

show abstract

Section: Introductionmentioning

confidence: 99%

A distributed operational view of Reversible Prime Event Structures

Melgratti

Mezzina

Pinna

2021

2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…1. we encode (finite) CCS processes into a generalization of occurrence nets, namely unravel nets, in the vein of Boudol and Castellani [3]; 2. we show that unravel nets can be made causally-consistent reversible by applying the approach in [13]; 3. we finally shows that the reversible unravel nets derived by our encoding are an interpratation of RCCS terms.…”

Section: Introductionmentioning

confidence: 92%

“…Along the lines of [13], we can prove that the set of reachable markings of a reversible unravel net is not influenced by performing a reversing transition. Let N = S, T, U, F, m be an rUN.…”

Section: Petri Nets Unravel Nets and Reversible Unravel Netsmentioning

confidence: 99%

“…Reversible unravel nets. The definition of reversible unravel net follows the one of reversible occurrence net [13] and generalize reversible occurrence nets as unravel nets generalize occurrence nets. The transitions in U are the reversing ones; hence, we often say that a reversible unravel net N is reversible with respect to U .…”

Section: Petri Nets Unravel Nets and Reversible Unravel Netsmentioning

confidence: 99%

“…However, we still lack a Petri net model for RCCS processes. We may exploit some recent results that connect reversible occurrence nets with reversible event structures [15,13,14] to indirectly recover a Petri net model from the reversible bundle event structures defined in [7]. However, we follow a different approach, which is somehow more direct:…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Towards a Truly Concurrent Semantics for Reversible CCS

Melgratti

Mezzina

Pinna

2021

Reversible Computation

Self Cite

View full text Add to dashboard Cite

Reversible CCS (RCCS) is a well-established, formal model for reversible communicating systems, which has been built on top of the classical Calculus of Communicating Systems (CCS). In its original formulation, each CCS process is equipped with a memory that records its performed actions, which is then used to reverse computations. More recently, abstract models for RCCS have been proposed in the literature, basically, by directly associating RCCS processes with (reversible versions of) event structures. In this paper we propose a detour: starting from one of the well-known encoding of CCS into Petri nets we apply a recently proposed approach to incorporate causally-consistent reversibility to Petri nets, obtaining as result the (reversible) net counterpart of every RCCS term.

show abstract

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

Reversible Occurrence Nets and Causal Reversible Prime Event Structures

Cited by 12 publications

References 27 publications

A distributed operational view of Reversible Prime Event Structures

A distributed operational view of Reversible Prime Event Structures

Towards a Truly Concurrent Semantics for Reversible CCS

An Axiomatic Approach to Reversible Computation

Contact Info

Product

Resources

About