{'fraction_non_alphanumeric': 0.016494845360824743, 'fraction_numerical': 0.0, 'mean_word_length': 5.5608108108108105, '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}}
Synthesis of petri net supervisors enforcing general constraints

This paper deals with the synthesis of Petri net supervisor enforcing the more expressive constraints including marking terms, firing vector terms and Parikh vector terms. The method is developed to handle uncontrollable and unobservable transitions existing in the constraints. The “greater-than or equal” general constraints can also be transformed into “less-than or equal” Parikh constraints. An example is analyzed to show how the problem is solved. General constraint is first transformed into Parikh vector constraints, and Matrix-Transformation is proposed to obtain the admissible constraints without uncontrollable and unobservable transitions. Then the supervisor can be constructed based on constraints only consisting of Parikh vector terms. The method is proved to be more concise and effective than the method presented by Iordache and Moody especially when applied to large scale systems.