  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.
