Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification math.NAcs.NA
keywords graphsimulationsystemscyberpowertheoryassessmentcase
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools