Identification of Deletion Attacks in Discrete-Event Systems Through Petri Nets Enhanced With an Observation Structure

This article presents a novel approach for identifying deletion attacks in discrete-event systems modeled using Petri nets, with a particular emphasis on sensor attacks that corrupt state estimation and supervisory control by removing transition occurrences from observable sequences. The methodology encompasses three key innovations: the development of a new observation structure for modeling deletion attacks within Petri nets, the construction of an extended reachability graph that allows for negative marking components, and the formulation of an integer linear programming model to compute observation places for deletion attack identification. The proposed framework enables precise identification of deletion attacks through token quantification in designated observation places. Experimental validation and comparative analysis demonstrate superior identification accuracy and resilience compared with the existing methodologies, representing a significant contribution to the reliability and security of discrete-event systems.