Comparing the expressive power of the synchronous and the asynchronous π-calculus
Comparing the expressive power of the synchronous and the asynchronous π-calculus
复制标题
DOI：
10.1145/263699.263731
复制
发表时间：
1998-09
期刊：
影响因子：
--
通讯作者：
C. Palamidessi
中科院分区：
文献类型：
--
作者：
C. Palamidessi
异步» -Boudol最近提出的Calculus以及本田和Tokoro独立提出的，是„的子集-Alculus不包含选择和输出预定的显式操作员，但是，该微积分的通信机制足以模拟boudol的输出预定，而输入式选择的选择，如Nestmann和Pierce最近所示因此，出现了一个自然的问题，那么是否可以嵌入完整的问题。 -Calculus。 - 钙孔进入异步» - 钙库，直到任何“合理”对等概念。 - 打破某些对称性的钙可能通过类似的参数中存在。 -Calculus和CCS。
The Asynchronous ¿-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the ¿-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Boudol, and input-guarded choice, as shown recently by Nestmann and Pierce. A natural question arises, then, whether or not it is possible to embed in it the full ¿-calculus. We show that this is not possible, i.e. there does not exist any uniform, parallel-preserving, translation from the ¿-calculus into the asynchronous ¿-calculus, up to any "reasonable" notion of equivalence. This result is based on the incapablity of the asynchronous ¿-calculus of breaking certain symmetries possibly present in the initial communication graph. By similar arguments, we prove a separation result between the ¿-calculus and CCS.