过程结石的分离准则
A criterion for separating process calculi
摘要:
我们引入了一个新的标准,替换自由度,来辨别过程结石的相对表达能力。直觉上,如果在封闭的上下文中,用任意进程替换不能执行任何可见动作的进程不会抑制结果进程执行可见动作的能力,那么演算是强替换自由的。我们证明,不存在任何成分和相互作用敏感的编码的不强替换自由演算到任何强替换自由。然后,我们定义了一个较弱的版本的替换自由度,只考虑更换封闭的过程,并证明,如果我们另外需要的编码,以保持名称的独立性,它甚至是不可能的非替换免费演算编码成一个弱替换免费的。由于我们的可编码性结果,我们得到许多配备优先级的演算不是替换自由的,因此不能编码成主流演算,如CCS和pi演算,而是强替换自由的。我们还证明了具有名称匹配、模式匹配或多元同步的pi演算的变体是弱替换自由的,因此它们与具有优先级的进程演算和主流演算是分离的.
英文摘要:
We introduce a new criterion, replacement freeness, to discern the relative expressiveness of process calculi. Intuitively, a calculus is strongly replacement free if replacing, within an enclosing context, a process that cannot perform any visible action by an arbitrary process never inhibits the capability of the resulting process to perform a visible action. We prove that there exists no compositional and interaction sensitive encoding of a not strongly replacement free calculus into any strongly replacement free one. We then define a weaker version of replacement freeness, by only considering replacement of closed processes, and prove that, if we additionally require the encoding to preserve name independence, it is not even possible to encode a non replacement free calculus into a weakly replacement free one. As a consequence of our encodability results, we get that many calculi equipped with priority are not replacement free and hence are not encodable into mainstream calculi like CCS and pi-calculus, that instead are strongly replacement free. We also prove that variants of pi-calculus with match among names, pattern matching or polyadic synchronization are only weakly replacement free, hence they are separated both from process calculi with priority and from mainstream calculi.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。