比较$π$ -演算和CCS的表达性
Comparing the expressiveness of the $π$-calculus and CCS
摘要：
本文表明，$π$ -演算与隐式匹配是没有更多的表现力比CCS $γ$，CCS的一个变种，其中两个动作的同步的结果本身是一个行动受到重新标记或限制，而不是沉默的行动$τ$。这是通过展示从$π$ -演算到CCS $γ$的隐式匹配的组合翻译来完成的，该组合翻译直到强倒钩双相似性都是有效的。完整的$π$ -演算可以类似地表示在富含Meije触发操作的CCS $γ$中。我还表明，这些结果不能与CCS的CCS $γ$的作用，甚至没有减少等价，甚至不为异步$π$ -演算没有限制或复制。最后，我观察到CCS不能被编码在$π$ -演算中。
英文摘要：
This paper shows that the $π$-calculus with implicit matching is no more expressive than CCS$γ$, a variant of CCS in which the result of a synchronisation of two actions is itself an action subject to relabelling or restriction, rather than the silent action $τ$. This is done by exhibiting a compositional translation from the $π$-calculus with implicit matching to CCS$γ$ that is valid up to strong barbed bisimilarity. The full $π$-calculus can be similarly expressed in CCS$γ$ enriched with the triggering operation of Meije. I also show that these results cannot be recreated with CCS in the role of CCS$γ$, not even up to reduction equivalence, and not even for the asynchronous $π$-calculus without restriction or replication. Finally I observe that CCS cannot be encoded in the $π$-calculus.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
