{'fraction_non_alphanumeric': 0.012379642365887207, 'fraction_numerical': 0.0, 'mean_word_length': 4.870967741935484, '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}}
Performance evaluation using measure dependent transitions in Petri nets

Decomposition is an often proposed method to determine Petri nets with a large state space. But there are no generalized rules on how to decompose a Petri net. We present a general method to adapt the transition parameters of timed Petri nets that show a cyclic behavior. The cyclic time intervals can be of constant length or differ. We realize this by adapting the firing rates of exponentially timed transitions or the weights of immediate transitions. Our method is demonstrated with two applications. They show the acceleration in the calculation time. But also, the sensitivity to neglected dependences in the decomposed Petri net can be observed.