On clock interval automata for a class of time PNs

This paper is about the representations of distributed timed discrete event systems with synchronization events and time window constraints. A subclass of labeled T-time Petri nets with time interval constraints and weak time semantics is first recalled as a reference model for the considered systems. Such a model is reformulated according to distributed automata with time intervals, then it is transformed to clock interval automata that are manipulated as logical automata. A parallel composition of such automata is then defined and we provide conditions such that the result of this composition abstracts the timed language of the original T-time Petri net.