Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099)

The aim of this note is twofold. Firstly, it shows that the undecidability result for bisimilarity in [the author, ibid. 148, No. 2, 281-301 (1985; Zbl 0873.68147)] can be immediately extended for the whole range of equivalences (and preorders) on labelled Petri nets. Secondly, it shows that restricting our attention to nets with finite reachable space, the respective (decidable) problems are nonprimitive recursive; this approach also applies to \textit{E. W. Mayr} and \textit{A. R. Meyer}'s result [J. Assoc. Comput. Mach. 28, 561-576 (1981; Zbl 0462.68020)] for the reachability set equality, yielding a more direct proof.