On the Steady-State Control of Timed Event Graphs With Firing Date Constraints

Two algorithms for solving a specific class of steady-state control problems for Timed Event Graphs are presented. In the first, asymptotic convergence to the desired set is guaranteed. The second algorithm, which builds on from the recent developments in the spectral theory of min-max functions, guarantees Lyapunov stability since the distance between the actual state and the desired set never increases. Simulation results show the efficiency of the proposed approach in a problem of moderate complexity.