English

In search of lost time: Axiomatising parallel composition in process algebras

Logic in Computer Science 2021-05-04 v1

Abstract

This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus on the recursion, relabelling and restriction free fragment of CCS and we discuss the solutions to three problems that were open for many years. The first problem concerns the status of Bergstra and Klop's auxiliary operators left merge and communication merge in the finite axiomatisation of parallel composition modulo bisimiliarity: We argue that, under some natural assumptions, the addition of a single auxiliary binary operator to CCS does not yield a finite axiomatisation of bisimilarity. Then we delineate the boundary between finite and non-finite axiomatisability of the congruences in van Glabbeek's linear time-branching time spectrum over CCS. Finally, we present a novel result to the effect that rooted weak bisimilarity has no finite complete axiomatisation over CCS.

Keywords

Cite

@article{arxiv.2105.00735,
  title  = {In search of lost time: Axiomatising parallel composition in process algebras},
  author = {Luca Aceto and Elli Anastasiadi and Valentina Castiglioni and Anna Ingolfsdottir and Bas Luttik},
  journal= {arXiv preprint arXiv:2105.00735},
  year   = {2021}
}

Comments

arXiv admin note: text overlap with arXiv:2010.01943, arXiv:2102.11166