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.
UR - https://www.scopus.com/pages/publications/59449097974
UR - https://www.scopus.com/inward/citedby.url?scp=59449097974&partnerID=8YFLogxK
U2 - 10.1145/1459010.1459016
DO - 10.1145/1459010.1459016
M3 - Article
SN - 1529-3785
VL - 10
SP - 1
EP - 26
JO - ACM Transactions on Computational Logic
JF - ACM Transactions on Computational Logic
IS - 1:6
ER -