论文部分内容阅读
时间约束PETRI 网是具有广义时间约束的一类PETRI 网.目前有关TCPNS 可调度性分析的研究仅局限于一些较简单的网,文章通过对TCPNS 的进一步研究,给出了更一般的变迁可调度决策算法.“,”Timing Constraint Petri Nets are the class of petri nets which have generaltime constraints. At present, studies about schedulability analysis of TCPN’s onlyrestrictto some simple nets.This paper further studies TCPN’s, and shows more general decision algorithm oftransition schedulability.