Skip to main content
Article thumbnail
Location of Repository

A Complete Axiomatization for Prefix Iteration in Branching Bisimulation

By W.J. Fokkink


This paper studies the interaction of prefix iteration μ*x with the silent\ud step τ in the setting of branching bisimulation. That is, we present a finite\ud equational axiomatization for Basic Process Algebra with deadlock, empty\ud process and the silent step, extended with prefix iteration, and prove that\ud this axiomatization is complete with respect to rooted branching bisimulation\ud equivalence

Topics: Wijsbegeerte
Year: 1995
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.