TCPN的组合可调度分析

时间约束Petri网(Timing Constraints Petri nets,简称TCPNs)是一类重要的时间Petri网系统.针对TCPNs中变迁可调度原始语义的不足,本文对相关定义重新定义,丰富并完善了TPCNs理论.本文首先给出了新的针对单个变迁或变迁序列的可调度分析策略.如果一个特定的变迁序列是可调度的,则相应的活动序列也同样可以顺利地完成自身的执行;否则,不可调度的变迁需要调整自己的时间约束;然后提出了组合式的可调度分析策略以分析复杂变迁序列,最后提出时序一致性的概念.

Compositional Schedulability Analysis of Timing Constraint Petri Nets

TCPNs(Timing constraint Petri nets)is an important kind of time-related Petri nets.For correcting the irrationality of the original concepts in TCPN,some basic concepts are redefined to enrich and perfect corresponding theory of TCPN.Firstly,this paper presents a new approach to the schedulability analysis of individual transition or transition sequences in TCPN.If a specific transition sequence is schedulable,the corresponding task sequence can complete its execution successfully;otherwise,nonschedulable transitions should be pinpointed to help adjust timing constraints.Secondly,a technique for compositional timing analysis is also proposed to deal with complex transition sequences.In addition,concept of temporal consistency is also introduced.