We prove that the well-known (strong) fully-concurrent bisimilarity and the novel i-causal-net bisimilarity, which is a sligtlhy coarser variant of 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, history-preserving bisimilarity) is decidable on finite safe nets.

翻译：我们证明著名的（强）全并发互模拟及新颖的i-因果网互模拟（一种比因果网互模拟稍粗的变体）对于有限有界Petri网是可判定的。证明基于Vogler用于论证（强）全并发互模拟（或等价地，历史保持互模拟）在有限安全网上可判定时所用的有序标记证明技术的一般化。