{'fraction_non_alphanumeric': 0.014251781472684086, 'fraction_numerical': 0.0, 'mean_word_length': 5.0285714285714285, '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}}
Proving Correctness of Distributed Algorithms a Petri Net Approach

In this paper we argue that high-level Petri nets are well suited for the representation of distributed algorithms as well as for correctness proofs. A variant of Raymond's message-passing mutual exclusion algorithm serves as an example. Its proof uses techniques that beneet from the syntactical representation of the algorithms in form of a Petri net.