时间约束Petri网的状态可达及可调度分析算法  

State Reachability and Schedulability Analysis Algorithm of Timing Constraint Petri Nets

作　　者：李慧芳[1] 李人厚[1] 陈浩勋[1] 

机构地区：[1]西安交通大学系统工程研究所,西安710049

出　　处：《计算机工程与应用》2000年第7期59-61,70,共4页Computer Engineering and Applications

摘　　要：时间约束Petri网是具有广义时间约束的一类Petri网。时间约束的引入使TCPN’s的演化与系统每一时刻的状态密切相关，导致网的动态复杂性。目前有关TCPN’s状态可达性的研究仅局限于一些较简单的网，该文通过对TCPN’s的进一步研究，给出了更一般的可达性分析方法及变迁可调度决策算法，并讨论了含冲突结构的TCPN’s的可调度分析。Timing Constraint Petri Nets are the class of petri nets which have general time consbonts. The introdction of time constaints makes the involution of TCPN's closely relate to the system states at each moment,which results in dynamic complexity of TCPN's. At present, studies on state reachability of TCPN's only restrict to some simple nets.This paper forther studies TCPN's,and shows more general analysis method of reachability and decision algorithm of schedtilability,and discusses analysis of schedulability of TCPN's including conflict structures.

关 键 词：时间约束 PETRI网 可调度分析 决策变量 算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]