Essential States in Time Petri Nets

This paper deals with studying the behaviour of Time Petri nets in a discrete way. It is shown that although a continuous time model is used here, only a few time points are important for the determination the behaviour of the net. The computation of the boundedness is shown as a recursive-enumerative process. Qu alitative and quantitative analysis can be done using only the essential states of the net.