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

MaRDI QIDQ6190868zbMATH OpenFDO

Authors Gerard Ekembe Ngondi, Vasileios Koutavas, Andrew Butterfield

Publication date 6 February 2024

Full work available at URL https://arxiv.org/abs/2209.05232, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?EXPSOS22.4

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 7449992 (Why is no real title available?)
• scientific article; zbMATH DE number 3817027 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1418456 (Why is no real title available?)
• CSP is a retract of CCS
• Denotational semantics of channel mobility in UTP-CSP
• Introduction to bisimulation and coinduction
• Musings on encodings and expressiveness
• On the expressiveness of interaction
• 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)