{'fraction_non_alphanumeric': 0.01757188498402556, 'fraction_numerical': 0.0, 'mean_word_length': 5.27, '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}}
State feedback based deadlock-free supervisor synthesis for bounded Petri nets

This paper addresses the forbidden state problem in which the forbidden marking set can be a set of arbitrary markings, together with deadlock-free specification. The system is modelled by bounded Petri nets, which may contain uncontrollable transitions. Through efficient reverse net analysis, we obtain not only the weakly forbidden markings but also the state feedback control policy. Then we propose a deadlock processing algorithm to deal with deadlocks caused by control. Finally a deadlock-free supervisor expressed as a table is obtained.