Un nouveau graphe de classes pour la préservation des contraintes temporelles quantitatives

The objective of this paper is to present a new abstract state space for t-time Petri nets which associates with each path in this space a sequence effectively fireable in the net. This means that this state space has to exactly (in a quantitative way) define the set of constraints which have to be verified by the firings. After some definitions about the Simple Temporal Networks, the abstract states are defined and an algorithm for the generation of the abstract space are given. It is shown that this space does not coincide with the two previously defined spaces (Wand A) in TINA.