Bisimilarity is not finitely based over BPA with interrupt

Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, Sumit Nain

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

4 Citationer (Scopus)

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.
OriginalsprogEngelsk
TitelProceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005
RedaktørerJosé Luiz Fiadeiro, Neil Harman, Markus Roggenbach, Jan Rutten
ForlagIEEE Computer Society Press
Publikationsdato2005
Sider54-68
ISBN (Elektronisk)3540286209
StatusUdgivet - 2005
BegivenhedConference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 September 2005 - Swansea, Wales, Storbritannien
Varighed: 3 sep. 20056 sep. 2005

Konference

KonferenceConference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 September 2005
LandStorbritannien
BySwansea, Wales
Periode03/09/200506/09/2005
NavnLecture Notes in Computer Science
Nummer3629

Fingerprint

Basic Algebra
Process Algebra
Bisimulation
Axiomatization
Equivalence
Closed
Operator
Language

Citer dette

Aceto, L., Fokkink, W., Ingolfsdottir, A., & Nain, S. (2005). Bisimilarity is not finitely based over BPA with interrupt. I J. Luiz Fiadeiro, N. Harman, M. Roggenbach, & J. Rutten (red.), Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005 (s. 54-68). IEEE Computer Society Press. Lecture Notes in Computer Science, Nr. 3629
Aceto, Luca ; Fokkink, Wan ; Ingolfsdottir, Anna ; Nain, Sumit. / Bisimilarity is not finitely based over BPA with interrupt. Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005. red. / José Luiz Fiadeiro ; Neil Harman ; Markus Roggenbach ; Jan Rutten. IEEE Computer Society Press, 2005. s. 54-68 (Lecture Notes in Computer Science; Nr. 3629).
@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",

}

Aceto, L, Fokkink, W, Ingolfsdottir, A & Nain, S 2005, Bisimilarity is not finitely based over BPA with interrupt. i J Luiz Fiadeiro, N Harman, M Roggenbach & J Rutten (red), Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005. IEEE Computer Society Press, Lecture Notes in Computer Science, nr. 3629, s. 54-68, Conference on Algebra and Coalgebra in Computer Science (CALCO), 3-6 September 2005, Swansea, Wales, Storbritannien, 03/09/2005.

Bisimilarity is not finitely based over BPA with interrupt. / Aceto, Luca; Fokkink, Wan; Ingolfsdottir, Anna; Nain, Sumit.

Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005. red. / José Luiz Fiadeiro; Neil Harman; Markus Roggenbach; Jan Rutten. IEEE Computer Society Press, 2005. s. 54-68 (Lecture Notes in Computer Science; Nr. 3629).

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

TY - GEN

T1 - Bisimilarity is not finitely based over BPA with interrupt

AU - Aceto, Luca

AU - Fokkink, Wan

AU - Ingolfsdottir, Anna

AU - Nain, Sumit

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Article in proceeding

T3 - Lecture Notes in Computer Science

SP - 54

EP - 68

BT - Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005

A2 - Luiz Fiadeiro, José

A2 - Harman, Neil

A2 - Roggenbach, Markus

A2 - Rutten, Jan

PB - IEEE Computer Society Press

ER -

Aceto L, Fokkink W, Ingolfsdottir A, Nain S. Bisimilarity is not finitely based over BPA with interrupt. I Luiz Fiadeiro J, Harman N, Roggenbach M, Rutten J, red., Proceedings of Algebra and Coalgebra in Computer Science, 1st Conference, CALCO 2005. IEEE Computer Society Press. 2005. s. 54-68. (Lecture Notes in Computer Science; Nr. 3629).