{'fraction_non_alphanumeric': 0.021367521367521368, 'fraction_numerical': 0.0, 'mean_word_length': 5.124183006535947, '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}}
Formalism of self-stabilization with linear temporal logic and its verification

The last several decades have seen a rapid growth of information technology. Distributed systems are used world-wide in our daily life. Clearly, the correctness of such systems is of crucial importance. Failures of those systems can be potentially disastrous and cause huge amount of money. One way to guarantee that these systems tolerate transient faults is done by making them self-stabilizing systems, which automatically recover from any transient fault. Mathematics can provide solid foundations for methods to describe and analyze systems. Formal methods are of this kind. Moreover, formal analysis techniques can be used to verify whether a system has desired properties. In this paper, we present a formalism of self-stabilization concept based on Linear Temporal Logic (LTL), and apply the model checking as formal verification of the formalism.