Towards a Truly Concurrent Semantics for Reversible CCS

Abstract

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.

The Reversible Temporal Process Language

“…Timed Petri nets are a valid tool for analysing real-time systems. A step towards the analysis of real-time systems would be to encode revTPL into (reversible) timed Petri nets [32], by extending the encoding of reversible CCS into reversible Petri nets [23]. Another possibility would be to study the extension of a monitored timed semantics for multiparty session types, as the one of [26], with reversibility [25].…”

revTPL: The Reversible Temporal Process Language

“…Timed Petri nets are a relevant tool for analysing realtime systems. A step towards the analysis of real-time systems would be to encode revTPL into timed Petri nets [ZFH01] extended with reversibility, by building on the encoding of reversible CCS into reversible Petri nets [MMP21b]. Also, we could think of encoding revTPL in timed automata [ACD93] extended with reversibility.…”