Abstract
This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. 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.
| Original language | English |
|---|---|
| Pages (from-to) | 103-113 |
| Number of pages | 11 |
| Journal | Fundamenta Informaticae |
| Volume | 26 |
| Issue number | 2 |
| Publication status | Published - 1 May 1996 |