Bisimilarity is not finitely based over BPA with interrupt

L. Aceto; W.J. Fokkink; A. Ingólfsdóttir; S. Nain

doi:10.1016/j.tcs.2006.07.003

Bisimilarity is not finitely based over BPA with interrupt

L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, S. Nain

Research output: Contribution to Journal › Article › Academic › peer-review

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 (BPA) 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. © 2006 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	60-81
Journal	Theoretical Computer Science
Volume	366
Issue number	1-2
DOIs	https://doi.org/10.1016/j.tcs.2006.07.003
Publication status	Published - 2006

Bibliographical note

DBLP:journals/tcs/AcetoFIN06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1016/j.tcs.2006.07.003

Handle.net

Persistent link

Cite this

@article{d561b77c71ff47218d7124411188f42e,

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 (BPA) 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. {\textcopyright} 2006 Elsevier B.V. All rights reserved.",

author = "L. Aceto and W.J. Fokkink and A. Ing{\'o}lfsd{\'o}ttir and S. Nain",

note = "DBLP:journals/tcs/AcetoFIN06 ",

year = "2006",

doi = "10.1016/j.tcs.2006.07.003",

language = "English",

volume = "366",

pages = "60--81",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Bisimilarity is not finitely based over BPA with interrupt

AU - Aceto, L.

AU - Fokkink, W.J.

AU - Ingólfsdóttir, A.

AU - Nain, S.

N1 - DBLP:journals/tcs/AcetoFIN06

PY - 2006

Y1 - 2006

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 (BPA) 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. © 2006 Elsevier B.V. All rights reserved.

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 (BPA) 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. © 2006 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.tcs.2006.07.003

DO - 10.1016/j.tcs.2006.07.003

M3 - Article

SN - 0304-3975

VL - 366

SP - 60

EP - 81

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1-2

ER -

Bisimilarity is not finitely based over BPA with interrupt

Abstract

Bibliographical note

UN SDGs

Access to Document

Handle.net

Fingerprint

Cite this