摘要
在系统地研究了时间约束 Petri网的基础上 ,提出了一般的状态可达性分析方法。通过讨论任意拓扑结构 TCPN′s的可调度分析 ,克服了以往 TCPN′s可达性分析方法的局限性 ,显示了该方法的准确性和实用性。
A general analysis method of state reachability is proposed based on systematically investigating timing constraint Petri nets.Through discussing schedulability analysis of TCPN′s with any topology structure,the limitation of existing reachability analysis method about TCPN′s is overcome,then the veracity and practicability of proposed method are demonstrated.
出处
《控制与决策》
EI
CSCD
北大核心
2000年第5期609-612,共4页
Control and Decision
关键词
时间约束
PETRI网
决策变量
可调度性分析
timing constraint Petri nets, Petri nets, schedulability analysis, decision variables
