A Finite Equational Base for CCS with Left Merge and Communication Merge
Logic in Computer Science
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0608001,
title = {A Finite Equational Base for CCS with Left Merge and Communication Merge},
author = {Luca Aceto and Wan Fokkink and Anna Ingolfsdottir and Bas Luttik},
journal= {arXiv preprint arXiv:cs/0608001},
year = {2007}
}