Efficient Analysis to Protect Control into Critical Infrastructures

Shuo Zhang, Stephen Wolthusen

Research output: Contribution to conferencePaperpeer-review

88 Downloads (Pure)

Abstract

To protect control into critical infrastructures against single component-dependency attacks or failures, we analyse the importance of any given dependency in maintaining controllability with a minimum set of inputs. Since people use critical, redundant and ordinary categories to clarify how an edge maintains controllability of linear time-invariant(LTI) dynamical networks, according to graph-based models of infrastructures and the minimum input theorem, we firstly use a ErdHos-Renyi random digraph with a precomputed maximum matching to model some LTI and controllable infrastructures by a minimum set of inputs. We then efficiently analyse any given arc's category before and during single-arc removals, as a way to further confirm how related dependency keeps control into infrastructures. After running our label operations with linear time and space complexity, any edge-category analysis can be thus executed in $O(1)$ time in both cases.
Original languageEnglish
Pages226-229
Number of pages4
DOIs
Publication statusE-pub ahead of print - 30 Dec 2018
Event13th International Conference on Critical Information Infrastructures Security - Vytautas Magnus University, Kaunas, Lithuania
Duration: 24 Sept 201826 Sept 2018

Conference

Conference13th International Conference on Critical Information Infrastructures Security
Abbreviated titleCRITIS 2018
Country/TerritoryLithuania
City Kaunas
Period24/09/1826/09/18

Cite this