Identifying Plausible Harmful N-k Contingencies: A Practical Approach based on Dynamic Simulations

Johannes Tilman Gabriel Weckesser, Thierry Van Cutsem

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

162 Downloads (Pure)


This paper presents a practical search algorithm using detailed dynamic simulations to identify plausible harmful N − k contingency sequences. Starting from an initial list of contingencies, progressively more severe contingency sequences are investigated. For that purpose, components, which violated conservative protection limits during a N − k contingency simulation are identified and considered as candidate k + 1-th contingencies, since these could be tripped due to a hidden failure. This approach takes into account cascading events, such as over- or under-speed generator tripping, which are considered to be part of the system response. The implementation of the proposed algorithm into a parallel computing environment and its performance are demonstrated on the IEEE Nordic test system.
Original languageEnglish
Title of host publicationProceedings of 20th Power System Computation Conference
Number of pages8
Publication date2018
ISBN (Print)9781910963104
Publication statusPublished - 2018
Event20th Power Systems Computation Conference - O’Brien Centre for Science at University College Dublin, Dublin, Ireland
Duration: 11 Jun 201815 Jun 2018
Conference number: 20


Conference20th Power Systems Computation Conference
LocationO’Brien Centre for Science at University College Dublin
Internet address


  • N-k contingencies
  • Cascading events
  • Protection hidden failures
  • Time-domain simulation

Fingerprint Dive into the research topics of 'Identifying Plausible Harmful N-k Contingencies: A Practical Approach based on Dynamic Simulations'. Together they form a unique fingerprint.

Cite this