CCS with Hennessy's merge has no finite equational axiomatization

L. Aceto, W.J. Fokkink, A. Ingólfsdóttir, B. Luttik

Research output: Book/ReportReportAcademic

80 Downloads (Pure)

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
Original languageEnglish
Place of PublicationAarhus
PublisherBRICS, University of Aarhus
Number of pages37
Publication statusPublished - 2003

Publication series

NameBRICS Report Series
VolumeRS-03-04
ISSN (Print)0909-0878

Fingerprint Dive into the research topics of 'CCS with Hennessy's merge has no finite equational axiomatization'. Together they form a unique fingerprint.

  • Cite this

    Aceto, L., Fokkink, W. J., Ingólfsdóttir, A., & Luttik, B. (2003). CCS with Hennessy's merge has no finite equational axiomatization. (BRICS Report Series; Vol. RS-03-04). BRICS, University of Aarhus.