On the Axiomatisability of Parallel Composition
This paper studies the existence of finite equational axiomatisations of the interleaving parallel composition operator modulo the behavioural equivalences in van Glabbeek's linear time-branching time spectrum. In the setting of the process algebra BCCSP over a finite set of actions, we provide...
Main Authors: | Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik, Mathias R. Pedersen |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-01-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/7217/pdf |
Similar Items
-
A Complete Axiomatisation for Quantifier-Free Separation Logic
by: Stéphane Demri, et al.
Published: (2021-08-01) -
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
by: Robin Piedeleu, et al.
Published: (2023-02-01) -
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
by: Luca Aceto, et al.
Published: (2005-03-01) -
The $\pi$-Calculus is Behaviourally Complete and Orbit-Finitely Executable
by: Bas Luttik, et al.
Published: (2021-02-01) -
Rule Formats for Nominal Process Calculi
by: Luca Aceto, et al.
Published: (2019-10-01)