Bisimilarity is not Finitely Based over BPA with Interrupt
Luca Aceto
October 2005 |
Abstract:
This paper shows that bisimulation equivalence does not afford
a finite equational axiomatization over the language obtained by enriching
Bergstra and Klop's Basic Process Algebra with the interrupt operator.
Moreover, it is shown that the collection of closed equations over this
language is also not finitely based. In sharp contrast to these results, the
collection of closed equations over the language BPA enriched with the
disrupt operator is proven to be finitely based
Available as PostScript, PDF, DVI. |