Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
arXiv:2104.14856 · doi:10.46298/lmcs-19(4:37)2023
Abstract
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.