Matrix Approach for Verification of Opacity of Partially Observed Discrete Event Systems

Opacity is a confidential property characterizing whether the secret of a system can be inferred or not by an outside observer (also called an intruder). This paper focuses on presenting a matrix-based approach for verification of opacity of nondeterministic discrete event systems (DESs). Firstly, the given system is modeled as a finite-state automaton. Further, based on Boolean semi-tensor product (BSTP) of matrices, the algebraic expression of the observable dynamic of the system can be obtained. We, respectively, investigate current-state opacity and K -step opacity owing to the equivalence between a few opacity properties. Finally, necessary and sufficient conditions are presented to verify whether the secret is opaque for a given system, and the proposed methodology is tested effectively by examples. The matrix-based characterization of opacity proposed in this paper may provide a helpful angel for understanding the structure of this property.

[1]  Yiding Ji,et al.  Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions , 2019, IEEE Transactions on Automatic Control.

[2]  Daizhan Cheng,et al.  On finite potential games , 2014, Autom..

[3]  Zhongxin Liu,et al.  Semi-tensor product approach to controllability and stabilizability of finite automata , 2015 .

[4]  Raja Sengupta,et al.  Diagnosability of discrete-event systems , 1995, IEEE Trans. Autom. Control..

[5]  Stéphane Lafortune,et al.  A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems , 2016, IEEE Transactions on Automatic Control.

[6]  Jinde Cao,et al.  Stabilization of Boolean Control Networks Under Aperiodic Sampled-Data Control , 2018, SIAM J. Control. Optim..

[7]  Alessandro Giua,et al.  Current-state opacity enforcement in discrete event systems under incomparable observations , 2018, Discret. Event Dyn. Syst..

[8]  Xiang Yin,et al.  Synthesis of Dynamic Masks for Infinite-Step Opacity , 2020, IEEE Transactions on Automatic Control.

[9]  Min Meng,et al.  Controllability and Observability of Singular Boolean Control Networks , 2015, Circuits Syst. Signal Process..

[10]  Feng Lin,et al.  Maximum Information Release While Ensuring Opacity in Discrete Event Systems , 2015, IEEE Trans Autom. Sci. Eng..

[11]  Stéphane Lafortune,et al.  Enforcing opacity by insertion functions under multiple energy constraints , 2019, Autom..

[12]  Tomás Masopust,et al.  Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems , 2019, Autom..

[13]  Benoît Caillaud,et al.  Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.

[14]  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).

[15]  Christoforos N. Hadjicostis,et al.  Verification of K-step opacity and analysis of its complexity , 2011, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[16]  Hervé Marchand,et al.  Synthesis of opaque systems with static and dynamic masks , 2012, Formal Methods Syst. Des..

[17]  Shaoyuan Li,et al.  Infinite-step opacity and K-step opacity of stochastic discrete-event systems , 2019, Autom..

[18]  Jinde Cao,et al.  The transformation between the Galois NLFSRs and the Fibonacci NLFSRs via semi-tensor product of matrices , 2018, Autom..

[19]  Fuad E. Alsaadi,et al.  Model and Control for a Class of Networked Evolutionary Games with Finite Memories and Time-Varying Networks , 2018, Circuits Syst. Signal Process..

[20]  Zengqiang Chen,et al.  Semi-Tensor Product of Matrices Approach to the Problem of Fault Detection for Discrete Event Systems (DESs) , 2020, IEEE Transactions on Circuits and Systems II: Express Briefs.

[21]  Jianquan Lu,et al.  Pinning Stabilization of Boolean Control Networks via a Minimum Number of Controllers , 2021, IEEE Transactions on Cybernetics.

[22]  Christoforos N. Hadjicostis,et al.  Verification of initial-state opacity in security applications of discrete event systems , 2013, Inf. Sci..

[23]  Stéphane Lafortune,et al.  Synthesis of insertion functions for enforcement of opacity security properties , 2014, Autom..

[24]  Christoforos Keroglou,et al.  Probabilistic system opacity in discrete event systems , 2016, 2016 13th International Workshop on Discrete Event Systems (WODES).

[25]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems, Second Edition , 2008 .

[26]  Yliès Falcone,et al.  Various Notions of Opacity Verified and Enforced at Runtime , 2010 .

[27]  Zhen-Hang Yang,et al.  Sharp bounds for the ratio of two zeta functions , 2020, J. Comput. Appl. Math..

[28]  Jianquan Lu,et al.  Synchronization of drive-response Boolean control networks with impulsive disturbances , 2020, Appl. Math. Comput..

[29]  Bowen Li,et al.  Steady-State Design of Large-Dimensional Boolean Networks , 2020, IEEE Transactions on Neural Networks and Learning Systems.

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

[31]  Hong Yiguang,et al.  Observability analysis and observer design for finite automata via matrix approach , 2013 .

[32]  Laurent Mazare,et al.  Using Unification For Opacity Properties , 2004 .

[33]  Stéphane Lafortune,et al.  Synthesis of Optimal Insertion Functions for Opacity Enforcement , 2016, IEEE Transactions on Automatic Control.

[34]  Jean-Jacques Lesage,et al.  Overview of discrete event systems opacity: Models, validation, and quantification , 2016, Annu. Rev. Control..

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

[36]  Philippe Darondeau,et al.  Enforcing opacity of regular predicates on modal transition systems , 2015, Discret. Event Dyn. Syst..

[37]  Sheldon M. Ross.  Topics in Finite and Discrete Mathematics , 2000 .

[38]  D. Cheng,et al.  Analysis and control of Boolean networks: A semi-tensor product approach , 2010, 2009 7th Asian Control Conference.

[39]  Christoforos N. Hadjicostis,et al.  Verification of Infinite-Step Opacity and Complexity Considerations , 2012, IEEE Transactions on Automatic Control.

[40]  Stéphane Lafortune,et al.  A new approach for the verification of infinite-step and K-step opacity using two-way observers , 2017, Autom..

[41]  Jinde Cao,et al.  Stability and Stabilization in Probability of Probabilistic Boolean Networks , 2021, IEEE Transactions on Neural Networks and Learning Systems.

[42]  Marco Gruteser,et al.  USENIX Association , 1992 .

[43]  Wei Xing Zheng,et al.  Output Feedback Control for Set Stabilization of Boolean Control Networks , 2020, IEEE Transactions on Neural Networks and Learning Systems.

[44]  Stéphane Lafortune,et al.  Comparative analysis of related notions of opacity in centralized and coordinated architectures , 2013, Discret. Event Dyn. Syst..

[45]  Maciej Koutny,et al.  Opacity generalised to transition systems , 2005, International Journal of Information Security.

[46]  Xiang Yin,et al.  Opacity of Nondeterministic Transition Systems: A (Bi)Simulation Relation Approach , 2019, IEEE Transactions on Automatic Control.

[47]  Xiang Yin,et al.  Trajectory detectability of discrete-event systems , 2018, Syst. Control. Lett..

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