{'fraction_non_alphanumeric': 0.01045751633986928, 'fraction_numerical': 0.0, 'mean_word_length': 5.436974789915967, '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}}
Analyzing Synchronous Distributed Algorithms

Synchronous distributed systems are those in which there is assumed to be a known upper bound on each processing step, a known upper bound on message transmission and processes have perfectly synchronized physical clocks. When these assumptions hold for a system, execution can be arranged to proceed in synchronous rounds. This paper is a tutorial on modeling and analyzing these systems using finite state machines to model processes and communication links, linear temporal logic to express required properties and model-checking to demonstrate that models satisfy the required properties. The paper focuses on models of Atomic Commitment protocols and illustrates the use of the LTSA tool in analyzing these models.