TY  - CHAP
N2  - 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.
UR  - http://dx.doi.org/10.1007/978-3-319-40578-0_3
TI  - Static VS Dynamic Reversibility in CCS
ID  - eprints3526
AV  - public
T2  - Reversible Computation : 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings
A1  - Medic, Doriana
A1  - Mezzina, Claudio Antares
SP  - 36
T3  - Lecture Notes in Computer Science
Y1  - 2016///
PB  - Springer
EP  - 51
SN  - 978-3-319-40577-3
ER  -