A finite equational base for CCS with left merge and communication merge

L. Aceto; W.J. Fokkink; A. Ingolfsdottir; B. Luttik

doi:10.1145/1459010.1459016

A finite equational base for CCS with left merge and communication merge

L. Aceto, W.J. Fokkink, A. Ingolfsdottir, B. Luttik

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

Abstract

Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite. © 2009 ACM.

Original language	English
Pages (from-to)	1-26
Journal	ACM Transactions on Computational Logic
Volume	10
Issue number	1:6
DOIs	https://doi.org/10.1145/1459010.1459016
Publication status	Published - 2009

Access to Document

10.1145/1459010.1459016

Cite this

@article{5950a9374b6a4bec963c6cc8df94af92,

title = "A finite equational base for CCS with left merge and communication merge",

abstract = "Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite. {\textcopyright} 2009 ACM.",

author = "L. Aceto and W.J. Fokkink and A. Ingolfsdottir and B. Luttik",

year = "2009",

doi = "10.1145/1459010.1459016",

language = "English",

volume = "10",

pages = "1--26",

journal = "ACM Transactions on Computational Logic",

issn = "1529-3785",

publisher = "Association for Computing Machinery (ACM)",

number = "1:6",

}

TY - JOUR

T1 - A finite equational base for CCS with left merge and communication merge

AU - Aceto, L.

AU - Fokkink, W.J.

AU - Ingolfsdottir, A.

AU - Luttik, B.

PY - 2009

Y1 - 2009

N2 - Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite. © 2009 ACM.

AB - Using the left merge and the communication merge from ACP, we present an equational base (i.e., a ground-complete and ω-complete set of valid equations) for the fragment of CCS without recursion, restriction and relabeling modulo (strong) bisimilarity. Our equational base is finite if the set of actions is finite. © 2009 ACM.

U2 - 10.1145/1459010.1459016

DO - 10.1145/1459010.1459016

M3 - Article

VL - 10

SP - 1

EP - 26

JO - ACM Transactions on Computational Logic

JF - ACM Transactions on Computational Logic

SN - 1529-3785

IS - 1:6

ER -

A finite equational base for CCS with left merge and communication merge

Abstract

Access to Document

Fingerprint

Cite this