时间约束Petri网的可调度性分析研究

Studies about Schedulability Analysis of Timing Constraint Petri Nets

1 引言时间约束Petri网(Timing Constraint PetriNets,TCPN’s)是具有广义时间约束的Petri网,它综合了时间Petri网)(Time Petri Nets)和赋时Petri网(Timed Petri Nets)的共同特点,具有经典Petri网的理论基础和额外的时间约束能力。在实时系统建模中,它可对其它与时间有关的Petri网所不能描述的冲突结构进行建模和分析。TCPN’s使用弱触发规则,即:使能的变迁可触发也可不触发。

The timing constiaint Petri nets are a class of Petri nets which have general time constraints. At present,the studies about state reachability of TCPN' s are only restricted to some simple nets. This paper gives more general analysis method of reachability,and discusses the analysis of schedulability of TCPN' s with general topology structure through deeply investigating the TCPN' s.