On Periodic Detectability of Probabilistic Boolean Networks

In this paper, we investigate verification of periodic detectability for probabilistic Boolean networks (PBNs) from a brand-new angle. First, the dynamics of a PBN is converted equivalently into a stochastic automaton in the framework of semi-tensor product (STP) theory. Using the previously-proposed observer-based approach in the literature, the necessary and sufficient condition is presented to verify whether a PBN is strongly (resp., weakly) periodically detectable or not. Second, to avoid graph-based symbolic manipulations, we further propose the matrix-based verification criteria that are numerically tractable for the aforementioned two types of periodic detectability. Finally, several examples modeled by the same PBN are provided to instantiate the corresponding theoretical results.

[1]  Christoforos Keroglou,et al.  Detectability in Stochastic Discrete Event Systems , 2014, WODES.

[2]  Xiaoguang Han,et al.  Matrix approach to detectability of discrete event systems under partial observation , 2017, 2017 13th IEEE Conference on Automation Science and Engineering (CASE).

[3]  Lijun Zhang,et al.  Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata , 2014, IEEE Transactions on Automatic Control.

[4]  Ettore Fornasini,et al.  Observability, Reconstructibility and State Observers of Boolean Control Networks , 2013, IEEE Transactions on Automatic Control.

[5]  W. Feng,et al.  observability ? , 2013 .

[6]  Lin Feng,et al.  Detectability measure on state estimation of discrete event systems , 2016, 2016 35th Chinese Control Conference (CCC).

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

[8]  Yiguang Hong,et al.  Matrix expression and reachability analysis of finite automata , 2012 .

[9]  Zhipeng Zhang,et al.  Modeling and reachability of probabilistic finite automata based on semi-tensor product of matrices , 2018, Science China Information Sciences.

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

[11]  Daizhan Cheng,et al.  On controllability and stabilizability of probabilistic Boolean control networks , 2012, Science China Information Sciences.

[12]  Yang Liu,et al.  Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems , 2017 .

[13]  Daizhan Cheng,et al.  A Linear Representation of Dynamics of Boolean Networks , 2010, IEEE Transactions on Automatic Control.

[14]  D. Cheng,et al.  An Introduction to Semi-Tensor Product of Matrices and Its Applications , 2012 .

[15]  Daizhan Cheng,et al.  Controllability and observability of Boolean control networks , 2009, Autom..

[16]  Rong Su,et al.  Synthesis of minimally restrictive optimal stability-enforcing supervisors for nondeterministic discrete event systems , 2019, Syst. Control. Lett..

[17]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

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

[19]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.