时间约束Petri网的可调度性分析方法研究-控制与决策.PDF

第15 卷第5 期 2000 年9 月 Vol. 15 No . 5 CON TR OL A N D DE CI S I ON Sept. 2000 Petri * 李慧芳　李人厚 ( 710049) 在系统地研究了时间约束Pet ri 网的基础上, 提出了 一般的状态可达性分 方法。通过讨论任 意拓扑结构T CPN ′s 的可调度分 , 克服了以往T CPN ′s 可达性分 方法的局限性, 显示了该方法的准 确性和实用性。 时间约束Petri 网, Pet ri 网, 可调度分 , 决策变量 278 TP Studies on Schedulability Analysis Method of Timing Constraint Petri Nets L i H uif ang , L i R enhou ( Xi an Jiaoton University) Abstract A eneral analysis method of state reachability is proposed based on systemat ically . investi atin t imin constraint Pet ri nets T hrou h discussin schedulability analy sis of T CPN s w it h any t opolo y structure, the lim itation of ex istin reachability analysis method about T CPN s is overcome, then t he veracity and practicabilit y of proposed method are demonstrated. , , , Key words timin constraint Pet ri nets Petri nets schedulability analy sis decision variables 1引　　言 2基本概念 [ 1] Petri ( T CPN s) Petri 6 ( P , T , F , T C, [ 2, 3] Petri , Petri 0 0 D , M ) , ( P , T , F , M ) ; D [ 4] , ( ) Petri Petri PN s FIREDur ( t ) , t ; T C T CPN s ( T Cmin ( pt) , T Cmax ( pt) ) , pt , , [ 1] ( T Cmin (p j )