Optimal Control of Timed Event Graphs with Resource Sharing and Output-Reference Update

Abstract

Abstract Discrete-event systems exhibiting synchronization and delay phenomena, but not conflict, can be modeled as timed event graphs (TEGs), which admit a linear representation in some idempotent semirings. For such linear systems, a control theory has been constructed. In this paper, we build onto this control framework by proposing a formal method to determine the optimal (just-in-time) control inputs in face of changes in the output-references for a number of TEGs that share one or more resources. The approach is based on a prespecified priority policy among the component subsystems. Simple examples are presented to illustrate the results.