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 restriction and relabelling. Our equational base is finite if the set of actions is finite. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Aceto, L., Fokkink, W., Ingolfsdottir, A., & Luttik, B. (2006). A finite equational base for CCS with left merge and communication merge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 492–503). Springer Verlag. https://doi.org/10.1007/11787006_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free