In: ETFA2001 proceedings of the 2001 8th IEEE International Conference on Emerging Technologies and Factory Automation, Volume 2, IEEE Catalog number : 01TH8597, pages 197-204. October 2001.
Abstract: We consider time Petri net (TPN) model. First, we prove that properties like minimal (or maximal) firing date, minimal (or maximal) time interval between firing of two transitions can be established with a discrete analysis of time Petri net. Then we propose to express all the discrete execution sequence of the TPN by an automaton considering discrete elapsing of time as the occurrence of a dedicated event. The advantage is that this automaton can be efficiently analysed by Binary Decision Diagrams.
Keywords: time Petri net, discrete time.
Back to the Petri Nets Bibliography