Abstract

Timed event graphs (TEGs) constitute a subclass of timed Petri nets that model synchronization and delay phenomena, but not conflict or choice. In a suitable mathematical framework (idempotent semirings such as the min-plus algebra), the temporal evolution of TEGs can be described by a set of linear equations. Recently, a method has been proposed for the optimal feedforward control of systems of TEGs that share one or more resources based on a prespecified priority policy. In this paper, we propose a feedback solution to deal with disturbances in such systems, which is not possible under the current feedforward approaches.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call