The reviewed record of science sign in
Pith

arxiv: 2409.04590 · v1 · pith:VJJHMH4K · submitted 2024-09-06 · math.NA · cs.NA

On Graph Theory vs. Time-Domain Discrete Event Simulation for Topology-Informed Assessment of Power Grid Cyber Risk

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VJJHMH4Krecord.jsonopen to challenge →

classification math.NA cs.NA
keywords graphsimulationsystemscyberpowertheoryassessmentcase
0
0 comments X
read the original abstract

The shift toward more renewable energy sources and distributed generation in smart grids has underscored the significance of modeling and analyzing modern power systems as cyber-physical systems (CPS). This transformation has highlighted the importance of cyber and cyber-physical properties of modern power systems for their reliable operation. Graph theory emerges as a pivotal tool for understanding the complex interactions within these systems, providing a framework for representation and analysis. The challenge is vetting these graph theoretic methods and other estimates of system behavior from mathematical models against reality. High-fidelity emulation and/or simulation can help answer this question, but the comparisons have been understudied. This paper employs graph-theoretic metrics to assess node risk and criticality in three distinct case studies, using a Python-based discrete-event simulation called SimPy. Results for each case study show that combining graph theory and simulation provides a topology-informed security assessment. These tools allow us to identify critical network nodes and evaluate their performance and reliability under a cyber threat such as denial of service threats.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.