Bisimilarity is not Finitely Based over BPA with Interrupt

Authors

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

DOI:

https://doi.org/10.7146/brics.v11i24.21849

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.

Downloads

Published

2004-10-11

How to Cite

Aceto, L., Fokkink, W. J., Ingólfsdóttir, A., & Nain, S. (2004). Bisimilarity is not Finitely Based over BPA with Interrupt. BRICS Report Series, 11(24). https://doi.org/10.7146/brics.v11i24.21849

Issue

No. 24 (2004): RS-24 Bisimilarity is not Finitely Based over BPA with Interrupt

Section

Articles

License

Creative Commons License

Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.