We present the link-calculus, an extension of π-calculus, that models interactions that are multiparty, i.e. that may involve more than two processes, mutually exchanging data. Communications are seen as chains of suitably combined links (which record the source and the target ends of each hop of interactions), each contributed by one party. Values are exchanged by means of message tuples, still provided by each party. We develop semantic theories and proof techniques for link-calculus and apply them in reasoning about complex distributing computing scenarios, where more than two participants need to synchronise in order to perform a task. In particular, we introduce the notion of linked bisimilarity in analogy with the early bisimilarity of the π-calculus. Differently from the π-calculus case, we can show that it is a congruence with respect to all the link-calculus operators and that is also closed under name substitution.

我们提出了链接-演算，是π-演算的扩展，它模拟了多方交互，即可能涉及两个以上的进程，相互交换数据。通讯被视为适当组合的链接链（记录了每一跳交互的源端和目标端），每个链接均由一方提供。通过消息元组交换值，消息元组仍由各方提供。我们开发了用于链接演算的语义理论和证明技术，并将其应用于复杂的分布式计算场景的推理中，其中需要两个以上的参与者进行同步才能执行任务。特别是，我们引入了链接双相似性的概念，类似于π微积分。与π- calculus情况不同，我们可以证明它对于所有链接-calculus运算符都是同余的，并且在名称替换下也是封闭的。