Opacity of Networked Discrete Event Systems

Opacity is an important information-flow property, which is used to characterize whether or not the secrets of system have been leaked to the intruders. Over the past ten years, opacity of discrete event systems (DESs) modeled as automata and Petri nets have been well investigated under the assumption that the communication channels between systems and intruders are perfect. However, in a shared network, the communication delays and losses are inevitable usually. In this paper, we investigate the problem of opacity of networked discrete event systems (NDESs). We propose the notions of current-state opacity, initial-state opacity, initial-final-state opacity, and infinite-step opacity for NDESs. We also present the verification algorithms for these notions. Some examples are provided to illustrate the results obtained.

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

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

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

[4]  Stéphane Lafortune,et al.  Ensuring Privacy in Location-Based Services: An Approach Based on Opacity Enforcement , 2014, WODES.

[5]  Feng Lin,et al.  Control of Networked Discrete Event Systems: Dealing with Communication Delays and Losses , 2014, SIAM J. Control. Optim..

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

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

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

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

[10]  Philippe Darondeau,et al.  Supervisory Control for Opacity , 2010, IEEE Transactions on Automatic Control.

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

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

[13]  Christoforos N. Hadjicostis,et al.  Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[14]  Feng Lin,et al.  Decentralized opacity of discrete event systems , 2012, 2012 American Control Conference (ACC).

[15]  Christoforos N. Hadjicostis,et al.  Current-State Opacity Formulations in Probabilistic Finite Automata , 2014, IEEE Transactions on Automatic Control.

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

[17]  Silvano Balemi.  Input/output discrete event processes and communication delays , 1994, Discret. Event Dyn. Syst..