Encoding CSP into CCS

Encoding CSP into CCS
复制标题

DOI:
10.4204/eptcs.190.5
复制
发表时间:
2015-08
期刊:
--
影响因子:
--
通讯作者:
Meike Hatzel;Christopher Wagner;Kirstin Peters;U. Nestmann
Meike Hatzel;Christopher Wagner;Kirstin Peters;U. Nestmann
中科院分区:
其他
文献类型:
--
作者:
Meike Hatzel;Christopher Wagner;Kirstin Peters;U. Nestmann

文献摘要

被引文献

相似文献

我们研究了从CSP到异步CCS的编码,以及名称传递和匹配,因此实际上是异步pi演算。通过这样做,我们讨论了两种不同的方式来映射CSP的多路同步机制到CCS的双向同步机制。除了组合性之外,这两种编码都满足Gorla的标准,因为它们都使用了额外的顶级上下文。在Parrow和Sj“odin的工作之后,第一种编码使用集中式协调器,并在源术语和它们的翻译之间建立弱双相似性的变体。第二种编码是去中心化的,因此更有效,但只确保源项及其翻译之间的耦合相似性。
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.