{'fraction_non_alphanumeric': 0.02214022140221402, 'fraction_numerical': 0.007380073800738007, 'mean_word_length': 5.120300751879699, '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}}
Membership Dependable Failure Detectors

In this paper we extend the function of group membership to cover whether a process is correct or not with respect to specification. We introduce the concept of (m, n) reliable membership failure detectors and formally define three failure detector classes PMD diam PMD and WMD in terms of their ability to implement reliable group membership services. We show that the perfect failure detectors and eventually perfect failure detectors are sub classes of (0, 0) PMD and (0, 0) WMD respectively in systems subject to only crash failures. Combining muteness failure detectors with the modular approach introduced for Byzantine systems, we propose a failure detector called RMSFD. By studying its reliability property, we prove that RMSFD is a failure detector of (0, 0) WMD