{'fraction_non_alphanumeric': 0.021300448430493273, 'fraction_numerical': 0.0011210762331838565, 'mean_word_length': 5.714285714285714, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Identifying Plausible Harmful N-K Contingencies: A Practical Approach Based on Dynamic Simulations

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.