Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge

Details Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge

2005-01-19

arxiv.org/abs/cs/0501040v4

LMCS 1 (1:3) 2005

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-1(1:3)2005

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.

Affiliated with

Also associated with

No associations

Rating

Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy's Merge will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511401