参数化高阶过程双相似性的可判定性
On Decidability of the Bisimilarity on Higher-order Processes with Parameterization
摘要:
具有参数化的高阶过程能够抽象和应用(从微积分迁移而来),因此在计算上更具表现力。对于最小高阶并发性,众所周知,强双相似性(即,强互模拟相等)在没有参数化的情况下是可判定的。相比之下,对于参数化高阶过程,强双相似性是否仍然是可判定的仍然不清楚。在本文中,我们关注这个问题。基本上有两种参数化:一种是关于名称,另一种是关于进程。我们表明,强双相似性确实是可判定的高阶过程配备了这两种参数化。然后,我们展示了如何适应的决策方法来建立一个公理系统的强双相似性。在这些结果的基础上,我们提供了一个算法的双相似性检查。
英文摘要:
Higher-order processes with parameterization are capable of abstraction and application (migrated from the lambda-calculus), and thus are computationally more expressive. For the minimal higher-order concurrency, it is well-known that the strong bisimilarity (i.e., the strong bisimulation equality) is decidable in absence of parameterization. By contrast, whether the strong bisimilarity is still decidable for parameterized higher-order processes remains unclear. In this paper, we focus on this issue. There are basically two kinds of parameterization: one on names and the other on processes. We show that the strong bisimilarity is indeed decidable for higher-order processes equipped with both kinds of parameterization. Then we demonstrate how to adapt the decision approach to build an axiom system for the strong bisimilarity. On top of these results, we provide an algorithm for the bisimilarity checking.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。