Exposure and Revelation Times as a Measure of Opacity in Timed Stochastic Discrete Event Systems

被引:7
|
作者
Lefebvre, Dimitri [1 ]
Hadjicostis, Christoforos N. [2 ]
机构
[1] Univ Le Havre Normandie, GREAH Lab, F-76600 Le Havre, France
[2] Univ Cyprus, Dept Elect & Comp Engn, CY-1678 Nicosia, Cyprus
关键词
Firing; Petri nets; Observers; Probabilistic logic; Security; Markov processes; Timing; Discrete-event systems; privacy; stochastic processes; INFINITE-STEP OPACITY; DETECTABILITY; VERIFICATION; MARKING;
D O I
10.1109/TAC.2020.3044853
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Opacity is a security notion that focuses on determining whether a given system's behavior is kept secret to intruders. Various notions of opacity have received significant attention during the last decade including current state opacity and initial state opacity, which have been studied for deterministic and probabilistic systems in untimed contexts. In timed systems, opacity requirements may vary with time and one could also be interested in knowing the time duration for which opacity requirements are violated or preserved. The main contribution of this article is to introduce and analyze opacity exposure and opacity revelation times as measures of vulnerability in timed discrete event system (DES) that behave according to Markovian dynamics (i.e., at any given time, all enabled events are independent and distributed in time with exponential probability density functions). Labeled stochastic Petri nets (LSPNs) are used to model timed stochastic DESs, and appropriate constructions (involving current and initial state observers) are used to evaluate exposure and revelation times for a given LSPN.
引用
收藏
页码:5802 / 5815
页数:14
相关论文
共 50 条
  • [41] On the verification of detectability for timed discrete event systems
    Dong, Weijie
    Zhang, Kuize
    Li, Shaoyuan
    Yin, Xiang
    AUTOMATICA, 2024, 164
  • [42] Transformations between opacity for discrete-event systems
    Chu, Qian
    Wei, Jiawei
    Han, Xiaoguang
    Li, Zhiwu
    Chen, Zengqiang
    2022 41ST CHINESE CONTROL CONFERENCE (CCC), 2022, : 1611 - 1616
  • [43] Comparing the notions of opacity for discrete-event systems
    Jiří Balun
    Tomáš Masopust
    Discrete Event Dynamic Systems, 2021, 31 : 553 - 582
  • [44] Opacity of Discrete Event Systems: models, validation and quantification
    Jacob, Romain
    Lesage, Jean-Jacques
    Faure, Jean-Marc
    IFAC PAPERSONLINE, 2015, 48 (07): : 174 - 181
  • [45] Polynomial Algorithms to Check Opacity in Discrete Event Systems
    Zhang, Bo
    Shu, Shaolong
    Lin, Feng
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 763 - 769
  • [46] Local Opacity Verification for Distributed Discrete Event Systems
    Pruekprasert, Sasinee
    Cai, Kai
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 7022 - 7027
  • [47] Comparing the notions of opacity for discrete-event systems
    Balun, Jiri
    Masopust, Tomas
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2021, 31 (04): : 553 - 582
  • [48] Supervisory Control of Timed Networked Discrete Event Systems
    Alves, Marcos V. S.
    Carvalho, Lilian K.
    Basilio, Joao C.
    2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2017,
  • [49] Supervision Localization of Timed Discrete-Event Systems
    Cai, Kai
    Zhang, Renyuan
    Wonham, W. M.
    2013 AMERICAN CONTROL CONFERENCE (ACC), 2013, : 5666 - 5671
  • [50] Decentralized Supervisory Control of Timed Discrete Event Systems
    Nomura, Masashi
    Takai, Shigemasa
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (12) : 2802 - 2809