Explicit Identifiers and Contexts in Reversible Concurrent Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Explicit Identifiers and Contexts in Reversible Concurrent Calculus


Existing formalisms for the algebraic specification and representation of networks of reversible agents suffer some shortcomings. Despite multiple attempts, reversible declensions of the Calculus of Communicating Systems (CCS) do not offer satisfactory adaptation of notions usual in "forward-only" process algebras, such as replication or context. Existing formalisms disallow the "hot-plugging" of processes during their execution in contexts with their own past. They also assume the existence of "eternally fresh" keys or identifiers that, if implemented poorly, could result in unnecessary bottlenecks and look-ups involving all the threads. In this paper, we begin investigating those issues, by first designing a process algebra endowed with a mechanism to generate identifiers without the need to consult with the other threads. We use this calculus to recast the possible representations of non-determinism in CCS, and as a byproduct establish a simple and straightforward definition of concurrency. Our reversible calculus is then proven to satisfy expected properties. We also observe that none of the reversible bisimulations defined thus far are congruences under our notion of "reversible" contexts.
Fichier principal
Vignette du fichier
main.pdf (523.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03300726 , version 1 (27-07-2021)



Clément Aubert, Doriana Medić. Explicit Identifiers and Contexts in Reversible Concurrent Calculus. RC 2021 - 13th International Conference on Reversible Computation, Jul 2021, Nagoya / Virtual, Japan. ⟨10.1007/978-3-030-79837-6_9⟩. ⟨hal-03300726⟩
34 View
59 Download



Gmail Facebook Twitter LinkedIn More