Concurrencies in Reversible Concurrent Calculi - Archive ouverte HAL Access content directly
Book Sections Year : 2022

Concurrencies in Reversible Concurrent Calculi


The algebraic specification and representation of networks of agents have been greatly impacted by the study of reversible phenomena: reversible declensions of the calculus of communicating systems (CCSK and RCCS) offer new semantic models, finer congruence relations, original properties, and revisits existing theories and results in a finer light. But much remains to be done: concurrency, a central notion in establishing causal consistency–a crucial property for reversible systems–, was never given a syntactical definition in CCSK. We remedy this gap by leveraging a definition of concurrency developed for forward-only calculi using proved transition systems, and prove that CCSK still enjoys causal consistency for this elegant and syntactical notion of reversible concurrency. We also compare it to a definition of concurrency inspired by reversible $π $π-calculus, discuss its relation with structural congruence, and prove that it can be adapted to any CCS-inspired reversible system and is equivalent—or refines—existing definitions of concurrency for those systems.


Fichier principal
Vignette du fichier
article.pdf (542.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03776549 , version 1 (13-09-2022)



Clément Aubert. Concurrencies in Reversible Concurrent Calculi. Reversible Computation, Springer Verlag (Germany), pp.146-163, 2022, ⟨10.1007/978-3-031-09005-9_10⟩. ⟨hal-03776549⟩
19 View
6 Download



Gmail Facebook Twitter LinkedIn More