Definitions and applications of deterministic-timed Petri nets (DTPN)

Timed Petri nets are considered in this paper, with the aim of providing an efficient tool for the modelling and the analysis of timed models, such as automated manufacturing systems (AMS) and intelligent transportation systems (ITS). In the proposed model, timings are associated with transitions, and firing times are deterministic values. Such a model, the deterministic-timed Petri nets (DTPN), is characterized by a certain number of assumptions. In a DTPN the system state is represented by the joint information consisting of the marking of places and of the residual firing times of timed transitions, and, under the assumptions which characterize the proposed model, it is possible to describe the evolution of the system state in a relatively simple way. In the paper, three subclasses of DTPN are also introduced, and two examples relevant to the application of the proposed model to AMS e ITS are discussed.