首页> 外文期刊>Theoretical computer science >Parametric synchronizations in mobile nominal calculi
【24h】

Parametric synchronizations in mobile nominal calculi

机译:移动名义计算中的参数同步

获取原文
获取原文并翻译 | 示例
       

摘要

We present and compare P-PRISMA and F-PRISMA, two parametric calculi that can be instantiated with different interaction policies, defined as synchronization algebras with mobility of names (SAMs). In particular, P-PRISMA is based on name transmission (P-SAM), like π-calculus, and thus exploits directional (input-output) communication only, while F-PRISMA is based on name fusion (F-SAM), like Fusion calculus, and thus exploits a more symmetric form of communication. However, P-PRISMA and F-PRISMA can easily accommodate many other high-level synchronization mechanisms than the basic ones available in π-calculus and Fusion, hence allowing for the development of a general meta-theory of mobile calculi. We define for both the labeled operational semantics and a form of strong bisimilarity, showing that the latter is compositional for any SAM. We also discuss reduction semantics and weak bisimilarity. We give several examples based on heterogeneous SAMs, we investigate the case studies of π-calculus and Fusion calculus giving correspondence theorems, and we show how P-PRISMA can be encoded in F-PRISMA. Finally, we show that basic categorical tools can help to relate and to compose SAMs and PRISMA processes in an elegant way.
机译:我们提出并比较P-PRISMA和F-PRISMA,这两个参数计算可以用不同的交互策略实例化,定义为具有名称移动性的同步代数(SAM)。尤其是,P-PRISMA基于名称传输(P-SAM),例如π演算,因此仅利用定向(输入-输出)通信,而F-PRISMA基于名称融合(F-SAM),例如融合演算,因此利用了更对称的通信形式。但是,P-PRISMA和F-PRISMA可以轻松地容纳除π演算和融合中可用的基本同步机制以外的许多其他高级同步机制,因此允许开发移动计算的通用元理论。我们为标记的操作语义和强相似性定义了一种形式,表明后者对于任何SAM都是组成性的。我们还将讨论归约语义和弱双相似性。我们给出了几个基于异构SAM的示例,我们研究了π演算和Fusion演算的案例研究,给出了对应定理,并展示了如何在F-PRISMA中编码P-PRISMA。最后,我们证明了基本的分类工具可以帮助以优雅的方式关联和组合SAM和PRISMA流程。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号