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 language | English |
---|---|
Pages | 226-229 |
Number of pages | 4 |
DOIs | |
Publication status | E-pub ahead of print - 30 Dec 2018 |
Event | 13th International Conference on Critical Information Infrastructures Security - Vytautas Magnus University, Kaunas, Lithuania Duration: 24 Sept 2018 → 26 Sept 2018 |
Conference
Conference | 13th International Conference on Critical Information Infrastructures Security |
---|---|
Abbreviated title | CRITIS 2018 |
Country/Territory | Lithuania |
City | Kaunas |
Period | 24/09/18 → 26/09/18 |