On the axiomatisation of branching bisimulation congruence over CCS

DOI10.4230/LIPICS.CONCUR.2022.6MaRDI QIDQ6587111zbMATH OpenFDO

Authors Luca Aceto, Valentina Castiglioni, Anna Ingolfsdottir, Bas Luttik

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2022.6

zbMATH Keywords

CCSequational basisparallel compositionweak semantics

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(2)

• Non finite axiomatisability of weak bisimulation-based congruences
• Axiomatising weak bisimulation congruences over CCS with left merge and communication merge

This page was built for publication: On the axiomatisation of branching bisimulation congruence over CCS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587111)