Open AccessBisimilarity is not Finitely Based over BPA with Interrupt
Author(s) -
Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain
Publication year - 2005
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v12i33.21900
Subject(s) - interrupt , bisimulation , process calculus , finitely generated abelian group , equivalence (formal languages) , mathematics , operator (biology) , algebra over a field , discrete mathematics , pure mathematics , computer science , theoretical computer science , embedded system , biochemistry , chemistry , repressor , transcription factor , gene , microcontroller
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.