    @inproceedings {1810,
	title = {Structural Controllability of Networks for Non-Interactive Adversarial Vertex Removal},
	booktitle = {8th International Conference on Critical Information Infrastructures Security},
	volume = {8328},
	year = {2013},
	pages = {120-132},
	publisher = {Springer},
	organization = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {<p class="rtejustify">The problem of controllability of networks arises in a number of different\&nbsp;domains, including in critical infrastructure systems where control must be\&nbsp;maintained continuously. Recent work by Liu et al. has renewed interest in the\&nbsp;seminal work by Lin on structural controllability, providing a graph-theoretical\&nbsp;interpretation. This allows the identification of driver nodes capable of forcing the\&nbsp;system into a desired state, which implies an obvious target for attackers wishing\&nbsp;to disrupt the network control. Several methods for identifying driver nodes\&nbsp;exist, but require undesirable computational complexity. In this paper, we therefore\&nbsp;investigate the ability to regain or maintain controllability in the presence\&nbsp;of adversaries able to remove vertices and implicit edges of the controllability\&nbsp;graph. For this we rely on the POWER DOMINATING SET (PDS) formulation for\&nbsp;identifying the control structure and study different attack strategies for multiple\&nbsp;network models. As the construction of a PDS for a given graph is not unique,\&nbsp;we further investigate different strategies for PDS construction, and provide a\&nbsp;simulative evaluation.</p>
},
	issn = {0302-9743},
	doi = {http://link.springer.com/chapter/10.1007\%2F978-3-319-03964-0_11},
	author = {Cristina Alcaraz and Estefania Etcheves Miciolino and Stephen Wolthusen}
}
