Bisimilarity is not Finitely Based over BPA with Interrupt

Luca Aceto
Willem Jan Fokkink
Anna Ingólfsdóttir
Sumit Nain

October 2004


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.

Available as PostScript, PDF, DVI.


Last modified: 2004-10-27 by webmaster.