DePetri net theory and its applications - NTU：depetri网络理论及其应用——南洋理工大学.pptVIP

PART 4: Extended Petri Nets Motivation Computational power of Petri nets Turing machines. In many real-time applications, it is often desirable to give certain jobs higher priorities over others, so that critical actions can be finished within their time constraints. For example, one way to do so is to assign each transition of a process a priority which indicates the degree of importance or urgency. Inhibitory arcs “Colored” tokens Program variables Enabling predicates on transitions Adding time Maximum firing rule … 2-counter Machines Turing machines ≡ 2-counter Machines Simulating a counter by Inhibitor Arcs Simulating a Counter by Priority Adding Time to Petri Nets Variation 1: Transitions have a delay time; firing takes a non-zero time from enabling. Time may be bounded from above or below. Variation 2: Places have a delay time: A token must dwell on a place a certain amount of time (determined by the place) before becoming usable in firing. Variation 3: Like 2, but tokens have a delay time. A Time Petri Net is like a Petri Net with a time interval on each transition: [t1, t2] or [t1, ?) From the time the transition is enabled, it cannot fire before t1 and must fire by t2 (unless disabled by firing another transition). Simulating a Counter by Timed PN Simulating a Counter by Maximum Parallelism The above extensions render the new PN models Turing-equivalent ? Reset / Transfer nets Reset nets: set of reset arcs FR ? T x P when t is fired with (t, p) ? FR place p is reset to zero. Transfer nets: set of transfer arcs FT ? P x T x P when t is fired with (p, t, q) ? FT Removing the enabling tokens Transferring all tokens from p to q Adding the usual output tokens Reset nets (Un)decidability results PART 5: Petri Net Languages Formal Language Approach View the behavior of a system by the set of all executable transition sequences – a language. Allow us to take advantage of known results in formal language theory. Various Types of PN Lan