Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
复制标题
基本并行过程互模拟等价的可分解性、可判定性和公理化性
DOI：
10.1109/lics.1993.287569
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
F. Moller
中科院分区：
文献类型：
--
作者：
Søren Christensen;Y. Hirshfeld;F. Moller
作者证明了两个子类的递归过程，涉及一个平行的复合算子的互模拟等价，即所谓的赋范和生活过程的可判定性。为了实现这一点，作者首先证明了一个唯一的分解结果（推广）赋范过程，以推导出必要的取消法律。可判定性证明导致这些过程类的完整公理化。<<ETX>>
The authors prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely, the so-called normed and live processes. To accomplish this, the authors first prove a unique decomposition result for (a generalization of) normed processes, in order to deduce a necessary cancellation law. The decidability proof leads to a complete axiomatization for these process classes.<<ETX>>