Encoding CSP into CCS

TL;DR

This paper explores two methods to encode CSP's multi-way synchronization into CCS's two-way synchronization, analyzing their correctness and efficiency, with one being centralized and the other decentralized.

Contribution

It introduces two novel encodings of CSP into asynchronous CCS, comparing their correctness, efficiency, and similarity measures, and discusses the implications of centralized versus decentralized approaches.

Findings

The centralized encoding uses a top-level coordinator and weak bisimilarity.

The decentralized encoding is more efficient and ensures coupled similarity.

Both encodings satisfy Gorla's criteria except for compositionality.

Abstract

We study encodings from CSP into asynchronous CCS with name passing and matching, so in fact, the asynchronous pi-calculus. By doing so, we discuss two different ways to map the multi-way synchronisation mechanism of CSP into the two-way synchronisation mechanism of CCS. Both encodings satisfy the criteria of Gorla except for compositionality, as both use an additional top-level context. Following the work of Parrow and Sj\"odin, the first encoding uses a centralised coordinator and establishes a variant of weak bisimilarity between source terms and their translations. The second encoding is decentralised, and thus more efficient, but ensures only a form of coupled similarity between source terms and their translations.