A Finite Equational Base for CCS with Left Merge and Communication Merge

DOI10.1007/11787006_42MaRDI QIDQ3591426zbMATH OpenOpenAlexFDO

Authors Luca Aceto, Anna Ingolfsdottir, Bas Luttik, Wan Fokkink

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_42

Mathematics Subject Classification ID

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

Recommendations

• A finite equational base for CCS with left merge and communication merge
• CCS with Hennessy's merge has no finite-equational axiomatization
• Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
• Foundations of Software Science and Computation Structures
• Foundations of Software Science and Computation Structures

Cited in

(3)

• CCS with Hennessy's merge has no finite-equational axiomatization
• A finite equational base for CCS with left merge and communication merge
• On finite alphabets and infinite bases

This page was built for publication: A Finite Equational Base for CCS with Left Merge and Communication Merge

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