Secret inference and attacktability analysis of discrete event systems

DOI10.1016/J.INS.2022.07.028MaRDI QIDQ6122243zbMATH OpenFDO

Authors Salwa Habbachi, Amal Zaghdoud, Zhiwu Li, NaiQi Wu, Mohamed Salah Khalgui

Publication date 27 March 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.07.028

zbMATH Keywords

active intruderattacktabiitydiscrete event systemopacity

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65)

Recommendations

• Active opacity of discrete-event systems
• Verifying weak and strong \(k\)-step opacity in discrete-event systems
• Verification of K-step and infinite-step opacity of bounded labeled Petri nets
• On-line verification of current-state opacity by Petri nets and integer linear programming

Cites work

• \(k\)-memory-embedded insertion mechanism for opacity enforcement
• Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
• Concurrent secrets
• Embedded Insertion Functions for Opacity Enforcement
• Opacity Enforcement Using Nondeterministic Publicly Known Edit Functions
• Opacity of discrete event systems and its applications
• Supervisor synthesis to thwart cyber attack with bounded sensor reading alterations
• Supervisory control of discrete-event systems under attacks
• Supervisory control of discrete-event systems under external attacks
• Synthesis of insertion functions for enforcement of opacity security properties

Cited in

(1)

• Obfuscation mechanism for simultaneous public event information release and private event information hiding in discrete event systems

This page was built for publication: Secret inference and attacktability analysis of discrete event systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122243)