{'fraction_non_alphanumeric': 0.012674271229404309, 'fraction_numerical': 0.0, 'mean_word_length': 5.32, '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 the Distributed Implementation of LOTOS

This paper presents an approach to the distributed implementation of multiple rendezvous, including dynamic process creation, as defined by the specification language LOTOS. The approach is based on a so-called activity tree which reflects the dynamic relationships between the active processes within the system, and a virtual ring algorithm for the distributed implementation of a set of rendezvous, which was originally developed for a static set of processes. A new dynamic ring establishment algorithm is presented which serves as a bridge between the activity tree and the virtual ring algorithm. When growing the activity tree, the algorithm establishes for each LOTOS gate a virtual ring over which the virtual ring algorithm is applied.