{'fraction_non_alphanumeric': 0.020558002936857563, 'fraction_numerical': 0.0, 'mean_word_length': 5.256880733944954, '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}}
Diagnosis of Patterns in Partially-Observed Discrete-Event Systems

This paper studies the problem of diagnosis of a pattern in a partially-observed discrete-event system. Two different types of pattern diagnosability are defined in the context of formal languages: (i) S-type for patterns in the form of subsequences of sequences of events and (ii) T-type for patterns in the form of substrings of sequences of events. These two notions of pattern diagnosability generalize the notion of diagnosability of single events in prior works. Implementable necessary and sufficient conditions for both types of pattern diagnosability in systems modeled by regular languages are presented