Deterministic Scheduling of Time Petri Nets

Time Petri nets (PTN'S)can be viewed as a natural time-extension of casual PN's for modelling of discrete event systems. In this report we define states and firing rules for TPN's and give a reachability algorithm to enumerate states under arbitrary decisions for scheduling time of events. Deterministic Scheduling of TPN's involve defining a rule for these decisions and the resulting model may be called a DSTPN. Beside the modelling of non-determinism, zero-testability is another important feature of TPN's which has been the base of undecidability results about some important properties of TPN's. We show that while DSTPN's retain the modelling power of TPN's, reachability analysis similar to casual Petri nets is possible for some DSTPN's having important applications. We also point out a flaw in the proof for undecidability of TPN properties which renders it invalid.