Answers are grounded in this paper and cite their sources.
This paper is about the representations of distributed timed discrete event systems with synchronisation events and time window constraints. A subclass of T-time Petri nets with time interval constraints and specific time semantics is first recalled as a reference model for the considered systems. Such a model is first reformulated according to distributed automata with time intervals, then it is transformed to clock interval automata that are manipulated as logical tick automata. A synchronous 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.
No takes yet. Share an insight, caveat, or question.
Lefebvre et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: