A Truly Concurrent Semantics for Reversible CCS
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910736550199296 |
|---|---|
| author | Melgratti, Hernán Mezzina, Claudio Antares Pinna, G. Michele |
| author_facet | Melgratti, Hernán Mezzina, Claudio Antares Pinna, G. Michele |
| contents | 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 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_14011 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A Truly Concurrent Semantics for Reversible CCS Melgratti, Hernán Mezzina, Claudio Antares Pinna, G. Michele Logic in Computer Science Information Theory 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 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. |
| title | A Truly Concurrent Semantics for Reversible CCS |
| topic | Logic in Computer Science Information Theory |
| url | https://arxiv.org/abs/2309.14011 |