CCS with Hennessy’s merge has no finite equational axiomatization (2005)
| Venue: | Theoretical Computer Science |
| Citations: | 18 - 15 self |
BibTeX
@ARTICLE{Aceto05ccswith,
author = {Luca Aceto and Wan Fokkink and Anna Ingólfsdóttir and Bas Luttik},
title = {CCS with Hennessy’s merge has no finite equational axiomatization},
journal = {Theoretical Computer Science},
year = {2005},
volume = {330},
pages = {377--405}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy’s merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition is desired.
