Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy'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, re- labelling 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.

[1]  Luca Aceto.  On "Axiomatising Finite Concurrent Processes" , 1994, SIAM J. Comput..

[2]  Peter D. Mosses,et al.  Pragmatics of Modular SOS , 2002, AMAST.

[3]  Luca Aceto,et al.  Some of My Favourite Results in Classic Process , 2003 .

[4]  Cosimo Laneve,et al.  Split and ST Bisimulation Semantics , 1995, Inf. Comput..

[5]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[6]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[7]  U. Kohlenbach,et al.  Bounds on Iterations of Asymptotically Quasi-Nonexpansive Mappings , 2003 .

[8]  Hans Hüttel,et al.  Recursive Ping-Pong Protocols , 2003 .

[9]  Luca Aceto,et al.  Towards Action-Refinement in Process Algebras , 1993, Inf. Comput..

[10]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[11]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[12]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[13]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[14]  Bas Luttik.  A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory , 2003, MFCS.

[15]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[16]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[17]  Marius Mikucionis,et al.  Online On-the-Fly Testing of Real-time Systems , 2003 .

[18]  Philipp Gerhardy.  The Role of Quantifier Alternations in Cut Elimination , 2005, Notre Dame J. Formal Log..

[19]  Bas Luttik,et al.  CCS with Hennessy's merge has no finite-equational axiomatization , 2005, Theor. Comput. Sci..

[20]  Branimir Lambov.  A Two-Layer Approach to the Computability and Complexity of Real Numbers , 2003 .

[21]  Peter D. Mosses,et al.  Composing programming languages by combining action-semantics modules , 2001, Sci. Comput. Program..

[22]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[23]  Bas Luttik,et al.  Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge , 2004 .

[24]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[25]  Unique decomposition of processes , 1990, Bull. EATCS.

[26]  Faron Moller,et al.  Axioms for concurrency , 1989 .