A Finite Equational Base for CCS with Left Merge and Communication Merge

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/114807Using the left merge and 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 relabelling. Our equational base is finite if the set of actions is finite.Logic in Computer ScienceD.3.1; F.1.1; F.1.2; F.3.2; F.4.1A Finite Equational Base for CCS with Left Merge and Communication Mergetext