{'fraction_non_alphanumeric': 0.023346303501945526, 'fraction_numerical': 0.0025940337224383916, 'mean_word_length': 4.893129770992366, '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}}
A TLA + Encoding of DEVS Models

Control Theory researchers have been using DEVS models to formalize discrete event systems for a long time [1] but, despite such systems are one of the main targets of Software Engineers, the DEVS formalism has not been used and it is hardly known by the formal methods community of Computer Science. This paper is an attempt to close the gap between these communities by setting some of the basic rules to translate DEVS models into TLA+ specifications. TLA+ [2] is a widely known formalism, used by formal methods researchers and practitioners, to specify –hardware or software based– reactive or concurrent systems. The paper includes some theoretical insights, some modeling design decisions and an example of the encoding we propose.