From Extremal Trajectories to Token Deaths in P-time Event Graphs

In this technical note, we consider the (max,+) model of P-time Event Graphs whose behaviors are defined by lower and upper bound constraints. The extremal trajectories of the system starting from an initial interval are characterized with a particular series of matrices for a given finite horizon. Two dual polynomial algorithms are proposed to check the existence of feasible trajectories. The series of matrices are used in the determination of the maximal horizon of consistency and the calculation of the date of the first token deaths.