Results 1 -
1 of
1
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
- Logical Methods in Computer Science
, 2004
"... 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 ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
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 # Partially supported by the Statens Naturvidenskabelige Forskningsrad (Danish Natural Science Research Council), project "The Equational Logic of Parallel Processes", nr. 21-03-0342.

