Skip Navigation



The Computer Journal Advance Access published online on March 15, 2008
The Computer Journal, doi:10.1093/comjnl/bxn006
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cao, Y.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

A Hierarchy of Behavioral Equivalences in the {pi}-calculus with Noisy Channels

Yongzhi Cao*

Institute of Software, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, PR China
Key Laboratory of High Confidence Software Technologies, Peking University, Ministry of Education, PR China

* Corresponding author: caoyz{at}pku.edu.cn

Received 26 June 2007; revised 20 December 2007

The {pi}-calculus is a process algebra where agents interact by sending communication links to each other via noiseless communication channels. Taking into account the reality of noisy channels, an extension of the {pi}-calculus, called the {pi}N-calculus, has been introduced recently. This paper presents an early transitional semantics of the {pi}N-calculus, which is not a directly translated version of the late semantics of {pi}N, and then extends six kinds of behavioral equivalences consisting of reduction bisimilarity, barbed bisimilarity, barbed equivalence, barbed congruence, bisimilarity and full bisimilarity into the {pi}N-calculus. Such behavioral equivalences are cast in a hierarchy, which is helpful to verify behavioral equivalence of two agents. In particular, this paper shows that due to the noisy nature of channels, the coincidence of bisimilarity and barbed equivalence, as well as the coincidence of full bisimilarity and barbed congruence, in the {pi}-calculus does not hold in {pi}N.

Key Words: {pi}-calculus • {pi}-calculus with noisy channels • barbed equivalence • barbed congruence • bisimilarity


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.