On the Axiomatizability of Priority II

L. Aceto; T. Chen; A. Ingolfsdottir; B. Luttik; J.C. van de Pol

doi:10.1016/j.tcs.2011.02.033

On the Axiomatizability of Priority II

L. Aceto
, T. Chen
, A. Ingolfsdottir
, B. Luttik
, J.C. van de Pol

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

Abstract

This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables. © 2011 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	3035-3044
Journal	Theoretical Computer Science
Volume	412
DOIs	https://doi.org/10.1016/j.tcs.2011.02.033
Publication status	Published - 2011

UN SDGs

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

SDG 16 Peace, Justice and Strong Institutions

Access to Document

10.1016/j.tcs.2011.02.033

Persistent URL (handle)

Persistent link

Cite this

@article{fb722c3d7bb443f896dba99bf6065cef,

title = "On the Axiomatizability of Priority II",

abstract = "This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables. {\textcopyright} 2011 Elsevier B.V. All rights reserved.",

author = "L. Aceto and T. Chen and A. Ingolfsdottir and B. Luttik and \{van de Pol\}, J.C.",

year = "2011",

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

language = "English",

volume = "412",

pages = "3035--3044",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - On the Axiomatizability of Priority II

AU - Aceto, L.

AU - Chen, T.

AU - Ingolfsdottir, A.

AU - Luttik, B.

AU - van de Pol, J.C.

PY - 2011

Y1 - 2011

N2 - This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables. © 2011 Elsevier B.V. All rights reserved.

AB - This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables. © 2011 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.tcs.2011.02.033

DO - 10.1016/j.tcs.2011.02.033

M3 - Article

SN - 0304-3975

VL - 412

SP - 3035

EP - 3044

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

On the Axiomatizability of Priority II

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this