Detectability of Discrete Event Systems Under Sensor Attacks  

作　　者：RITSUKA K. LIN Feng LAFORTUNE Stéphane WANG Caisheng 

机构地区：[1]Department of Electrical Engineering and Computer Science,University of Michigan,Ann Arbor,MI 48109,USA [2]Department of Electrical and Computer Engineering,Wayne State University,Detroit,MI 48202 USA

出　　处：《Journal of Systems Science & Complexity》2025年第1期150-177,共28页系统科学与复杂性学报(英文版)

基　　金：supported in part by the US National Science Foundation under Grant Nos.ECCS-2146615 and ECCS-2144416.

摘　　要：The authors consider the property of detectability of discrete event systems in the presence of sensor attacks in the context of cyber-security.The authors model the system using an automaton and study the general notion of detectability where a given set of state pairs needs to be(eventually or periodically)distinguished in any estimate of the state of the system.The authors adopt the ALTER sensor attack model from previous work and formulate four notions of CA-detectability in the context of this attack model based on the following attributes:strong or weak;eventual or periodic.The authors present verification methods for strong CA-detectability and weak CA-detectability.The authors present definitions of strong and weak periodic CA-detectability that are based on the construction of a verifier automaton called the augmented CA-observer.The development also resulted in relaxing assumptions in prior results on D-detectability,which is a special case of CA-detectability.

关 键 词：AUTOMATA cyber attacks DETECTABILITY discrete event systems SECURITY sensor attacks 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]