A finite equational base for CCS with left merge and communication merge
Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik · ACM Transactions on Computational Logic · 2009
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.