Performance evaluation of discret event systems using P-time Event Graphs

The dater equalities constitutes an appropriate tool which allows a linear description of timed event graph in the field of (max,+) algebra. This paper give an equivalent model in the standard algebra. The application of a variant of Farkas'lemma allow the necessary condition of existence of upper and lower bounds of the cycle time. A linear programming defined on the particular incidence matrix of the P-time event graph are used to compute the cycle time.