Bisimilarity is not Finitely Based over BPA with Interrupt

Forfattere

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

DOI:

https://doi.org/10.7146/brics.v12i33.21900

Resumé

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.

Downloads

Publiceret

2005-10-11

Citation/Eksport

Aceto, L., Fokkink, W. J., Ingólfsdóttir, A., & Nain, S. (2005). Bisimilarity is not Finitely Based over BPA with Interrupt. BRICS Report Series, 12(33). https://doi.org/10.7146/brics.v12i33.21900

Nummer

Nr. 33 (2005): RS-33 Bisimilarity is not Finitely Based over BPA with Interrupt

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).