S^3PR网的可达标识集算法  

Method to compute the reachability set of S^3PR

作　　者：张秀艳[1] 钟春富[1] 贾建援[1] 

机构地区：[1]西安电子科技大学机电工程学院,陕西西安710071

出　　处：《西安电子科技大学学报》2015年第5期105-109,共5页Journal of Xidian University

基　　金：国家自然科学基金资助项目(51305325);中央高校基本科研业务费专项资金资助项目(XJS15039)

摘　　要：针对具有特定资源库所的S3PR网,提出了一种基于P不变式和严格极小信标的计算可达标识集的新方法.首先计算出由P不变式所确定的不变式标识集,再通过分析严格极小信标中相应库所的托肯数与其界的关系,提出判定标识是否为伪标识的判定定理,并基于判定定理有效求解伪标识集,最终通过剔除不变式标识集中的伪标识来获得可达标识集.实验结果表明,采用所提的方法,可以快速有效地计算出S3PR网中的可达标识集.This paper proposes a novel approach to computing the reachability set by using place invariants and strict minimal siphons for S3 PR with specific resource places.First,the set of invariant markings is enumerated.Then a necessary and sufficient condition is developed to decide whether a marking is spurious by analyzing the relationship between the number of tokens in the corresponding places of any strict minimal siphon and their bounds.In addition,the spurious markings are calculated.Finally,the reachability set of the net is generated by removing all the spurious markings from the set of invariant markings.Experimental results show the efficiency of the proposed method.

关 键 词：PETRI网 严格极小信标 P不变式 可达标识集 死锁控制 

分 类 号：TP271.8[自动化与计算机技术—检测技术与自动化装置]