Modal characterization of weak bisimulation for higher-order processes

Extended abstract
  • Michael Baldamus
  • Jürgen Dingel
II CAAP CAAP-4: Bisimulations and Pi-calculus
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1214)


Context bisimulation [12, 1] has become an important notion of behavioural equivalence for higher-order processes. Weak forms of context bisimulation are particularly interesting, because of their high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second-order processes. We show how the logic permits compositional reasoning. In comparison to previous work by Amadio and Dam [2] on the strong case, our modal logic supports derived operators through a complete duality and thus constitutes an appealing extension of Hennessy-Milner logic.


Modal Logic Binary Relation Free Variable Operational Semantic Process Expression 
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.


  1. [1]
    R.M. Amadio. On the Reduction of CHOCS-Bisimulation to π-calculus Bisimulation. In Concurrency Theory, LNCS 715, pages 112–126. Springer, 1993. Proceedings CONCUR.Google Scholar
  2. [2]
    R.M. Amadio and M. Dam. Reasoning about Higher-order Processes. In P.D. Mosses, M. Nielsens, and M.I. Schwartzbach, editors, Theory and Practice of Software Development, LNCS 915, pages 202–216. Springer, 1995. Proceedings TAPSOFT.Google Scholar
  3. [3]
    M. Baldamus and J. Dingel. Modal Characterization of Weak Bisimulation for Higherorder Processes. Report 96-27, Berlin University of Technology, Computer Science Department, 1996. Retrievable via the Hypatia electronic library.Google Scholar
  4. [4]
    M. Baldamus and T. Frauenstein. Congruence Proofs for Weak Bisimulation Equivalences on Higher-order Process Calculi. Report 95-21, Berlin University of Technology, Computer Science Department, 1995.Google Scholar
  5. [5]
    W. Ferreira, M. Hennessy, and A. Jeffrey. A Theory of Weak Bisimulation for Core CML. In Functional Programming, pages 201–212. ACM Press, 1996. Conference proceedings.Google Scholar
  6. [6]
    R.J. van Glabeek. The Linear Time — Branching Time Spectrum II. In CONCUR, LNCS 715, pages 66–81. Springer, 1993. Proceedings.Google Scholar
  7. [7]
    M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137–161, 1985.CrossRefGoogle Scholar
  8. [8]
    D. Howe. Equality in Lazy Computation Systems. In Logic in Computer Science, pages 198–203, 1989. Proceedings LICS.Google Scholar
  9. [9]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  10. [10]
    R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, (Parts I and II). Information and Computation, (100):1–77, 1992.CrossRefGoogle Scholar
  11. [11]
    J.C. Mitchell. Type Systems for Programming Languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 365–458. North-Holland, 1990.Google Scholar
  12. [12]
    D. Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. Cst-99-93, Department of Computer Science, University of Edinburgh, 1993.Google Scholar
  13. [13]
    D. Sangiorgi. Bisimulation in Higher-order Calculi. Report RR-2508, INRIA-Sophia Antipolis, 1995. To appear in Information and Computation.Google Scholar
  14. [14]
    C. Stirling. Modal Logics for Communicating Systems. Theoretical Computer Science, (49):311–347, 1987.CrossRefGoogle Scholar
  15. [15]
    B. Thomsen. Plain CHOCS — A Second Generation Calculus for Higher-order Processes. Acta Informatica, (30):1–59, 1993.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Michael Baldamus
    • 1
  • Jürgen Dingel
    • 2
  1. 1.Berlin University of TechnologyGermany
  2. 2.Carnegie Mellon UniversityPittsburgh

Personalised recommendations