From CCS to CSP: the m-among-n synchronisation approach

arXiv2209.05232MaRDI QIDQ6190868FDOQ6190868

Authors: Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield 

Publication date: 6 February 2024

Full work available at URL: https://arxiv.org/abs/2209.05232

Recommendations

• Translation of CCS into CSP, correct up to strong bisimulation
• Encoding CSP into CCS
• scientific article; zbMATH DE number 3896316
• scientific article; zbMATH DE number 3911719
• Higher-level synchronising devices in Meije-SCCS

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to bisimulation and coinduction
• On the expressiveness of interaction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Musings on encodings and expressiveness
• CSP is a retract of CCS
• Denotational semantics of channel mobility in UTP-CSP
• Title not available (Why is that?)
• Translation of CCS into CSP, correct up to strong bisimulation

Cited In (1)

• Minimal translations from synchronous communication to synchronizing locks

This page was built for publication: From CCS to CSP: the \(m\)-among-\(n\) synchronisation approach

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