{'fraction_non_alphanumeric': 0.014141414141414142, 'fraction_numerical': 0.0, 'mean_word_length': 5.2784810126582276, '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}}
Time constraint verification methods based on time Petri nets

The study is concerned with the development of real time distributed applications and more precisely with the verification of temporal properties in a distributed context (taking into account the characteristics of the real architecture). We show how to use a time Petri net based model of the application in order to prove that a communication system (networks, protocols) and a mapping of tasks meet specified temporal properties.