{'fraction_non_alphanumeric': 0.022805805114029024, 'fraction_numerical': 0.0, 'mean_word_length': 5.407079646017699, '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 Control of Colored Timed Petri Nets Under Generalized Mutual Exclusion Temporal Constraints

A coloured Petri net (CPN) is widely used to model discrete event systems due to its compact representation of the system by colour sets associated with places, transitions and I/O arcs. For real-world systems such as manufacturing systems, transportation systems, and communication protocols, a coloured timed Petri net (CTPN) is proposed to model timed behaviours. To control a discrete event system with a desired control specification, it is important to describe the control specification formally. For the CPN, a class of specification called coloured generalized mutual exclusion constraints (cGMEC) is utilized to specify the behaviours. However, cGMEC can only represent safety constraints and not temporal constraints. Therefore, in this paper, we propose a novel temporal logic based constraint called a coloured generalized mutual exclusion temporal constraint (cGMETC). The cGMETC is described by a signal temporal logic (STL) formula where each atomic predicate represents a cGMEC. We propose a method for optimal control of the CTPN under a given cGMETC. In particular, we formulate an optimal control problem and solve the problem by transforming it into an integer linear programming problem. Through a simulation of an optimal control problem of a manufacturing system, we demonstrate the effectiveness of the proposed approach.