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.
Original language | English |
---|---|
Title of host publication | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781665448956 |
DOIs | |
Publication status | Published - 29 Jun 2021 |
Event | 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021 - Virtual, Online Duration: 29 Jun 2021 → 2 Jul 2021 |
Publication series
Name | Proceedings - Symposium on Logic in Computer Science |
---|---|
Volume | 2021-June |
ISSN (Print) | 1043-6871 |
Conference
Conference | 36th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2021 |
---|---|
City | Virtual, Online |
Period | 29/06/21 → 2/07/21 |
Bibliographical note
Funding Information:This work has been supported by the project ‘Open Prob-
Publisher Copyright:
© 2021 IEEE.
Other keywords
- bisimilarity
- CCS
- Equational logic
- linear time-branching time spectrum
- parallel composition