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 网是可分辨的。 证据基于对Vogler用来证明(坚固)完全顺畅的两样(或类似历史保存两样)在有限安全网上可分辨的定购标记证明技术的概括化。