A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems

DOI10.1109/TCNS.2016.2573741MaRDI QIDQ5358523zbMATH OpenOpenAlexFDO

Authors Sean Weerakkody, Xiaofei Liu, Bruno Sinopoli, Sang Hyuk Son

Publication date 21 September 2017

Published in IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcns.2016.2573741

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) System identification (93B30) Applications of design theory to circuits and networks (94C30)

Cited in

(8)

• Maximizing the coverage of roadmap graph for optimal motion planning
• An overview of structural systems theory
• Strategic sensor placement on graphs
• Resilient synchronization of distributed multi-agent systems under attacks
• Security index based on perfectly undetectable attacks: graph-theoretic conditions
• Distributed control under compromised measurements: resilient estimation, attack detection, and vehicle platooning
• Resilience to denial-of-service and integrity attacks: a structured systems approach
• Covert attack detection for cyber-physical systems using input-associated watermarking mechanism

This page was built for publication: A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems

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