| |
VOLUME 1, ISSUE 1, PAPER 3
|
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge
|
©Luca Aceto, BRICS, University of Aalborg
©Wan Fokkink, CWI, Amsterdam
©Anna Ingolfsdottir, BRICS, University of Aalborg and University of Iceland
©Bas Luttik, Eindhoven Technical University
|
Abstract
This note shows that split-2 bisimulation equivalence (also known as
timed equivalence) affords a finite
equational axiomatization over the process algebra obtained by
adding an auxiliary operation proposed by Hennessy in 1981 to the
recursion free fragment of Milner's Calculus of Communicating
Systems. Thus the addition of a single binary operation,
viz. Hennessy's merge, is sufficient for the finite equational
axiomatization of parallel composition modulo this non-interleaving
equivalence. This result is in sharp contrast to a theorem
previously obtained by the same authors to the effect that the same
language is not finitely based modulo bisimulation equivalence.
|
Publication date: March 9, 2005
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-1(1:3)2005
Hit Counts: 4428 |
 Creative Commons | |
