2016/08/11 by Alexis Bernadet, Ivan Lanese
Computer Science · #cs.LO #cs.PL
paper · pdf · doi:10.4204/eptcs.223.7
published as EPTCS 223, 2016, pp. 98-112 · In Proceedings ICE 2016, arXiv:1608.03131
arxiv created 2016/08/11 · arxiv updated 2016/08/12
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework can be used to define reversible extensions of formalisms as different as CCS and concurrent X-machines. The generality of the approach allows for the reuse of theories and techniques in different settings.