Abstract

We consider a class of controlled timed event graphs subject to strict temporal constraints. Such a graph is deterministic, in the sense that its behaviour only depends on the initial marking and on the control that is applied. This behaviour can be modelled by a system of difference equations that are linear in the Min-Plus algebra. The temporal constraint is represented by an inequality that is also linear in the min-plus algebra. Then, a method for the synthesis of a control law ensuring the respect of constraints is described. We give explicit formulas characterizing a control law, which, if two conditions are satisfied, ensures the validity of the temporal constraints. It is a causal state feedback, involving delays. The method is illustrated on an example.

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