Semantic Theory and Proof System of Open Bisimulation for the π-Calculus with Mismatching

Conference paper
Part of the Semantic Structures in Computation book series (SECO, volume 1)


The challenging problem of what is the most reasonable way to define open bisimulation for the π-calculus with mismatching is still open. In this paper, we give a full solution to this problem. First a reasonable definition of open bisimulation is presented and its equivalence and congruence are established. Then a symbolic version of open bisimulation is introduced and its soundness and completeness with respect to open bisimulation are proved. Finally, a symbolic proof system for open bisimulation is put forth and its soundness and completeness are also proved. In addition, the weak case is also discussed, and five t-laws are given to lift the symbolic proof system for strong open bisimulation to a complete inference system for open observation congruence in the π-calculus with mismatching.


Process algebra π-calculus Open bisimulation Symbolic open bisimulation Proof system 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M.Boreale and R.De Nicola. A symbolic semantics for the π-calculus. In CONCUR’94, Lecture Notes in Computer Science, vol. 836. Springer-Verlag, 1994.Google Scholar
  2. 2.
    M.Dam. On the decidability of process equivalence for the π-calculus. Theoretical Computer Science, 183: 214-228, 1997.CrossRefGoogle Scholar
  3. 3.
    M.Hennessy and H.Lin  Symbolic bisimulations. Theoretical Computer Science,138:353-389,1995.CrossRefGoogle Scholar
  4. 4.
    M.Hennessy and R.Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM,67:137-161,1985.CrossRefGoogle Scholar
  5. 5.
    Z.Li and H.Chen. Checking strong/weak bisimulation equivalences and observation congruence for the π-calculus. In ICALP’98, Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, 1998.Google Scholar
  6. 6.
    Z.Li and H.Chen. Computing strong/weak bisimulation equivalences and observation congruence for value-passing processes. In TACAS’99, Lecture Notes in Computer Science, vol. 1579, Springer-Verlag, 1999.Google Scholar
  7. 7.
    Z.Li, H.Chen, B.Wang. Symbolic transition graph and its early bisimulation checking algorithms for the π-calculus. Science In China (Series E), Vol. 42, No. 4: 342-353, 1999.CrossRefGoogle Scholar
  8. 8.
    Z.Li. Theories and algorithms for the verification of bisimulation equivalences in value-passing CCS and the π-calculus. Doctorate thesis, Department of Computer Science, Changsha Institute of Technology, 1999.Google Scholar
  9. 9.
    H.Lin. A verification tool for value-passing processes. In Proceedings of 13th International Symposium on Protocol Specification, Testing and Verification, IFIP Transactions. North-Holland, 1993.Google Scholar
  10. 10.
    H.Lin. Symbolic bisimulations and proof systems for the π-calculus. Report 7/94, Computer Science, University of Sussex, 1994.Google Scholar
  11. 11.
    H.Lin. Complete inference systems for weak bisimulation equivalences in the 7-calculus. In TAPSOFT’95. Spring-Verlag, 1995.Google Scholar
  12. 12.
    H.Lin. Unique fixpoint induction for mobile processes. In CONCUR’95. Lecture Notes in Computer Science, vol. 962, Spring-Verlag, 1995.Google Scholar
  13. 13.
    H.Lin. Symbolic transition graph with assignment.In CONCUR’96, Lecture Notes in Computer Science, vol. 1119. Springer-Verlag, 1996.Google Scholar
  14. 14.
    H.Lin. Complete proof systems for observation congruences in finite control pi-calculus. In ICALP’98, Lecture Notes in Computer Science, vol. 1443, Spring-Verlag, 1998.Google Scholar
  15. 15.
    X.Liu.Characterizing bisimulation congruence in the π-calculus. In CONCUR’94, LNCS 836, Springer Verlag,1995.Google Scholar
  16. 16.
    R.Milner. Communication and Concurrency. Prentice-Hall, 1989Google Scholar
  17. 17.
    R.Milner, J.Parrow and D.Walker. A calculus of mobile processes, Part I,II. Information and Computation, 100:1-77, 1992.CrossRefGoogle Scholar
  18. 18.
    U.Montanari and M.Pistore.Checking bisimilarity for finitary πcalculus.In CONCUR’95,LNCS 962.Springer Verlag,1995.Google Scholar
  19. 19.
    J.Parrow and D.Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 1120(2): 174-197, 1995.CrossRefGoogle Scholar
  20. 20.
    M.Pistore and D.Sangiorgi. A partition refinement algorithm for the π-calculus.In CAV’96,LNCS 1102.Spinger-Verlag,1996.Google Scholar
  21. 21.
    D.Sangiorgi.A theory of bisimulation for the it-calculus. In CONCUR’93,LNCS 715.Springer-Verlag,1993.Google Scholar
  22. 22.
    B.Victor and F.Moller.The mobility workbench-a tool for the π-calculus. In CAV’94, LNCS 818. Springer-Verlag, 1994.Google Scholar
  23. 23.
    B.Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. Ph.D thesis, Department of Computer Systems, Uppsala University, Sweden, June 1998.Google Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  1. 1.Department of Computer ScienceNational University of Defense TechnologyChangsha, HunanChina

Personalised recommendations