00534nas a2200181   4500008004100000022001400041245006400055210006000119260004200179300001000221490000600231653001800237653001200255653001400267653001500281100002000296856003600316       2014                        eng d  a1927-032100aTIM Lecture Series – Cybersecurity Metrics and Simulation0 aTIM Lecture Series Cybersecurity Metrics and Simulation  aOttawabTalent First Networkc10/2014  a43-450 v410acybersecurity10ametrics10amodelling10asimulation1 aCybenko, George  uhttp://timreview.ca/article/83901660nas a2200241   4500008004100000022001400041245008300055210006900138260004200207300001000249490000600259520093900265653002801204653001801232653001901250653001401269653001801283653001801301653001501319653002601334100002201360856003601382       2013                        eng d  a1927-032100aProtecting Critical Infrastructure by Identifying Pathways of Exposure to Risk0 aProtecting Critical Infrastructure by Identifying Pathways of Ex  aOttawabTalent First Networkc08/2013  a34-400 v33 aIncreasingly, our critical infrastructure is managed and controlled by computers and the information networks that connect them. Cyber-terrorists and other malicious actors understand the economic and social impact that a successful attack on these systems could have. While it is imperative that we defend against such attacks, it is equally imperative that we realize how best to react to them. This article presents the strongest-path method of analyzing all potential pathways of exposure to risk – no matter how indirect or circuitous they may be – in a network model of infrastructure and operations. The method makes direct use of expert knowledge about entities and dependency relationships without the need for any simulation or any other models. By using path analysis in a directed graph model of critical infrastructure, planners can model and assess the effects of a potential attack and develop resilient responses. 10acritical infrastructure10acybersecurity10adirected graph10amodelling10apath analysis10arisk analysis10asimulation10astrongest-path method1 aO’Neill, Philip  uhttp://timreview.ca/article/714