A Finite Equational Base for CCS with Left Merge and Communication Merge
classification
💻 cs.LO
keywords
mergebaseequationalfinitecommunicationleftactionscomplete
read the original abstract
Using the left merge and communication merge from ACP, we present an equational base (i.e., a ground-complete and $\omega$-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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.