Periodic schedules for bounded timed weighted event graphs

Abstract— This paper deals with feedback controller synthesis for timed event graphs in dioids, where the number of initial tokens and time delays are only known to belong

Keywords: Discrete Event Systems, Timed Event Graphs, Dioid, Residuation Theory,..

We show that for a subclass of TWEGs that we call Balanced Timed and Weighted Event Graphs (B-TWEGs), the rational expressions generated have a canonical periodic form. The class

The proposed observer records the number of firings of certain input and output transitions of the WTEG and generates an optimal estimate for the number of firings of

The purpose of the synthesis given subsequently is slightly dif- ferent, it is to compute the greatest causal feedback in order to delay as far as possible the input of tokens in

Keywords: Disrete Event Systems, Timed Event Graphs, Dioid, Residuation Theory,..

Lemma 1.. 3) Earliest schedule: Notice that for live marked TWEG, the earliest schedule (which consists in firing the transitions as soon as possible) always exists and has a

The steady–state behavior of manufacturing cells is considered for two types of schedules, the so called sim- ple schedules in which exactly one (new) part enters the cell and