Open AccessBisimilarity is not Finitely Based over BPA with Interrupt
Author(s) -
Luca Aceto,
Willem Jan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain
Publication year - 2004
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v11i24.21849
Subject(s) - interrupt , bisimulation , process calculus , equivalence (formal languages) , finitely generated abelian group , mathematics , algebra over a field , operator (biology) , process (computing) , computer science , discrete mathematics , pure mathematics , programming language , 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.