{'fraction_non_alphanumeric': 0.02467343976777939, 'fraction_numerical': 0.0, 'mean_word_length': 4.609756097560975, '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 Interval Semantics and Reachability Analysis of Time Basic Nets

To model and analyze systems, whose overall correctness depend on time, a powerful formalism called Petri net can be used. Several extensions of Petri nets that are dealing with time have been proposed (i.e. timed Petri nets, stochastic Petri nets). In this paper we deal with high-level Petri nets called environment relationship nets (ER nets for short) and their special type called time basic nets (TB nets for short). Aim of this paper is to put a light on the possibility of solving the reachability problem for TB nets. We will introduce some methods and constructions that help us to solve this crucial problem.