Dissemin is shutting down on January 1st, 2025

Published in

Open Publishing Association, Electronic Proceedings in Theoretical Computer Science, (189), p. 68-85

DOI: 10.4204/eptcs.189.7

Links

Tools

Export citation

Search in Google Scholar

Reversible Barbed Congruence on Configuration Structures

Journal article published in 2015 by Clément Aubert ORCID, Ioana Cristescu
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Question mark in circle
Preprint: policy unknown
Upload
Question mark in circle
Postprint: policy unknown
Upload
Question mark in circle
Published version: policy unknown
Upload
Policy details
Data provided by SHERPA/RoMEO

Abstract

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.