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.
Aceto, L., Fokkink, W. J., Ingolfsdottir, A., & Luttik, B. (2009). A finite equational base for CCS with left merge and communication merge. ACM Transactions on Computational Logic, 10(1:6), 1-26. https://doi.org/10.1145/1459010.1459016