PSI-Calculi：一个具有名义数据和逻辑的移动过程框架
Psi-calculi: a framework for mobile processes with nominal data and logic
摘要：
psi演算的框架扩展了pi演算的数据结构和逻辑断言和条件的名义数据表。它们可以在进程之间传输，并且它们的名称可以像标准pi演算中那样静态地作用域。Psi演算可以捕获与其他提出的pi演算扩展相同的现象，例如应用pi演算，spi演算，融合演算，并发约束pi演算，以及具有多元通信信道或模式匹配的演算。PSI演算甚至可以更通用，例如允许结构化通道，高阶形式主义，如用于数据结构的λ演算，以及用于断言的谓词逻辑。我们提供了充分的比较，相关的结石，并讨论了一些重要的应用。我们标记的操作语义和互模拟的定义是直接的，没有结构一致性。我们建立最低要求的名义数据和逻辑，以证明一般代数性质的PSI演算，所有这些都已检查的互动定理证明伊莎贝尔。PSI演算的表达性明显超过其他形式主义，而语义的纯度与原始的PI演算相当。
英文摘要：
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. Psi-calculi can capture the same phenomena as other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and predicate logic for assertions. We provide ample comparisons to related calculi and discuss a few significant applications. Our labelled operational semantics and definition of bisimulation is straightforward, without a structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi, all of which have been checked in the interactive theorem prover Isabelle. Expressiveness of psi-calculi significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
