Opacity formulations and verification in discrete event systems

In many emerging security applications, a property of a system, that may reveal important details about its behaviour, needs to be kept secret (opaque) to outside observers (intruders). Motivated by such applications, several authors have formalized, analyzed, and described methods to verify notions of opacity in discrete event systems of interest. This paper offers a review of various definitions of opacity, along with methodologies for their verification and complexity analysis. We review state-based notions of opacity (namely, current-state opacity and initial-state opacity) in non-deterministic finite automata, as well as their extensions to stochastic settings. Specifically, we discuss these notions of opacity and methods to verify them in discrete event systems modeled by non-deterministic finite automata (NFA's) or probabilistic finite automata (PFA's).

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

[2]  J. Todd Wittbold,et al.  Information flow in nondeterministic systems , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

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

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

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

[6]  Hervé Marchand,et al.  Dynamic Observers for the Synthesis of Opaque Systems , 2009, ATVA.

[7]  Maciej Koutny,et al.  Modelling Dynamic Opacity Using Petri Nets with Silent Actions , 2004, Formal Aspects in Security and Trust.

[8]  Ratnesh Kumar,et al.  A probabilistic language formalism for stochastic discrete-event systems , 1999, IEEE Trans. Autom. Control..

[9]  Anooshiravan Saboori,et al.  Coverage analysis of mobile agent trajectory via state-based opacity formulations☆ , 2011 .

[10]  Feng Lin,et al.  Opacity of discrete event systems and its applications , 2011, Autom..

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

[12]  P. Darondeau,et al.  Opacity enforcing control synthesis , 2008, 2008 9th International Workshop on Discrete Event Systems.

[13]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

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

[15]  David Lee,et al.  Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[16]  Roberto Gorrieri,et al.  A taxonomy of trace-based security properties for CCS , 1994, Proceedings The Computer Security Foundations Workshop VII.

[17]  宮沢 政清,et al.  P. Bremaud 著, Markov Chains, (Gibbs fields, Monte Carlo simulation and Queues), Springer-Verlag, 1999年 , 2000 .

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

[19]  Christoforos Keroglou,et al.  Initial state opacity in stochastic DES , 2013, 2013 IEEE 18th Conference on Emerging Technologies & Factory Automation (ETFA).

[20]  Frederick C. Hennie,et al.  Finite-state Models for Logical Machines , 1968 .

[21]  Stéphane Lafortune,et al.  An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions , 2007, Syst. Control. Lett..

[22]  Mathieu Sassolas,et al.  Quantifying Opacity , 2010, QEST.

[23]  C. N. Hadjicostis,et al.  Resolution of initial-state in security applications of DES , 2012, 2012 20th Mediterranean Conference on Control & Automation (MED).

[24]  Jonathan K. Millen,et al.  Covert Channel Capacity , 1987, 1987 IEEE Symposium on Security and Privacy.

[25]  Alan S. Willsky,et al.  Mathematics of Control, Signals, and Systems Invertibility of Discrete-event Dynamic Systems* , 2022 .

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

[27]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[28]  Anooshiravan Saboori,et al.  Verification and enforcement of state-based notions of opacity in discrete event systems , 2010 .

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

[30]  Maciej Koutny,et al.  Opacity Generalised to Transition Systems , 2005, Formal Aspects in Security and Trust.

[31]  Christoforos N. Hadjicostis,et al.  Verification of $K$-Step Opacity and Analysis of Its Complexity , 2009, IEEE Transactions on Automation Science and Engineering.

[32]  Sanjeev R. Kulkarni,et al.  Nonparametric output prediction for nonlinear fading memory systems , 1999, IEEE Trans. Autom. Control..

[33]  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.

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