arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.04854cs.LO
收藏

论联接的表现力

On the Expressiveness of Joining

Thomas Given-Wilson, Axel Legay

摘要:

通信原语的表达性已经在一个基于π演算的公共框架中进行了探索,考虑了四个特征:同步性(异步与同步),arity(一元与多元数据),通信介质(共享数据空间与基于通道)和模式匹配(绑定到名称与测试名称相等性与意图性)。这里考虑另一个维度协调,它说明发生交互所需的过程数量。协调将二进制语言(如pi演算)推广到结合输入的连接语言(如Join Calculus和一般会合演算)。本文通过可能性/不可能性的编码,说明了协调性与其他特征无关。也就是说,连接语言比二进制语言更具表达力,并且没有其他特征的组合可以将连接语言编码为二进制语言。此外,接合不能编码任何其他特征,除非它们可以以其他方式编码。

英文摘要:

The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium (shared dataspaces vs channel-based), and pattern-matching (binding to a name vs testing name equality vs intensionality). Here another dimension coordination is considered that accounts for the number of processes required for an interaction to occur. Coordination generalises binary languages such as pi-calculus to joining languages that combine inputs such as the Join Calculus and general rendezvous calculus. By means of possibility/impossibility of encodings, this paper shows coordination is unrelated to the other features. That is, joining languages are more expressive than binary languages, and no combination of the other features can encode a joining language into a binary language. Further, joining is not able to encode any of the other features unless they could be encoded otherwise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑