{'fraction_non_alphanumeric': 0.02266666666666667, 'fraction_numerical': 0.0, 'mean_word_length': 5.155737704918033, '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}}
The specification of an asynchronous router

We describe the application of three formal design tools to a case study in the design of a distributed system. The case study in question involves the specification of an asynchronous message router; the three design tools are process algebra (specifically Milner's Calculus of Communicating Systems CCS), the modal /spl mu/ calculus and the Edinburgh Concurrency Workbench (CWB). We demonstrate how an informally presented specification can be formalised within the language of the modal /spl mu/ calculus, allowing for a rigorous mathematical analysis of the correctness of our proposed implementation. For modest sized versions of the router, this correctness proof has been carried out using the CWB.