Acta Informatica

, Volume 41, Issue 9, pp 525–593

π-calculus with noisy channels

Article

DOI: 10.1007/s00236-005-0168-0

Cite this article as:
Ying, M. Acta Informatica (2005) 41: 525. doi:10.1007/s00236-005-0168-0

Abstract

It is assumed in the π-calculus that communication channels are always noiseless. But it is usually not the case in the mobile systems that developers are faced with in the real life. In this paper, we introduce an extension of π, called πN, in which noisy channels may be present. A probabilistic transitional semantics of πN is given. The notions of approximate (strong) bisimilarity and equivalence between agents in πN are proposed, and various algebraic laws for them are established. In particular, we introduce the notion of stratified bisimulation which is suited to describe behavior equivalence between infinite probabilistic processes. Some useful techniques for reasoning about approximate bisimilarity and equivalence are developed. We also introduce a notion of reliability in order to compare different behaviors of an agent in π and πN. It is shown that reliability is preserved by the basic combinators in π. A link between reliability and bisimulation is given. This provides us with a uniform framework in which we can reason about both correctness properties and reliability of mobile systems. Also, a potential way of combing value-passing process algebras and Shannon’s information theory is pointed out.

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and TechnologyTsinghua UniversityBeijingChina