Sequence analysis for time petri nets

Abstract In this paper is proposed a new methodology to analyse Time Petri nets. This new approach is based on the class graph and it allows temporal analysis of any valid sequence of transition firings. For that, it is proposed a procedure that find valid dates for all events over a transition firing sequence present in the graph. These valid dates are presented by means of an inequalities system, that is constructed following the sequence path in the class graph. Then, it is possible to calculate, for instance, the maximal time interval between two events in the sequence, as well as the latter date of a given event.