Acta Informatica

, Volume 41, Issue 9, pp 525–593 | Cite as

π-calculus with noisy channels

  • Mingsheng YingEmail author


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.


Operating System Data Structure Communication Network Information Theory Computational Mathematic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148, 1–70 (1999). An extended version appeared as Digital Equipment Corporation Systems Research Center Report No. 149 (1998)Google Scholar
  2. 2.
    Abdulla, P., Annichini, A., Bouajjani, A.: Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In: Tools and Algorithms for the Construction and Analysis of Systems, Proceedings, LNCS 1579, pp. 208–222. Springer (1999)Google Scholar
  3. 3.
    Abdulla, P.A., Boasson, L., Bouajjani, A.: Effective lossy queue languages. In: Automata, Languages and Programming, Proceedings, LNCS 2076, pp. 639–651. Springer (2001)Google Scholar
  4. 4.
    Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: Computer-Aided Verification, Proceedings, LNCS 1427, pp. 305–318. Springer (1998)Google Scholar
  5. 5.
    Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design 25, 39–65 (2004)CrossRefGoogle Scholar
  6. 6.
    Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channel. Information and Computation 127, 91–101 (1996)CrossRefGoogle Scholar
  7. 7.
    Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Information and Computation 130, 71–90 (1996)CrossRefGoogle Scholar
  8. 8.
    Abdulla, P.A., Rabinovich, A.: Verification of probabilistic systems with faulty communication. In: Foundations of Software Science and Computation Structures, Proceedings, LNCS 2620, pp. 39–53. Springer (2003)Google Scholar
  9. 9.
    Ash, R.B.: Information Theory. Dover, New York (1990)Google Scholar
  10. 10.
    Baeten, J., Bergstra, J., Smolka, S.: Axiomatizing probabilistic processes: ACP with generative probability. Information and Computation 122, 234–255 (1995) (Preliminary version appeared in: CONCUR’92, Third International Conference on Concurrency Theory, Stony Brook, NY, USA, August 24–27, 1992, Proceedings, LNCS 630, pp. 472–485). Springer (1992)Google Scholar
  11. 11.
    Baier, C., Engelen, B.: Establishing qualitative properties for probabilistic lossy channel systems. In: Katoen, J.-P. (ed.), Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS’99, Bamberg, Germany, May 1999. Proceedings, LNCS 1601, pp. 34–53. Springer (1999)Google Scholar
  12. 12.
    Berger, M.: Basic theory of reduction congruence for two timed asynchronous π-calculi. In: Gardner, P., Yoshida, N. (eds.), CONCUR 2004 - Concurrency Theory: 15th International Conference, London, UK, August 31 – September 3, 2004. Proceedings, LNCS 3170, pp. 115–130. Springer (2004)Google Scholar
  13. 13.
    Berger, M.: Towards Abstractions for Distributed Systems. Ph.D. Thesis, Imperial College, London (2002)Google Scholar
  14. 14.
    Berger, M., Honda, K.: The two-phase commit protocol in an extended π-calculus. In: Proc. EXPRESS’00, 7th International Workshop on Expressiveness in Concurrency. Penn State University, USA (2000)Google Scholar
  15. 15.
    Bergstra, J.A. Klop, J.-W.: Algebra of communicating processes with abstraction. Theoretical Computer Science 33, 77–121 (1985)CrossRefGoogle Scholar
  16. 16.
    Boreale, M., Sangiorgi, D.: Some congruence properties for π-calculus bisimilarities. Theoretical Computer Science 198, 159–176 (1998)CrossRefGoogle Scholar
  17. 17.
    Boudol, G.: Asynchrony and the π-calculus. Rapport de Recherche 1702, INRIA, Sophia-Antipolis (1992)Google Scholar
  18. 18.
    Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae 11, 433–452 (1988)Google Scholar
  19. 19.
    van Breugel, F., Worrell, J.: Towards quantitative verification of probabilistic transition systems. In: Proceedings of the 23th International Colloquium on Automata, Languages and Programming, LNCS 2076, pp. 421–432. Springer, Berlin (2001)Google Scholar
  20. 20.
    Brinksma, E., Hermanns, H., Katoen, J.-P. (eds.): Lectures on Formal Methods and Performance Analysis. LNCS 2090, Springer, Berlin (2001)Google Scholar
  21. 21.
    Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31, 560–599 (1984)CrossRefGoogle Scholar
  22. 22.
    Chang, C.C., Keisler, H.J.: Model Theory (3rd edition), Studies in Logic and the Foundations of Mathematics 73. North-Holland, Amsterdam (1990)Google Scholar
  23. 23.
    Cleaveland, R., Dayar, Z., Smolka, S.A., Yuen, S.: Testing preorders for probabilistic processes. Information and Computation 154, 93–148 (1999)CrossRefGoogle Scholar
  24. 24.
    Cleaveland, R., Smolka, S.A., Zwarico, A.E.: Testing preorders for probabilistic processes. In: Kuich, W. (ed.), Automata, Languages and Programming (ICALP’92), Viena, Proceedings, LNCS 623, pp. 708–719. Springer (1992)Google Scholar
  25. 25.
    Desharnais, D., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov systems. In: Proceedings of the 10th International Conference on Concurrency Theory, LNCS 1664, pp. 258–273. Springer (1999)Google Scholar
  26. 26.
    Engberg, U., Nielsen, M.: A calculus of communicating systems with label passing. Report DAIMI PB-208, Computer Science Department, University of Aarhus (1986)Google Scholar
  27. 27.
    Feng, Y., Zhang, S.Y.: Approximate bisimilarity in probabilistic process algebras. unpublished note (2002)Google Scholar
  28. 28.
    Francez, N.: Program Verification. Addison-Wesley, Wokingham (1992)Google Scholar
  29. 29.
    van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Information and Computation 121, 59–80 (1995)CrossRefGoogle Scholar
  30. 30.
    van Glabbeek, R.J., Smolka, S.A., Steffen, B., Tofts, C.M.N.: Reactive, generative, and stratified models of probabilistic processes. In: Proc. 5th Annual IEEE Symposium on Logic in Computer Science, pp. 130–141. Philadelphia (1990)Google Scholar
  31. 31.
    Hansson, H.A., Jonsson, B.: A calculus for communicating systems with time and probability. In: Proceedings of the 11th IEEE Symposium on Real-Time Systems, Lake Buena Vista, Florida, USA, pp. 278–287. IEEE Computer Societ Press (1990)Google Scholar
  32. 32.
    Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous pi-calculus. In: Tiuryn, J. (ed.), Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures. Held as Part of the Joint European Conferences on Theory and Practice of Software, LNCS 1784, pp. 146–160. Springer (2000)Google Scholar
  33. 33.
    Herescu, The Probabilistic Asynchronous PI-Calculus. Ph.D. Thesis, The Pennsylvania State University (2002)Google Scholar
  34. 34.
    Hoare, C.A.R.: Communicating sequential processes. Communications of the ACM 21, 666–677 (1978)CrossRefGoogle Scholar
  35. 35.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, New York (1985)Google Scholar
  36. 36.
    Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.), Proceedings of the European Conference on Object-Oriented Programming, LNCS 512, pp. 133–147. Springer-Verlag Heidelberg (1991)Google Scholar
  37. 37.
    Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 151, 437–486 (1995)CrossRefGoogle Scholar
  38. 38.
    Iyer, P., Narasimha, M.: Probabilistic lossy channel systems. In: Bidoit, M., Dauchet, M. (eds.), TAPSOFT’97, Theory and Practice of Software Development, Proceedings, LNCS 1214, pp. 667–681. Springer (1997)Google Scholar
  39. 39.
    Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94, 371–384 (1991)CrossRefGoogle Scholar
  40. 40.
    Lu, R.Q., Wei, Z.C.: Truly Probabilistic Pi-Calculus and Risk Semantics. Technical Report, Mathematical Institute, Academia Sinica (2004)Google Scholar
  41. 41.
    Milner, R.: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92. Springer-Verlag, Berlin (1980)Google Scholar
  42. 42.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs, NJ (1989)Google Scholar
  43. 43.
    Milner, R.: The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh (1991)Google Scholar
  44. 44.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I and II. Technical Report ECS-LFCS-89-85 and 86, University of Edinburgh, 1989; also see Information and Computation 100, 1–77 (1992)Google Scholar
  45. 45.
    Milner, R., Sangiorgi, D.: Barbed bisimulation. In: ICALP’92, Automata, Languages and Programming, LNCS 623, pp. 685–695. Springer (1992)Google Scholar
  46. 46.
    Núñez, M.: Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming 56, 117–177 (2003)CrossRefGoogle Scholar
  47. 47.
    Petri, C.A.: Kommunikation mit Automaten. Schriften des Rheinisch-Westfaelischen, Institutes fuer instrumentelle Mathematik an der Universitaet, Nr. 2, Bonn (1962)Google Scholar
  48. 48.
    Priami, C.: Stochastic π-calculus. The Computer Journal 38, 578–589 (1995)CrossRefGoogle Scholar
  49. 49.
    Sangiorgi, D.: Bisimulation for higher-order process calculi. Information and Computation 131, 141–178 (1996)CrossRefGoogle Scholar
  50. 50.
    Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar
  51. 51.
    Schnoebelen, P.: The verification of probabilistic lossy channel systems. In: Christel Baier et al. (eds.), Validation of Stochastic Systems: A Guide to Current Research BibEditorNames, LNCS 2925, pp. 445–465. Springer (2004)Google Scholar
  52. 52.
    Seidel, K.: Probabilistic communicating processes. Theoretical Computer Science 152, 219–249 (1995)CrossRefGoogle Scholar
  53. 53.
    Shannon, C.E.: A mathematical theory of communication, I, II. Bell System Technical Journal 27, 379–423; 623–656 (1948)Google Scholar
  54. 54.
    Thomsen, B.: Calculi for Higher Order Communicating Systems. Ph.D. Thesis, Dept. of Computing, Imperial College (1990)Google Scholar
  55. 55.
    Thomsen, B.: Plain CHOCS, a second generation calculus for higher-order process. Acta Informatica 30, 1–59 (1993)CrossRefGoogle Scholar
  56. 56.
    Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London (1991)Google Scholar
  57. 57.
    Ying, M.S.: Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs. Springer-Verlag, New York (2001)Google Scholar
  58. 58.
    Ying, M.S.: Bisimulation indexes and their applications. Theoretical Computer Science 275, 1–68 (2002)CrossRefGoogle Scholar
  59. 59.
    Ying, M.S.: Additive models of probabilistic processes. Theoretical Computer Science 275, 481–519 (2002)CrossRefGoogle Scholar
  60. 60.
    Ying, M.S.: Reasoning about probabilistic sequential programs in a probabilistic logic. Acta Informatica 39, 315–389 (2003)CrossRefGoogle Scholar
  61. 61.
    Ying, M.S., Wirsing, M.: Approximate bisimilarity. In: Rus, T. (ed.), Algebraic Methodology and Software Technology, 8th International Conference, AMAST 2000, Iowa City, USA. Proceedings, Lecture Notes in Computer Science 1816, pp. 309–321. Springer-Verlag, Berlin (2000)Google Scholar
  62. 62.
    Ying, M.S., Wirsing, M.: Recursive equations in higher-order process calculi. Theoretical Computer Science 266, 839–852 (2001)CrossRefGoogle Scholar

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

Personalised recommendations