Reversible CCS (RCCS) is a well-established, formal model for reversible com- municating 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, essentialy, by directly associating RCCS processes with (reversible versions of) event structures. In this paper we propose a different abstract model: 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.
A Truly Concurrent Semantics for Reversible CCS
G. MICHELE PINNA
2024-01-01
Abstract
Reversible CCS (RCCS) is a well-established, formal model for reversible com- municating 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, essentialy, by directly associating RCCS processes with (reversible versions of) event structures. In this paper we propose a different abstract model: 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.File | Dimensione | Formato | |
---|---|---|---|
2309.14011v4.pdf
accesso aperto
Tipologia:
versione editoriale (VoR)
Dimensione
617.53 kB
Formato
Adobe PDF
|
617.53 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.