Bisimilarity is not Finitely Based over BPA with Interrupt

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

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.

Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v11i24.21849
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library