{'fraction_non_alphanumeric': 0.011869436201780416, 'fraction_numerical': 0.0, 'mean_word_length': 4.622222222222222, '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}}
Specifying a Distributed Database Arranged as Ring with the Process Algebra μ CRL

In this paper, we have given a specification of a distributed algorithm using the process algebra μCRL. The algorithm is about how preserving the data replication consistency in a distributed database arranged as ring, where each node is attributed a unique integer as priority. An update emitted by a node with greater priority cancels the one emitted by a node with less priority when propagating on this last, while an update originated from a node with less priority will be stopped at a node with greater priority. This strategy has been proven valid by Roscoe et al. The algorithm that we have specified by mean of the process algebra is simplified: each node is supposed to update only one slot. We have given formal definitions of both the process running at a node and the global behavior of the system in the process algebra, and verified that the specification is well-formed using the utilities of the μCRL tool set.