Deciding Detectability for Labeled Petri Nets

Detectability of discrete event systems (DESs) is a property to determine a priori whether the current and subsequent states can be determined based on observations. In this paper, we investigate the verification of two detectability properties -- strong detectability and weak detectability -- for DESs modeled by labeled Petri nets. Strong detectability requires that we can always determine, after a finite number of observations, the current and subsequent markings of the system, while weak detectability requires that we can determine, after a finite number of observations, the current and subsequent markings for some trajectories of the system. We show that for DESs modeled by labeled Petri nets, checking strong detectability is decidable whereas checking weak detectability is undecidable. Our results extend the existing studies on the verification of detectability from finite-state automata to labeled Petri nets. As a consequence, we strengthen a result on checking current-state opacity for labeled Petri nets.

[1]  Walter Ukovich,et al.  On-line fault detection in discrete event systems by Petri nets and integer linear programming , 2009, Autom..

[2]  Francesco Basile,et al.  State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions , 2015, IEEE Transactions on Automatic Control.

[3]  A. Willsky,et al.  Observability of discrete event dynamic systems , 1990 .

[4]  Xiang Yin,et al.  Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures , 2017, Autom..

[5]  Christoforos N. Hadjicostis,et al.  Sensor Selection for Structural Observability in Discrete Event Systems Modeled by Petri Nets , 2010, IEEE Trans. Autom. Control..

[6]  Alessandro Giua,et al.  A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets , 2012, IEEE Transactions on Automatic Control.

[7]  Feng Lin,et al.  Delayed Detectability of Discrete Event Systems , 2013, IEEE Transactions on Automatic Control.

[8]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[9]  Christoforos Keroglou,et al.  Detectability in stochastic discrete event systems , 2015, Syst. Control. Lett..

[10]  Stéphane Lafortune,et al.  On the Decidability and Complexity of Diagnosability for Labeled Petri Nets , 2017, IEEE Transactions on Automatic Control.

[11]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[12]  Antonio Ramírez-Treviño,et al.  Observability of discrete event systems modeled by interpreted Petri nets , 2003, IEEE Trans. Robotics Autom..

[13]  Alessandro Giua,et al.  Observability of place/transition nets , 2002, IEEE Trans. Autom. Control..

[14]  Alessandro Giua,et al.  Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs , 2018 .

[15]  Alessandro Giua,et al.  Decidability of opacity verification problems in labeled Petri net systems , 2017, Autom..

[16]  Feng Lin,et al.  Generalized detectability for discrete event systems , 2011, Syst. Control. Lett..

[17]  Xiang Yin.  Verification of Prognosability for Labeled Petri Nets , 2018, IEEE Transactions on Automatic Control.

[18]  P. Ramadge.  Observability of discrete event systems , 1986, 1986 25th IEEE Conference on Decision and Control.

[19]  Christoforos Keroglou,et al.  Verification of detectability in Probabilistic Finite Automata , 2017, Autom..

[20]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[21]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[22]  Kuize Zhang,et al.  The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete , 2017, Autom..

[23]  Alessandro Giua,et al.  On the Equivalence of Observation Structures for Petri Net Generators , 2016, IEEE Transactions on Automatic Control.

[24]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[25]  Mohamed Faouzi Atig,et al.  On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..

[26]  Christoforos N. Hadjicostis,et al.  Marking Observer in Labeled Petri Nets With Application to Supervisory Control , 2017, IEEE Transactions on Automatic Control.

[27]  Tomás Masopust,et al.  Complexity of Deciding Detectability in Discrete Event Systems , 2017, Autom..

[28]  Feng Lin,et al.  Detectability of Discrete Event Systems , 2007, IEEE Transactions on Automatic Control.

[29]  Stéphane Lafortune,et al.  Verification complexity of a class of observational properties for modular discrete events systems , 2017, Autom..

[30]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.