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.

中文翻译：

---

图灵完备的分布式计算模型的可判定等价

具有抑制弧的Place / Transition Petri网（简称PTI网）是众所周知的图灵完备的分布式计算模型，配有可判定的行为等价性，称为pti-place双相似性，可保守地扩展Place双相似性在放置/过渡网（没有抑制弧）上定义。我们证明pti-place双相似性是明智的，因为它尊重PTI网络的因果语义。