摘要
时间约束 Petri网是具有广义时间约束的一类 Petri网。目前有关 TCPN状态可达性的研究仅局限于一些较简单的网 ,本文通过对 TCPN的进一步研究 ,给出了更一般的状态可达性分析方法 ,并讨论了一般拓扑结构 TCPN的可调度分析。
The timing constraint Petri nets are a class of Petri nets which have general time constraints.At present,the study on the state reachability of TCPN is only involved in some simple nets.This pa per gives more general analysis methods for reachability,and discusses the analy sis of TCPN schedulability with general topology structures through deeply inves tigating the TCPN.
出处
《计算机工程与科学》
CSCD
2000年第3期60-63,共4页
Computer Engineering & Science
关键词
时间约束
PETRI网
可达性分析
timing constraint Petri nets
Petri nets
sche dulability analysis
decision variable
