{'fraction_non_alphanumeric': 0.016467065868263474, 'fraction_numerical': 0.0, 'mean_word_length': 5.5588235294117645, '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}}
Supervisory Control for a Class of Discrete Event Systems for Optimal Throughput

Abstract In this paper, we study the problem of supervisor synthesis for a class of discrete event systems for optimal throughput based on the timed discrete event modelling formalism. First, a language-based definition for the concept of throughput is presented. Then, we formulate the supervisor synthesis problem with both logic correctness and time-related optimal performance objective, namely throughput. After we show the existence of supremal controllable sublanguage with maximum throughput and minimum transient makespan, an algorithm is provided to compute such a supervisor.