图灵完备分布式计算模型的可判定等价性
A Decidable Equivalence for a Turing-complete, Distributed Model of Computation
摘要：
带有抑制弧的Place/Transition Petri网（简称PTI网）是一种著名的图灵完备的分布式计算模型，它具有一个可判定的行为等价性，称为pti-Place双相似性，它保守地扩展了Place/Transition网（不含抑制弧）上定义的Place双相似性。我们证明了pti-位置双相似性是合理的，因为它尊重PTI网的因果语义。
英文摘要：
Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that conservatively extends place bisimilarity defined over Place/Transition nets (without inhibitor arcs). We prove that pti-place bisimilarity is sensible, as it respects the causal semantics of PTI nets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
