A finite equational base for CCS with left merge and communication merge

DOI10.1145/1459010.1459016zbMath1367.68207OpenAlexW2164504930MaRDI QIDQ5277824

Bas Luttik, Luca Aceto, Anna Ingólfsdóttir, W. J. Fokkink

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1459010.1459016

zbMATH Keywords

process algebraconcurrencyCCSbisimilarityparallel compositionhandshakingfinite equational basecommunication mergeleft merge

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? ⋮ Unique parallel decomposition in branching and weak bisimulation semantics ⋮ Non-finite axiomatisability results via reductions: CSP parallel composition and CCS restriction ⋮ Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet ⋮ Unnamed Item ⋮ Honesty by Typing ⋮ Unnamed Item ⋮ Axiomatizing weak simulation semantics over BCCSP ⋮ Rule formats for distributivity ⋮ Unnamed Item ⋮ Axiomatizing Weak Ready Simulation Semantics over BCCSP

This page was built for publication: A finite equational base for CCS with left merge and communication merge