{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:16:57Z","timestamp":1762460217065,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T00:00:00Z","timestamp":1642550400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This paper studies the existence of finite equational axiomatisations of the\ninterleaving parallel composition operator modulo the behavioural equivalences\nin van Glabbeek's linear time-branching time spectrum. In the setting of the\nprocess algebra BCCSP over a finite set of actions, we provide finite,\nground-complete axiomatisations for various simulation and (decorated) trace\nsemantics. We also show that no congruence over BCCSP that includes\nbisimilarity and is included in possible futures equivalence has a finite,\nground-complete axiomatisation; this negative result applies to all the nested\ntrace and nested simulation semantics.<\/jats:p>","DOI":"10.46298\/lmcs-18(1:15)2022","type":"journal-article","created":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:54:18Z","timestamp":1642625658000},"source":"Crossref","is-referenced-by-count":0,"title":["On the Axiomatisability of Parallel Composition"],"prefix":"10.46298","volume":"Volume 18, Issue 1","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentina","family":"Castiglioni","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"}]},{"given":"Mathias R.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2022,1,19]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8979\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8979\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:19:34Z","timestamp":1687292374000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,19]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(1:15)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2102.11166v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2102.11166v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2102.11166","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2102.11166","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2022,1,19]]},"article-number":"7217"}}