Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy&#39;s Merge
<|reference_start|>Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br> Hennessy&#39;s Merge: 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.<|reference_end|>
@article{aceto2005split-2,
    title={Split-2 Bisimilarity has a Finite Axiomatization over CCS with<br>
  Hennessy&#39;s Merge},
    author={Luca Aceto, Wan Fokkink, Anna Ingolfsdottir and Bas Luttik},
    journal={Logical Methods in Computer Science, Volume 1, Issue 1 (March 9,
  2005) lmcs:2273},
    year={2005},
    doi={10.2168/LMCS-1(1:3)2005},
    archivePrefix={arXiv},
    eprint={cs/0501040},
    primaryClass={cs.LO}
}