Efficient Analysis to Protect Control into Critical Infrastructures. / Zhang, Shuo; Wolthusen, Stephen.

2018. 226-229 Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania.

Research output: Contribution to conferencePaperpeer-review

E-pub ahead of print

Standard

Efficient Analysis to Protect Control into Critical Infrastructures. / Zhang, Shuo; Wolthusen, Stephen.

2018. 226-229 Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania.

Research output: Contribution to conferencePaperpeer-review

Harvard

Zhang, S & Wolthusen, S 2018, 'Efficient Analysis to Protect Control into Critical Infrastructures', Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania, 24/09/18 - 26/09/18 pp. 226-229. https://doi.org/10.1007/978-3-030-05849-4_18

APA

Zhang, S., & Wolthusen, S. (2018). Efficient Analysis to Protect Control into Critical Infrastructures. 226-229. Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania. https://doi.org/10.1007/978-3-030-05849-4_18

Vancouver

Zhang S, Wolthusen S. Efficient Analysis to Protect Control into Critical Infrastructures. 2018. Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania. https://doi.org/10.1007/978-3-030-05849-4_18

Author

Zhang, Shuo ; Wolthusen, Stephen. / Efficient Analysis to Protect Control into Critical Infrastructures. Paper presented at 13th International Conference on Critical Information Infrastructures Security, Kaunas, Lithuania.4 p.

BibTeX

@conference{c5e8ec18f3f44b51b93a773f2de46103,
title = "Efficient Analysis to Protect Control into Critical Infrastructures",
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.",
author = "Shuo Zhang and Stephen Wolthusen",
year = "2018",
month = dec,
day = "30",
doi = "10.1007/978-3-030-05849-4_18",
language = "English",
pages = "226--229",
note = "13th International Conference on Critical Information Infrastructures Security, CRITIS 2018 ; Conference date: 24-09-2018 Through 26-09-2018",

}

RIS

TY - CONF

T1 - Efficient Analysis to Protect Control into Critical Infrastructures

AU - Zhang, Shuo

AU - Wolthusen, Stephen

PY - 2018/12/30

Y1 - 2018/12/30

N2 - 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.

AB - 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.

UR - https://link.springer.com/chapter/10.1007/978-3-030-05849-4_18

U2 - 10.1007/978-3-030-05849-4_18

DO - 10.1007/978-3-030-05849-4_18

M3 - Paper

SP - 226

EP - 229

T2 - 13th International Conference on Critical Information Infrastructures Security

Y2 - 24 September 2018 through 26 September 2018

ER -