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 JournalArticleAcademicpeer-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 languageEnglish
Pages (from-to)1-26
JournalACM Transactions on Computational Logic
Volume10
Issue number1:6
DOIs
Publication statusPublished - 2009

Fingerprint

Communication
Recursion
Modulo
Fragment
Valid
Restriction

Cite this

Aceto, L. ; Fokkink, W.J. ; Ingolfsdottir, A. ; Luttik, B. / A finite equational base for CCS with left merge and communication merge. In: ACM Transactions on Computational Logic. 2009 ; Vol. 10, No. 1:6. pp. 1-26.
@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. {\circledC} 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",

}

A finite equational base for CCS with left merge and communication merge. / Aceto, L.; Fokkink, W.J.; Ingolfsdottir, A.; Luttik, B.

In: ACM Transactions on Computational Logic, Vol. 10, No. 1:6, 2009, p. 1-26.

Research output: Contribution to JournalArticleAcademicpeer-review

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 -