论文部分内容阅读
时间约束Petri网是具有广义时间约束的一类Petri网。时间约束的引入使TCPN’s的演化与系统每一时刻的状态密切相关，导致网的动态复杂性。目前有关TCPN’s状态可达性的研究仅局限于一些较简单的网，该文通过对TCPN’s的进一步研究，给出了更一般的可达性分析方法及变迁可调度决策算法，并讨论了含冲突结构的TCPN’s的可调度分析。
Time constraints Petri nets are a class of Petri nets with generalized time constraints. The introduction of time constraints makes the evolution of TCPN’s closely related to the state of the system at each moment, leading to the dynamic complexity of the network. At present, the research on TCPN’s state reachability is limited to some simpler networks. Based on the further study of TCPN’s, this paper gives a more general reachability analysis method and a changeable schedulable decision algorithm, Structural TCPN’s Schedulability Analysis.