A Complete Axiomatization for Prefix Iteration in Branching Bisimulation

Abstract

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