Reversible barbed congruence on configuration structures

Clement Aubert, Ioana Cristescu

Research output: Contribution to journalConference article

2 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)68-85
Number of pages18
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume189
DOIs
StatePublished - Aug 19 2015
Event8th Interaction and Concurrency Experience, ICE 2015 - Grenoble, France
Duration: Jun 4 2015Jun 5 2015

Fingerprint

Algebra
Semantics

ASJC Scopus subject areas

  • Software

Cite this

Reversible barbed congruence on configuration structures. / Aubert, Clement; Cristescu, Ioana.

In: Electronic Proceedings in Theoretical Computer Science, EPTCS, Vol. 189, 19.08.2015, p. 68-85.

Research output: Contribution to journalConference article

@article{4eeafa0edbb34b24a23d2bc63d4637e7,
title = "Reversible barbed congruence on configuration structures",
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.",
author = "Clement Aubert and Ioana Cristescu",
year = "2015",
month = "8",
day = "19",
doi = "10.4204/EPTCS.189.7",
language = "English (US)",
volume = "189",
pages = "68--85",
journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",
issn = "2075-2180",
publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Reversible barbed congruence on configuration structures

AU - Aubert, Clement

AU - Cristescu, Ioana

PY - 2015/8/19

Y1 - 2015/8/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84957684038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957684038&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.189.7

DO - 10.4204/EPTCS.189.7

M3 - Conference article

VL - 189

SP - 68

EP - 85

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

SN - 2075-2180

ER -