TIMED PETRI NETS IN MODELLING AND EVALUATION OF MULTIPROCESSOR SYSTEMS

In timed nets [65], [70], [83], firing times are associated with transitions, and transition firings are real–time events, i.e., tokens are removed from input places at the beginning

Fig.19 shows one of possible Petri net models for such a tool with a dual–blade robot; the double use of chamber 2 in each cycle is represented by two unload/load transitions (t 2a

A model of a simple communication protocol with a timeout mechanism, shown in Fig.6, is used as an illustration of timed nets with deterministic firing times [16].. The token in p

(a) Delayed split: Since the transitions initiate their firings in the same time instances in which they become enabled, a pair of transitions that initiate their firings

In timed Petri nets, the firing of an enabled transition is composed of three “concep- tual” steps; the first (instantaneous) removes tokens from the input places, the second

Enhanced Petri nets combine two different classes of Petri nets, “immediate” nets which are in fact ordinary (i.e., without time) inhibitor free–choice “straight” Petri nets,

In timed Petri nets temporal properties are associated with transitions as transition firing times (or occurrence times).. Specific prop- erties of timed nets, such as boundedness

We define a class of Petri nets suitable for a parallel execution machine which preserves the step sequence semantics of the nets and ensures time consistent executions while