A Menagerie of Non-Finitely Based Process Semantics over BPA ∗ : From Ready Simulation Semantics to Completed Tracs


Fokkink and Zantema ((1994) Computer Journal 37:259–267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA∗). In light of this positive result on the mathematical tractability of bisimulation equivalence over BPA∗, a natural question to ask is… (More)

5 Figures and Tables


  • Presentations referencing similar topics