Checkpoint/Rollback vs Causally-Consistent Reversibility

Vassor, Martin; Stefani, Jean-Bernard

doi:10.1007/978-3-319-99498-7_20

Cited by 16 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A rollback is defined as the minimal causal-consistent sequence of backward steps able to undo a given action. The paper [69] explores the relationship between the Manetho [17] distributed checkpoint/rollback scheme (based on causal logging) and a reversible concurrent model of computation based on the π-calculus with imperative rollback called roll-π [38]. A rather tight relationship between rollback based on causal logging as performed in Manetho and the rollback algorithm underlying roll-π is shown.…”

Section: Recoverymentioning

confidence: 99%

Software and Reversible Systems: A Survey of Recent Activities

Mezzina

Schlatte

Glück

et al. 2020

Reversible Computation: Extending Horizons of Computing

View full text Add to dashboard Cite

Software plays a central role in all aspects of reversible computing. We survey the breadth of topics and recent activities on reversible software and systems including behavioural types, recovery, debugging, concurrency, and object-oriented programming. These have the potential to provide linguistic abstractions and tools that will lead to safer and more reliable reversible computing applications. This work has been partially supported by COST Action IC1405 on Reversible Computation-Extending Horizons of Computing.

show abstract

Section: Recoverymentioning

confidence: 99%

Software and Reversible Systems: A Survey of Recent Activities

Mezzina

Schlatte

Glück

et al. 2020

Reversible Computation: Extending Horizons of Computing

View full text Add to dashboard Cite

show abstract

“…This suggested that low energy consumption could be achieved by resorting to reversible computing, in which there is no information loss [3]. Nowadays, reversible computing has several applications ranging from modelling biochemical reactions [41,40] and parallel discrete-event simulation [38,43] to robotics [31], control theory [44], fault tolerant systems [9,11,24,46], and program debugging [13,28].…”

Section: Introductionmentioning

confidence: 99%

Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach

Bernardo¹,

Mezzina²

2022

Preprint

View full text Add to dashboard Cite

Causal consistent reversibility blends causality and reversibility. For a concurrent system, it says that an action can be undone provided that this has no consequences, thereby making it possible to bring the system back to a past consistent state. Time reversibility is instead considered in the performance evaluation field, mostly for efficient analysis purposes. A continuous-time Markov chain is time reversible if its stochastic behavior remains the same when the direction of time is reversed. We study how to bridge these two theories of reversibility by showing the conditions under which both causal consistent reversibility and time reversibility can be ensured by construction. This is done in the setting of a stochastic process calculus, which is then equipped with a notion of stochastic bisimilarity accounting for both forward and backward directions.

show abstract

“…This notion of reversibility is natural in reliable distributed systems since when an error occurs the system tries to go back to a past consistent state. Examples of application of causal-consistent reversibility to model reliable systems include transactions [10,14] and rollback protocols [28]. Also, there are applications in program analysis and debugging [12,17].…”

Section: Introductionmentioning

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

Checkpoint/Rollback vs Causally-Consistent Reversibility

Cited by 16 publications

References 19 publications

Software and Reversible Systems: A Survey of Recent Activities

Software and Reversible Systems: A Survey of Recent Activities

Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach

Reversible Occurrence Nets and Causal Reversible Prime Event Structures

Contact Info

Product

Resources

About