{'fraction_non_alphanumeric': 0.01092896174863388, 'fraction_numerical': 0.0, 'mean_word_length': 6.0, '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}}
Enforcement of event-based supervisory constraints using state-based methods

Efficient, established techniques exist for enforcing systems of linear inequalities on the state vectors of discrete event systems modeled as Petri nets. The paper presents methods for extending the convenience of these state-based techniques to supervisory constraints that are expressed in terms of allowable plant events rather than just allowable plant states. Two interpretations of event-based constraints are described. The direct interpretation assumes that the controller will actively disable events that would directly violate the constraints. The indirect interpretation indicates that the controller should prevent those states that could lead to the violation of the constraints. Methods for automatically synthesizing supervisors that use either of these interpretations are presented here along with mathematical results for integrating these methods with established techniques for handling uncontrollable and unobservable plant transitions. The technique is illustrated with a process control example.