第11讲_PT网和着色网(2)..pptVIP

工作流建模技术 Main Contents Sequential Case Graph Case Graph State Space Similar Complements Condition b1, b2 are complements of each other, b1=b2 iff ?e ? E, b1 ? ?e iff b2 ? e? and ?e ? E, b1 ? e? iff b2 ? ? e Construction Let N =(B,E,F,Cin) be EN system Let B be a set disjoint with B?E, and let ?:B?B be a bijection The S-complementation of N is the EN system N ‘=(B’,E’,F’,Cin’) such that B’=B?B, E’=E, F’=F ?{(e, ?(b)):e?E(b,e) ?F} ?{(?(b),e) :e?E(e,b) ?F}, Cin’=Cin ? ?(B-Cin) Construction Main Contents Folding a Net Omit some Details Control structure of Vending M A Vending Machine with Capacity 4 Place/Transition Net Marked place/transition nets generalize EN System Terminology Definition of Marked Place/Transition Net A marked place/transition net is a tuple N=(S, T, F, k, w, M0) where (S, T, F) is a net S, set of Places; T, set of Transitions k: S?{1,2,3,…}? {?} w:F?{1,2,3,…} M0:S?{0,1,2,3,…} Example of P/T Net Question 1 Let P/T Net , (S, T, F, k, w, M0 ) A transition t ? T is enabled at a marking m iff ?s ? ?t: m(s)?w(s,t) ? ?s ? t ?: m(s)+w(t,s)?k(s) Notation M[t Are the transition t is enabled? Question 2 Let P/T Net , (S, T, F, k, w, M0 ) A transition t ? T is enabled. The occurrence of t leads to the successor marking m’: ?s ? S, m’(s) = m(s) – w(s,t) if s ? ? t - t ? m’(s) = m(s) + w(t,s) if s ? t ? - ? t m’(s) = m(s) – w(s,t) + w(t,s)if s ? t ??? t m’(s) = m(s) if s ? t ??? t Marking Graph Let P/T Net , (S, T, F, k, w, M0 ) The marking graph of a marked P/T Net is an edge-labeled graph with initial vertex, ((M, Y), M0) M0 initial vertex initial marking M vertices set of reachable markings Y labeled-edges set of triples(m,t,m’), m[tm’ Example of Marking Graph Main Contents Folding the Net Further Behavior of the Example Adding Constraints Marking with Multi Set Behavior with Constraints Colored Petri Net EN System and P/T Net has no types and no modules Only one kind of tokens With more elements in the mo