{'fraction_non_alphanumeric': 0.015091342335186657, 'fraction_numerical': 0.0023828435266084196, 'mean_word_length': 5.206896551724138, '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}}
On using abstraction to model check an on-line diagnostic protocol

Distributed diagnostic protocols face the challenges posed by current rise in transient fault rates. The issue of discriminating between transient and intermittent faults becomes essential to avoid unnecessary isolations which reduce system resiliency and thus reliability. This issue can be solved using proper count and threshold mechanisms [1], that expect underlying diagnostic protocols to eventually detect not only permanent but also transient faults. We outline the model checking approach we developed to assess a synchronous frame based diagnostic protocol similar to the DD protocol presented in [2]. In that paper the formal verification of the protocol is done assuming all faults to be permanent. Instead, we proved that the protocol guarantees the desired properties, without posing constraints on the fault duration, as long as the necessary conditions to ensure consensus are met. To solve the state explosion problem we faced on the original state-based model, we exploited the symmetry of the problem to introduce a sound abstracted model with a significantly reduced state space. 1 It was in fact sufficient to model only one single correct node instead of the whole set.