Abstract
In Chap. 10.1007/978-3-030-25972-3_9, we studied the verification and complexity problem of the notions of strong detectability and weak detectability for finite-state automata. In this chapter, we characterize these notions for labeled Petri nets (see Sect. 10.1007/978-3-030-25972-3_2).