Security index based on perfectly undetectable attacks: graph-theoretic conditions

DOI10.1016/j.automatica.2021.109925zbMath1478.93242OpenAlexW3202741515MaRDI QIDQ2665727

Henrik Sandberg, Sebin Gracy, Jezdimir Milošević

Publication date: 19 November 2021

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2021.109925

Mathematics Subject Classification ID

Applications of graph theory (05C90) Control/observation systems involving computers (process control, etc.) (93C83) Computer security (68M25) Networked control (93B70)

Related Items (1)

A graph-oriented approach to address generically flat outputs in structured LTI discrete-time systems

Cites Work

• Unnamed Item
• Generic properties and control of linear structured systems: A survey
• Detection and mitigation of biasing attacks on distributed estimation networks
• Linear system security -- detection and correction of adversarial sensor attacks in the noise-free case
• Data-injection attacks in stochastic control systems: detectability and performance tradeoffs
• Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
• Ranks of zero patterns and sign patterns^*
• The Generic Number of Invariant Zeros of a Structured Linear System
• Actuator Security Indices Based on Perfect Undetectability: Computation, Robustness, and Sensor Placement
• Input and State Observability of Network Systems With Time-Varying Topology
• Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
• Consensus Computation in Unreliable Networks: A System Theoretic Approach
• A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Uniquely restricted matchings

This page was built for publication: Security index based on perfectly undetectable attacks: graph-theoretic conditions