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

63 Downloads (Pure)

Abstract

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. 2000 MATHEMATICS SUBJECT CLASSIFICATION: 08A70, 03B45, 03C05, 68Q10, 68Q45, 68Q55, 68Q70. CR SUBJECT CLASSIFICATION (1991): D.3.1, F.1.1, F.1.2, F.3.2, F.3.4, F.4.1. KEYWORDS AND PHRASES: Concurrency, process algebra, CCS, bisimulation, Hennessy¿s merge, left merge, communication merge, parallel composition, equational logic, complete axiomatizations, non-finitely based algebras.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages33
Publication statusPublished - 2004

Publication series

NameComputer science reports
Volume0403
ISSN (Print)0926-4515

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. (2004). CCS with Hennessy's merge has no finite equational axiomatization. (Computer science reports; Vol. 0403). Technische Universiteit Eindhoven.