@inproceedings{c1a9f9cdfbb647d7bdca5a8b3374c8b2,
title = "Are two binary operators necessary to finitely axiomatise parallel composition?",
abstract = "Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over ACP/CCS extended with the binary left and communication merge operators. Moller proved that auxiliary operators are necessary to obtain a finite axiomatisation of bisimilarity over CCS, and Aceto et al. showed that this remains true when Hennessy{\textquoteright}s merge is added to that language. These results raise the question of whether there is one auxiliary binary operator whose addition to CCS leads to a finite axiomatisation of bisimilarity. This study provides a negative answer to that question based on three reasonable assumptions.",
author = "L. Aceto and V. Castiglioni and W. Fokkink and A. Ing{\'o}lfsd{\'o}ttir and B. Luttik",
year = "2021",
doi = "10.4230/LIPIcs.CSL.2021.8",
language = "English",
isbn = "9783959771757",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "1--17",
editor = "Christel Baier and Jean Goubault-Larrecq",
booktitle = "29th EACSL Annual Conference on Computer Science Logic (CSL 2021)",
note = "29th EACSL Annual Conference on Computer Science Logic, CSL 2021 ; Conference date: 25-01-2021 Through 28-01-2021",
}