A finite equational base for CCS with left merge and communication merge

2006

Presented at the International Colloquium on Automata, Languages and Programming, Venice

Additional Metadata
THEME	Software (theme 1)
Publisher	Springer Berlin / Heidelberg
Conference	International Colloquium on Automata, Languages and Programming
Organisation	Software Analysis and Transformation
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Aceto, L., Fokkink, W., Ingólfsdóttir, A., & Luttik, B. (2006). A finite equational base for CCS with left merge and communication merge. In Proceedings of the 33rd Colloquium on Automata, Languages and Programming (pp. 492–503). Springer Berlin / Heidelberg.

See Also
inProceedings On the axiomatizability of priority L. Aceto (Luca), T. Chen (Taolue), W.J. Fokkink (Wan) and A. Ingólfsdóttir
inProceedings On the axiomatizability of priority L. Aceto (Luca), T. Chen (Taolue), W.J. Fokkink (Wan) and A. Ingólfsdóttir

Publication