Foundations of Reversible Computation

Aman, Bogdan; Ciobanu, Gabriel; Glück, Robert; Kaarsgaard, Robin; Kari, Jarkko; Kutrib, Martin; Lanese, Ivan; Mezzina, Claudio Antares; Mikulski, Łukasz; Nagarajan, Rajagopal; Phillips, Iain; Pinna, G.; Prigioniero, Luca; Ulidowski, Irek; Vidal, Germán

doi:10.1007/978-3-030-47361-7_1

Cited by 17 publications

(10 citation statements)

References 168 publications

(199 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the seminal work by Winskel [27] that shows a tight connection (via a chain of correflections) between (the category of) safe nets and (prime) event structures, a lot of effort has been made to associate different guises of Petri nets with the corresponding class of event structures (e.g., [4], [12], [6], [26] to name a few). Recently, event structures have been extended to account for reversible concurrent systems, namely a class of systems that have lately received lot of attention because of their applications in different fields [1], [16], including programming abstractions for reliable systems [8], [13], [10], program analysis and debugging [11], modelling bio-chemical simulations [9] and quantum computing [19].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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%

“…This approach however falls short when addressing the full expressivity of rPESes, which accommodates different flavours of reversibility [1], [16]. The reversing mechanism of an rPES is defined in terms of two relations (additional to the classical causality and conflicts): prevention and reverse causality.…”

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

“…A number of theoretical aspects of reversible computing have been studied over the years, see [6] for a survey summarizing recent results concerning categorical foundations of reversibility, foundations of programming languages and term rewriting, various models of sequential and concurrent computations, and addressing some of the challenges posed by quantum computation (which is in part also naturally reversible).…”

Section: 2 Paradigms Of Reversibilitymentioning

confidence: 99%

“…As an automaton is reversible if it preserves information so that its computation can be retraced back in time [6], information preserving and reversibility are very closely related concepts. Landauer argued in [17] that any logical operation with information loss necessarily results in heat dissipated by the system performing the operation, and as there exist irreversible computations, he also claimed that there are computations where heat generation is inevitable.…”

Section: 2 Paradigms Of Reversibilitymentioning

confidence: 99%

Simulating reversible computation with reaction systems

Bagossy

Vaszil

2020

J Membr Comput

View full text Add to dashboard Cite

Reaction systems are a formal model of computation providing a framework for investigating biochemical reactions inside living cells. We look at the functioning of these systems as a process producing a series of different possible sets of entities representing states which can be changed by the application of reactions, and we study reversibility and its simulation in this framework. Our goal is to establish an Undo-Redo-Do-like semantics of reversibility with environmental control over the direction of the computation following a so-called no-memory approach, that is, without introducing modifications to the model of reaction systems itself. We first establish requirements the systems must satisfy in order to produce processes consisting of states with unique predecessors, then define reversible reaction systems in terms of reversible interactive processes. For such reversible systems, we also construct simulator systems that can traverse between the states of reversible interactive processes back and forth based on the input of a special “rollback” symbol from the environment.

show abstract

“…Many efforts were made in the last decades to endow computation models with reversible semantics [1,16] and, in particular, two different models have been proposed for CCS: RCCS [4,9] and CCSK [19]. Both of them incorporate a logging mechanism in the operational semantics of CCS that enables the undoing of computation steps.…”

Section: Introductionmentioning

confidence: 99%

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

Foundations of Reversible Computation

Cited by 17 publications

References 168 publications

A distributed operational view of Reversible Prime Event Structures

A distributed operational view of Reversible Prime Event Structures

Simulating reversible computation with reaction systems

Towards a Truly Concurrent Semantics for Reversible CCS

Contact Info

Product

Resources

About