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

Using graph theory to analyze the vulnerability of process plants in the context of cascading effects

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
73
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

6
1

Authors

Journals

citations
Cited by 121 publications
(75 citation statements)
references
References 29 publications
1
73
0
1
Order By: Relevance
“…, indicating the outperformance of Case 1 in reducing the out‐closeness of the graph and thus in decreasing the vulnerability of the storage plant to domino effects . Not only is this result in agreement with the work of Khakzad and Reniers regarding the importance of the fireproofing of installations with the highest C b (T1 and T3 in this example), but it also goes one step further by demonstrating the influence of the active protection of installations with the highest C c‐out (T1 in this example) on the vulnerability of the plant.…”
Section: Methodssupporting
confidence: 87%
See 3 more Smart Citations
“…, indicating the outperformance of Case 1 in reducing the out‐closeness of the graph and thus in decreasing the vulnerability of the storage plant to domino effects . Not only is this result in agreement with the work of Khakzad and Reniers regarding the importance of the fireproofing of installations with the highest C b (T1 and T3 in this example), but it also goes one step further by demonstrating the influence of the active protection of installations with the highest C c‐out (T1 in this example) on the vulnerability of the plant.…”
Section: Methodssupporting
confidence: 87%
“…Among the nodes of a graph, the nodes with relatively higher betweenness scores lie along a larger fraction of paths within the graph, thus their removal (or isolation) from the graph can cause large disconnection . The closeness of a node, Cnormalcfalse(vifalse), can be defined as the number of steps needed to reach every other node of the graph from vi—also known as out‐closenessCc out false(vifalse)—or to access vi from every other node of the graph—also known as in‐closeness Cc in false(vifalse): Cc out vi=1jditalicijCc in vi=1jdji…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Nevertheless, recent studies dedicated to the determination of escalation probabilities (Cozzani and Salzano, 2004;Cozzani et al, 2005Cozzani et al, , 2006Landucci et al, 2009Landucci et al, , 2015 along with the development of advanced mathematical and probabilistic methods such as Monte Carlo simulation (Abdolhamidzadeh et al, 2010), Bayesian networks (Khakzad et al, 2013;Khakzad, 2015;Khakzad and Reniers, 2015a), graph theory (Khakzad and Reniers, 2015b), and event sequence diagrams Due to the importance of domino effects from either a safety or security perspective, in the present study a bibliometric analysis of attempts devoted to the description, management, modeling and risk assessment of domino effects in the chemical industry over the past decades was carried out.…”
Section: Introductionmentioning
confidence: 99%