CCS with Hennessy's merge has no finite-equational axiomatization

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 Communicating Systems is not finitely based modulo bisimul...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 330; no. 3; pp. 377 - 405
Main Authors: Aceto, Luca, Fokkink, Wan, Ingólfsdóttir, Anna, Luttik, Bas
Format: Journal Article Conference Proceeding
Language:English
Published: Amsterdam Elsevier B.V 09.02.2005
Elsevier
Subjects:
Algebra
Algorithmics. Computability. Computer arithmetics
Applied sciences
Bisimulation
CCS
Communication merge
Complete axiomatizations
Computer science; control theory; systems
Concurrency
Equational logic
Exact sciences and technology
General algebraic systems
General logic
Hennessy's merge
Left merge
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Model theory
Non-finitely based algebras
Process algebra
Sciences and techniques of general use
Theoretical computing
Process algebra
Non-finitely based algebras
68Q45
Communication merge
Complete axiomatizations
Hennessy's merge
08A70
CCS
Concurrency
Bisimulation
Equational logic
03C05
68Q70
03B45
68Q55
68Q10
Left merge
Computer theory
Bisimulation equivalence
Calculus of communicating systems
Axiomatic theory
Hennessy merge
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Communicating 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 modulo bisimulation equivalence is desired.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.10.003