{'fraction_non_alphanumeric': 0.022988505747126436, 'fraction_numerical': 0.0, 'mean_word_length': 5.373983739837398, '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}}
NOVEL METHODOLOGY FOR PARTITIONING COMPLEX SYSTEMS FOR FAULT DIAGNOSIS PURPOSES

Abstract The criterion used for partitioning is d- separation : a parallel between causal independency property and vertex separation in digraphs. If X , Y and Z represent the vertex subsets of two neighbouring partition regions and respectively the border between them, the d- separation criterion is used to decide if “knowing Z renders Y irrelevant to X ”. It follows that diagnosis may be performed locally, inside each region, without communicating, via partition borders, with other regions. If borders are affected by faults, communication is needed. The described partitioning provides minimal borders between regions. It follows that communication process has minimal computational complexity.