关于可逆进程演算的可编码性
On the Encodability of Reversible Process Calculi
AI总结:
本文研究可逆进程演算CCSK到经典前向并发模型的编码,证明不存在到CCS或π-演算的基本成功敏感编码,并给出受限情况下的编码及并行保持编码的局限性。
摘要:
可逆性允许程序不仅向前执行,还能向后执行,已成为计算中的一个主要概念,应用范围从调试和容错到生物和量子系统。CCSK是CCS的可逆扩展,是可逆并发计算的典范模型。本文研究了CCSK到经典前向并发模型的可编码性。我们建立了一个分离定理,表明不存在从CCSK到CCS或π-演算的基本成功敏感编码,突出了可逆性对表达能力的影响。然后,我们给出了仅顶层并行组合的CCSK进程到内部π-演算的编码,该编码在强互模拟意义下正确。我们还识别了一个基本限制:没有从CCSK(具有任意并行组合)到π-演算的并行保持编码能在强互模拟意义下正确。最后,我们提供了一个在较弱行为对应(弱互模拟)下正确的并行保持编码。我们的发现将可编码性结果扩展到可逆进程演算。
英文摘要:
Reversibility, allowing one to execute a program not only forwards as usual, but also backwards, has emerged as a fundamental concept in computing, with applications ranging from debugging and fault tolerance to biological and quantum systems. CCSK, a reversible extension of CCS, is a paradigmatic model of reversible concurrent computation. In this paper, we investigate the encodability of CCSK into classical forward-only concurrent models. We establish a separation theorem showing that there is no basic, success-sensitive encoding of CCSK into CCS or the π-calculus, highlighting the strong impact of reversibility on expressive power. We then present an encoding of CCSK processes with only top-level parallel composition into the internal π-calculus, correct up to strong bisimilarity. We also identify a fundamental limitation: no parallel-preserving encoding of CCSK (with arbitrary parallel composition) into the π-calculus can be correct up to strong bisimilarity. Finally, we provide a parallel-preserving encoding correct under a weaker behavioural correspondence: weak mutual simulation. Our findings extend the literature of encodability results to reversible process calculi.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。