@inproceedings{2c1acaef4f38431999a518dd2e031642,
title = "Recovering Structural Controllability on Erd{\"o}s-R{\'e}nyi Graphs in the Presence of Compromised Nodes",
abstract = " Large-scale distributed control systems such as those encountered in electric power networks or industrial control systems must be assumed to be vulnerable to attacks in which adversaries can take over control over at least part of the control network by compromising a subset of nodes. In this paper we study Structural Controllability properties of the control graph in LTI systems, addressing the question of how to efficiently re-construct a control graph as far as possible in the presence of such compromised nodes. We study the case of sparse Erd{\"o}os-R{\'e}nyi Graphs with directed control edges and seek to provide an approximation of an efficient reconstructed control graph while minimising control graph diameter. The approach is based on a BLOCK DECOMPOSITION of a directed graph, allowing to identify cut-vertices and cut-edges, that result in faster re-construction of PDS structure, and ultimately the regaining of control for operators of control systems by applying three phases.",
author = "Bader Alwasel and Stephen Wolthusen",
year = "2016",
month = may,
day = "18",
doi = "10.1007/978-3-319-33331-1_9",
language = "English",
volume = "9578",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "105--119",
booktitle = "Proceedings of the 10th International Conference on Critical Information Infrastructures Security (CRITIS 2015)",
}