{'fraction_non_alphanumeric': 0.015612161051766639, 'fraction_numerical': 0.0, 'mean_word_length': 5.766666666666667, '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}}
Optimal Supervisor Simplification in AMS based on Petri Nets and Genetic Algorithm

Supervisor simplification is of significant importance in the supervisory control of automated manufacturing systems. In many situations, simplification results are not unique. However, there is little study on the optimal simplification. In the paradigm of discrete event systems, solving the optimal simplification is always faced with the combinational explosion problem. Based on the simplification method proposed by the same authors, our work further investigates the optimal simplified supervisor based on the genetic algorithm (GA). There are two contributions. First, we present a GA in which our simplification method is embedded to derive the basic optimal simplified supervisor when the parameters of the specifications are fixed. Second, a hierarchical GA is proposed to obtain the advanced optimal simplified supervisor when the parameters of the specifications are changeable. This is a multiple-objective optimization problem where both structure simplification and behavior permissiveness are considered. The examples show the effectiveness of our algorithms in solving the optimal supervisor simplification problem.