Reversible Barbed Congruence on Configuration Structures

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

1 SPADES - Sound Programming of Adaptive Dependable Embedded Systems
2 LACL - Laboratoire d'Algorithmique Complexité et Logique
3 PPS - Preuves, Programmes et Systèmes

A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish the denotation of terms equated by barbed congruence. Hereditary history preserving bisimulation (HHPB) is such a relation. We define a strong back and forth barbed congruence using a reversible process algebra and show that the relation induced by the back and forth congruence is equivalent to HHPB, providing a contextual characterization of HHPB.

Mots clés: Formal semantics; Process algebras and calculi; Reversible CCS; Hereditary history preserving bisimulation; Strong barbed congruence; Contextual caracterisation

Domaines: Logique en informatique [cs.LO]; Logique [math.LO]; Complexité [cs.CC]

Clément Aubert, Ioana Cristescu. Reversible Barbed Congruence on Configuration Structures. 8th Interaction and Concurrency Experience (ICE 2015) Satellite workshop of DisCoTec 2015, Jun 2015, Grenoble, France. ⟨hal-01157974v1⟩