效绵鼎 Definition of Petri Net C=(P,T,LO) Places P={p1,P2,P3,,Pn} Transitions T={t1,t2,t3,…,tn} 0 Input I:T>Pr(r=number of places) ot Output O:T→Pq(q=number of places)t· .12Definition of Petri Net ◼ C = ( P, T, I, O)  Places P = { p1 , p2 , p3 , …, pn}  Transitions T = { t1 , t2 , t3 , …, tn}  Input I : T → P r (r = number of places) •t  Output O : T → P q (q = number of places) t • 12