Towards a truly concurrent semantics for reversible CCS

Hernán Melgratti (1, 2) , Claudio Antares Mezzina (3) , G Michele Pinna (4)

1 UBA - Universidad de Buenos Aires [Buenos Aires]
2 CONICET - Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires]
3 Università degli Studi di Urbino 'Carlo Bo'
4 UniCa - Università degli Studi di Cagliari = University of Cagliari

Reversible CCS (RCCS) is a well-established, formal model for reversible communicating systems, which has been built on top of the classical Calculus of Communicating Systems (CCS). In its original formulation, each CCS process is equipped with a memory that records its performed actions, which is then used to reverse computations. More recently, abstract models for RCCS have been proposed in the literature, basically, by directly associating RCCS processes with (reversible versions of) event structures. In this paper we propose a detour: starting from one of the well-known encoding of CCS into Petri nets we apply a recently proposed approach to incorporate causally-consistent reversibility to Petri nets, obtaining as result the (reversible) net counterpart of every RCCS term.

Mots clés: Petri Nets; Reversible CCS; Concurrency

Domaines: Informatique [cs]; Calcul parallèle, distribué et partagé [cs.DC]

Hernán Melgratti, Claudio Antares Mezzina, G Michele Pinna. Towards a truly concurrent semantics for reversible CCS. 13th Conference on Reversible Computation, Jul 2021, Kyoto, Japan. ⟨hal-03242858⟩