Skip to main content
Article thumbnail
Location of Repository

Branching time and orthogonal bisimulation equivalence

By J.A. Bergstra, A. Ponse and M.B. van der Zwaag


We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of τ-steps) may be compressed,\ud but not completely discarded. Hence, a process with τ-steps cannot be equivalent to one without τ-steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equivalence is a congruence for ACP extended with abstraction and priority operators. We provide a complete axiomatization, and describe some expressiveness results. Finally, we present the verification of a PAR protocol that is specified with use of priorities

Topics: Wijsbegeerte, Orthogonal bisimulation, Branching time, Process algebra, Silent step, Labelled transition system
Year: 2003
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.