We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for finite bounded Petri nets. The proofs are based on a generalization of the ordered marking proof technique that Vogler used to demonstrate that (strong) fully-concurrent bisimilarity (or, equivalently, historypreserving bisimilarity) is decidable on finite safe nets.

中文翻译：

---

有界Petri网的两个真正并行等价性的可判定性。

我们证明（有限）全并行双相似性和因果网络双相似性对于有限有界Petri网是可确定的。证明是基于有序标记证明技术的概括，Vogler用来证明（有限）完全并行的双相似性（或等效地，保留历史的双相似性）在有限的安全网上是可以确定的。