Transactions in RCCS

Theoretical Computer Science

Stefani

2016

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Reversibility in the higher-order π-calculus AbstractThe notion of reversible computation is attracting increasing interest because of its applications in diverse fields, in particular the study of programming abstractions for reliable systems. In this paper, we continue the study undertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π-calculus, called rhoπ. We prove that reversibility in our calculus is causally consistent and that the causal information used to support reversibility in rhoπ is consistent with the one used in the causal semantics of the π-calculus developed by Boreale and Sangiorgi. Finally, we show that one can faithfully encode rhoπ into a variant of higher-order π, substantially improving on the result we obtained in the conference version of this paper.

“…Following Danos and Krivine [13], one could consider also taking into account irreversible actions. We do not do so in this paper for the sake of simplicity.…”

Section: Remarkmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reversibility in the higher-order π-calculus

Lanese

Theoretical Computer Science

Stefani

2016

“…We are closer to [14], which uses modular memories similar to ours. Controlled reversibility has been studied first in [6], introducing irreversible actions, then in [1], where energy parameters drive the evolution of the process, and in [19], where a non-reversible controller drives a reversible process. For an exhaustive survey on causalconsistent reversibility we refer to [15].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Causal-Consistent Reversibility in a Tuple-Based Language

Giachino

Lanese

2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing

et al. 2015

Abstract-Causal-consistent reversibility is a natural way of undoing concurrent computations. We study causal-consistent reversibility in the context of µKLAIM, a formal coordination language based on distributed tuple spaces. We consider both uncontrolled reversibility, suitable to study the basic properties of the reversibility mechanism, and controlled reversibility based on a rollback operator, more suitable for programming applications. The causality structure of the language, and thus the definition of its reversible semantics, differs from all the reversible languages in the literature because of its generative communication paradigm. In particular, the reversible behavior of µKLAIM read primitive, reading a tuple without consuming it, cannot be matched using channel-based communication. We illustrate the reversible extensions of µKLAIM on a simple, but realistic, application scenario.

“…Indeed distributed reversible actions can be seen as defeasible partial agreements: the building blocks for different transactional models and recovery techniques. Good examples on how reversibility in CCS and Higher-Order π can be used to model transactional models are respectively [3] and [7].…”

Section: Introductionmentioning

confidence: 99%

Static VS Dynamic Reversibility in CCS

Medić

2016

Reversible Computation

Abstract. The notion of reversible computing is attracting interest because of its applications in diverse fields, in particular the study of programming abstractions for fault tolerant systems. Reversible CCS (RCCS), proposed by Danos and Krivine, enacts reversibility by means of memory stacks. Ulidowski and Phillips proposed a general method to reverse a process calculus given in a particular SOS format, by exploiting the idea of making all the operators of a calculus static. CCSK is then derived from CCS with this method. In this paper we show that RCCS is at least as expressive as CCSK.