On the bisimulation congruence in χ-calculus

Chen, Taolue and Han, Tingting and Lu, J. (2005) On the bisimulation congruence in χ-calculus. In: Ramanujam, R. and Sen, S. (eds.) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science 3821. Springer, pp. 128-139. ISBN 9783540324195.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/11590156\_10

Abstract

In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under context only at the very beginning. As a result, we show that both in labelled and barbed congruence, the open and closed style definitions coincide. Thus all bisimulation congruences collapse into two equivalences, that is, the well-known open congruence and open barbed congruence, which are the same in the strong case, while in the weak case their difference can be reflected by one axiom. The results of this paper close some conjectures in the literatures and shed light on the algebraic theory of a large class of mobile process calculi.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	16 Feb 2021 19:07
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43068

Statistics

Archive Staff Only (login required)

Edit/View Item