Computing distinguishing formulas for branching bisimulation

  • Henri Korver
Session 1: Equivalence Checking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 575)


Branching bisimulation is a behavioral equivalence on labeled transition systems which has been proposed by Van Glabbeek and Weijland as an alternative to Milner's observation equivalence. This paper presents an algorithm which, given two branching bisimulation inequivalent finite state processes, produces a distinguishing formula in Hennessy-Milner logic extended with an ‘until’ operator. The algorithm, which is a modification of an algorithm due to Cleaveland, works in conjunction with a partition-refinement algorithm for deciding branching bisimulation equivalence. Our algorithm provides a useful extension to the algorithm for deciding equivalence because it tells a user why certain finite state systems are inequivalent.


  1. [1]
    R. Cleaveland: On Automatically Distinguishing Inequivalent Processes. In Proceedings: 1990 Workshop on Computer-Aided Verification (R. Kurshan and E.M. Clarke, editors), DIMACS technical report 90–31, Vol. 2, New Yersey, 1990. To appear in Lecture Notes in Computer Science.Google Scholar
  2. [2]
    R. DeNicola and F.W. Vaandrager: Three logics for branching bisimulation (extended abstract). In Proceedings 5th Annual Symposium on Logic in Computer Science, Philadelphia, USA, pages 118–129, Los Alamitos, CA, 1990. IEEE Computer Society Press. Full version appeared as CWI Report CS-R9012.Google Scholar
  3. [3]
    R.J. van Glabbeek: Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Free University, Amsterdam, 1990.Google Scholar
  4. [4]
    R.J. van Glabbeek and W.P. Weijland: Branching time and abstraction in bisimulation semantics (extended abstract). In G.X. Ritter, editor, Information Processing 89, pages 613–618. North-Holland, 1989.Google Scholar
  5. [5]
    J.F. Groote and F.W. Vaandrager: An efficient algorithm for branching bisimulation and stuttering equivalence. In M.S. Paterson, editor, Proceedings 17th ICALP, Warwick, volume 443 of LNCS, pages 626–638. Springer-Verlag, 1990.Google Scholar
  6. [6]
    M. Hennessy and R. Milner: Algebraic Laws for Nondeterminism and Concurrency. Journal of the Association for Computing Machinery, v. 32, n. 1, pages 137–161, January 1985.Google Scholar
  7. [7]
    P. Kanellakis and S.A. Smolka: CCS Expressions, Finite State Processes, and Three Problems of Equivalence. In Proceedings of the Second ACM Symposium on the Principles of Distributed Computing, 1983.Google Scholar
  8. [8]
    H. Korver: The Current State of Bisimulation Tools. In report P9101, Programming Research Group, Univerisity of Amsterdam, 1991.Google Scholar
  9. [9]
    H. Korver: Computing Distinguishing Formulas for Branching Bisimulation (Full Version). In report CS-R9121, CWI, Amsterdam, 1991.Google Scholar
  10. [10]
    R. Milner: Communication and Concurrency. Prentice Hall, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Henri Korver
    • 1
  1. 1.Department of software technologyCWIAB AmsterdamThe Netherlands

Personalised recommendations