2016
DOI: 10.1016/j.ress.2016.06.007
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of the robustness of critical infrastructures by Hierarchical Graph representation, clustering and Monte Carlo simulation

Abstract: In this paper, we present a methodological work that adopts a system-of-systems (SoS) viewpoint for the evaluation of the robustness of interdependent critical infrastructures (CIs). We propose a Hierarchical Graph representation, where the product flow is dispatched to the demand nodes in consideration of different priorities. We use a multi-state model to describe different degrees of degradation of the individual components, where the transitions between the different states of degradation occur stochastica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 44 publications
(27 citation statements)
references
References 54 publications
0
27
0
Order By: Relevance
“…Thereby, hierarchical models are obtained by successive clustering of networks, i.e. decomposition of the system into different levels of details (Ferrario et al 2016).…”
Section: Traffic On Complex Networkmentioning
confidence: 99%
“…Thereby, hierarchical models are obtained by successive clustering of networks, i.e. decomposition of the system into different levels of details (Ferrario et al 2016).…”
Section: Traffic On Complex Networkmentioning
confidence: 99%
“…A hierarchical approach to evaluating the robustness of capacitated flow networks was provided by Ferrario et al [18]. In their method, a network is represented as a multi-level flow model in which each demand node is assigned a priority level.…”
Section: Flow-based Cims Applied To Infrastructurementioning
confidence: 99%
“…A power network structure can be modelled using weighted or unweighted undirected graphs G = {N , L, w}, where N is the set of network buses (or nodes set), L is the set of lines connecting the nodes (i.e. links set) and w is the set of weights associated to the lines [10]- [20]- [21]- [22]. Generally when 130 graph-theory approaches are used, a conservative (pessimistic) hypotesis is made on the network structure, to ease the calculations.…”
Section: Background and Power Grid Modellingmentioning
confidence: 99%