Revelation Time for Initial-State Opacity Measurement in Timed Discrete Event Systems

The reliance of many emerging applications on shared cyber-infrastructures has prompted the study of various notions for security and privacy, including notions for deterministic, non-deterministic, and probabilistic systems. The main contribution of this work is to extend these ideas to timed stochastic systems, by introducing and analyzing timing aspects of initial-state opacity, as measures of vulnerability to security violations. More specifically, we consider partially observed stochastic Petri net (POSPN) models that behave according to Markovian dynamics. We assume that certain events are observable to an outside observer (intruder) and we are interested in initial-state opacity, i.e., determining whether an intruder can infer that the initial marking of the system necessarily lies within a given secret set of initial states. In case initial-state opacity is violated for some behavior in the system, we are also interested in knowing how much time the system remains safe before this violation occurs.

[1]  Kishor S. Trivedi,et al.  Recent Developments in Non-Markovian Stochastic Petri Nets , 1998, J. Circuits Syst. Comput..

[2]  A. Saboori,et al.  Verification of initial-state opacity in security applications of DES , 2008, 2008 9th International Workshop on Discrete Event Systems.

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

[4]  Christoforos N. Hadjicostis,et al.  Fault Diagnosis in Discrete Event Systems Modeled by Partially Observed Petri Nets , 2009, Discret. Event Dyn. Syst..

[5]  Christoforos N. Hadjicostis,et al.  Least-Cost Transition Firing Sequence Estimation in Labeled Petri Nets With Unobservable Transitions , 2011, IEEE Transactions on Automation Science and Engineering.

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

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

[8]  Dimitri Lefebvre,et al.  Trajectory-observers of timed stochastic discrete event systems: Applications to privacy analysis , 2019, 2019 6th International Conference on Control, Decision and Information Technologies (CoDIT).

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

[10]  Alessandro Giua,et al.  Verification of State-Based Opacity Using Petri Nets , 2017, IEEE Transactions on Automatic Control.

[11]  Christoforos N. Hadjicostis,et al.  Initial marking estimation in labeled Petri nets in a probabilistic setting , 2014, 53rd IEEE Conference on Decision and Control.

[12]  Peter Y. A. Ryan,et al.  Opacity - Further Insights on an Information Flow Property , 2006 .

[13]  D. Lefebvre Approximation of the asymptotic mean marking of SPNs with contPNs , 2012 .

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

[15]  Dimitri Lefebvre Fault Diagnosis and Prognosis With Partially Observed Petri Nets , 2014, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[16]  Christoforos N. Hadjicostis,et al.  Minimum initial marking estimation in labeled Petri nets , 2009, ACC.

[17]  Dimitri Lefebvre,et al.  Exposure Time as a Measure of Opacity in Timed Discrete Event Systems , 2019, 2019 18th European Control Conference (ECC).

[18]  Michael K. Molloy Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

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

[20]  Michel Diaz,et al.  Petri Nets: Fundamental Models, Verification and Applications , 2009 .