Answers are grounded in this paper and cite their sources.
Recently, a fragment of the π-calculus, named Cπ-calculus, has been introduced as a model for confidential name passing in concurrent systems. The key feature of the Cπ-calculus is disabling forwarding in name passing. It has been shown that even being a fragment of the πcalculus, it is possible to recover the full π-expressivity in this fragment. This was done via an encoding of π-processes into the Cπ-processes and showing that such an encoding satisfies some desired properties. However, one property this encoding does not satisfy is compositionality. In this paper, we propose a new encoding that satisfies this property. We evaluate the encoding with an example and leave the proof of operational correspondence for future work.
No takes yet. Share an insight, caveat, or question.
Ivan Prokić (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: