Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets

04/30/2021

∙

by   Arnaldo Cesco, et al.

∙

0

∙

share

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.