@inproceedings{b1aed39031c311db8de7000ea68e967b,
title = "Bisimilarity is not finitely based over BPA with interrupt",
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.",
author = "Luca Aceto and Wan Fokkink and Anna Ingolfsdottir and Sumit Nain",
year = "2005",
language = "English",
series = "Lecture Notes in Computer Science",
publisher = "IEEE Computer Society Press",
number = "3629",
pages = "54--68",
editor = "{Luiz Fiadeiro}, Jos{\'e} and Neil Harman and Markus Roggenbach and Jan Rutten",
booktitle = "Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005",
address = "United States",
note = "Conference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 September 2005 ; Conference date: 03-09-2005 Through 06-09-2005",
}