Lanese, Ivan and Mezzina, Claudio Antares and Stefani, Jean-Bernard Reversibility in the higher-order \(π\)-calculus. Theoretical Computer Science, 625. pp. 25-84. ISSN 0304-3975 (2016)
|
PDF
- Accepted Version
Available under License Creative Commons Attribution Non-commercial. Download (1MB) | Preview |
Abstract
The 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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Reversible computation; Process algebra; π-Calculus |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Claudio Antares Mezzina |
| Date Deposited: | 19 Apr 2016 07:48 |
| Last Modified: | 19 Apr 2016 09:06 |
| URI: | http://eprints.imtlucca.it/id/eprint/3346 |
Actions (login required)
 |
Edit Item |
