{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:29Z","timestamp":1753889789488,"version":"3.41.2"},"reference-count":18,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2005,3,9]],"date-time":"2005-03-09T00:00:00Z","timestamp":1110326400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/assumed-1991-2003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This note shows that split-2 bisimulation equivalence (also known as timed\nequivalence) affords a finite equational axiomatization over the process\nalgebra obtained by adding an auxiliary operation proposed by Hennessy in 1981\nto the recursion, relabelling and restriction free fragment of Milner's\nCalculus of Communicating Systems. Thus the addition of a single binary\noperation, viz. Hennessy's merge, is sufficient for the finite equational\naxiomatization of parallel composition modulo this non-interleaving\nequivalence. This result is in sharp contrast to a theorem previously obtained\nby the same authors to the effect that the same language is not finitely based\nmodulo bisimulation equivalence.<\/jats:p>","DOI":"10.2168\/lmcs-1(1:3)2005","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T12:13:58Z","timestamp":1121256838000},"source":"Crossref","is-referenced-by-count":3,"title":["Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy&amp;#39;s Merge"],"prefix":"10.46298","volume":"Volume 1, Issue 1","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7443-8978","authenticated-orcid":false,"given":"Wan","family":"Fokkink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2005,3,9]]},"reference":[{"key":"10.2168\/LMCS-1(1:3)2005_Ac94c","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793243600"},{"key":"10.2168\/LMCS-1(1:3)2005_Aceto2003a","first-page":"89","volume":"81","author":"Aceto","year":"2003","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"10.2168\/LMCS-1(1:3)2005_AFIL2003","doi-asserted-by":"crossref","unstructured":"Luca Aceto, Wan Fokkink, Anna Ingolfsdottir, and Bas Luttik. CCS with Hennessy's merge has no finite equational axiomatization. Research report RS-03-34, BRICS, November 2003. To appear inTheoretical Computer Science.","DOI":"10.7146\/brics.v10i34.21802"},{"key":"10.2168\/LMCS-1(1:3)2005_AH93","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1019"},{"key":"10.2168\/LMCS-1(1:3)2005_Baeten2004","unstructured":"Jos C.M. Baeten. A brief history of process algebra. Report CSR 04-02, Eindhoven University of Technology, 2004."},{"key":"10.2168\/LMCS-1(1:3)2005_BK84b","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"10.2168\/LMCS-1(1:3)2005_BW90","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","component":"18","volume-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"10.2168\/LMCS-1(1:3)2005_GorrieriLaneve1995","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1066"},{"key":"10.2168\/LMCS-1(1:3)2005_GV87","doi-asserted-by":"crossref","unstructured":"R. van Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In J. de Bakker, A.J. Nijman, and P.C. Treleaven, editors,Proceedings PARLE conference,Eindhoven, Vol. II (Parallel Languages), volume 259 ofLecture Notes in Computer Science, pages 224-242. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_13"},{"key":"10.2168\/LMCS-1(1:3)2005_He88","doi-asserted-by":"publisher","DOI":"10.1137\/0217063"},{"key":"10.2168\/LMCS-1(1:3)2005_HM85","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2460"},{"key":"10.2168\/LMCS-1(1:3)2005_Luttik2003","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/978-3-540-45138-9_50","volume":"2747","author":"Luttik","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"year":"1989","author":"Milner","key":"10.2168\/LMCS-1(1:3)2005_Mi89"},{"key":"10.2168\/LMCS-1(1:3)2005_MM93","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90176-T"},{"key":"10.2168\/LMCS-1(1:3)2005_Mo89","unstructured":"F. Moller.Axioms for Concurrency. PhD thesis, Department of Computer Science, University of Edinburgh, July 1989. Report CST-59-89. Also published as ECS-LFCS-89-84."},{"key":"10.2168\/LMCS-1(1:3)2005_Mo90","first-page":"752","volume-title":"Lecture Notes in Computer Science","volume":"443","author":"Moller","year":"1990","journal-title":"Lecture Notes in Computer Science"},{"key":"10.2168\/LMCS-1(1:3)2005_Mo90a","doi-asserted-by":"crossref","unstructured":"F. Moller. The nonexistence of finite axiomatisations for CCS congruences. InProceedings5thAnnual Symposium on Logic in Computer Science,Philadelphia, USA, pages 142-153. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113741"},{"key":"10.2168\/LMCS-1(1:3)2005_Pa81","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor,5thGI Conference,Karlsruhe, Germany, volume 104 ofLecture Notes in Computer Science, pages 167-183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2273\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2273\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:11:15Z","timestamp":1681243875000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,9]]},"references-count":18,"URL":"https:\/\/doi.org\/10.2168\/lmcs-1(1:3)2005","relation":{"is-same-as":[{"id-type":"arxiv","id":"cs\/0501040","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.cs\/0501040","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2005,3,9]]},"article-number":"2273"}}