A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems
From MaRDI portal
Publication:5358523
DOI10.1109/TCNS.2016.2573741zbMath1370.94620OpenAlexW2405143843MaRDI QIDQ5358523
Bruno Sinopoli, Sean Weerakkody, Xiaofei Liu, 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
Deterministic network models in operations research (90B10) System identification (93B30) Applications of design theory to circuits and networks (94C30)
Related Items (7)
An overview of structural systems theory ⋮ 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 ⋮ Maximizing the coverage of roadmap graph for optimal motion planning ⋮ Strategic sensor placement on graphs ⋮ Resilient synchronization of distributed multi-agent systems under attacks
This page was built for publication: A Graph-Theoretic Characterization of Perfect Attackability for Secure Design of Distributed Control Systems
