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 …

… Two reversible variant of CCS: … Reversible CCS … Definition (Reachable Process) A CCSK
process X is reachable if it can be derived from an CCS process P, by using semantics rules. …