Static versus Dynamic Reversibility in CCS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Acta Informatica Year : 2021

Static versus Dynamic Reversibility in CCS


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. Most computational models are not naturally reversible since computation causes loss of information, and history information must be stored to enable reversibility. In the literature, two approaches to reverse the CCS process calculus exist, differing on how history information is kept. Reversible CCS (RCCS), proposed by Danos and Krivine, exploits dedicated stacks of memories attached to each thread. CCS with Keys (CCSK), proposed by Phillips and Ulidowski, makes CCS operators static so that computation does not cause information loss. In this paper we show that RCCS and CCSK are equivalent in terms of LTS isomorphism.
Fichier principal
Vignette du fichier
sd_main.pdf (427.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03338675 , version 1 (09-09-2021)



Ivan Lanese, Doriana Medić, Claudio Antares Mezzina. Static versus Dynamic Reversibility in CCS. Acta Informatica, 2021, ⟨10.1007/s00236-019-00346-6⟩. ⟨hal-03338675⟩
45 View
71 Download



Gmail Facebook X LinkedIn More