A Finite Equational Base for CCS with Left Merge and Communication Merge
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Using 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.