How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation (Research Report)

Clément Aubert (1) , Ioana Cristescu (2)

1 Augusta University
2 Tarides [Paris]

Reversible computation opens up the possibility of overcoming some of the hardware's current physical limitations. It also offers theoretical insights, as it enriches multiple paradigms and models of computation, and sometimes retrospectively enlightens them. Concurrent reversible computation, for instance, offered interesting extensions to the Calculus of Communicating Systems, but was still lacking a natural and pertinent bisimulation to study processes equivalences. Our paper formulates an equivalence exploiting the two aspects of reversibility: backward moves and memory mechanisms. This bisimulation captures classical equivalences relations for denotational models of concurrency (History-and hereditary history-preserving bisimulation, (H)HPB), that were up to now only partially characterized by process algebras. This result gives an insight on the expressiveness of reversibility, as both backward moves and a memory mechanism-providing 'backward determinism'-are needed to capture HHPB.

Mots clés: Configuration structures; 2012 ACM Subject Classification Theory of computation → Program semantics; Reversible CCS; Bisimulation; Computing meth- odologies → Concurrent programming languages Keywords and phrases Formal semantics; Process algebras and calculi; Distributed and reversible computation

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]; Calcul parallèle, distribué et partagé [cs.DC]; Théorie et langage formel [cs.FL]

Clément Aubert, Ioana Cristescu. How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation (Research Report). 2020. ⟨hal-02568250⟩