Aceto, Luca and Fokkink, Wan and Ingolfsdottir, Anna and Luttik, Bas - Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy&#39;s Merge

lmcs:2273 - Logical Methods in Computer Science, March 9, 2005, Volume 1, Issue 1
Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy&#39;s Merge

Authors: Aceto, Luca and Fokkink, Wan and Ingolfsdottir, Anna and Luttik, Bas

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, relabelling and restriction 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.


Source : oai:arXiv.org:cs/0501040
DOI : 10.2168/LMCS-1(1:3)2005
Volume: Volume 1, Issue 1
Published on: March 9, 2005
Submitted on: September 1, 2004
Keywords: Computer Science - Logic in Computer Science,D.3.1,F.1.1,F.1.2,F.3.2,F.3.4,F.4.1


Share

Consultation statistics

This page has been seen 54 times.
This article's PDF has been downloaded 25 times.