{'fraction_non_alphanumeric': 0.014184397163120567, 'fraction_numerical': 0.0, 'mean_word_length': 5.303571428571429, '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}}
Continuous Petri nets and polytopes

This article addresses the problem of the computation of instantaneous firing speed in Invariant Behavior state (IB-state) of Constant speed Continuous Petri Net (CCPN) with presence of actual conflicts. The adopted approach is based on polyhedral computations applied to specify an area of possible instantaneous firing speed. If the actual conflicts are resolved by global priorities, the instantaneous firing speed is found in a set of the polytop vertices or alternatively it is found by one formulation of the linear programming problem per each priority level. The approach shown in this article assumes the speed maximisation being prior to priority resolution.