一类Petri网可达标识数的有效计算方法  

Effective enumeration of reachable markings for a class of Petri Nets

作　　者：洪良[1] 周健[1] 

机构地区：[1]西安工程大学电子信息学院,陕西西安710048

出　　处：《西安工程大学学报》2015年第5期606-610,629,共6页Journal of Xi’an Polytechnic University

基　　金：陕西省自然科学基础研究计划资助项目(2015JQ6258)

摘　　要：S3PR网是Petri网的一个子类,基于组合学提出一种计算S3PR网可达标识数的代数方法.首先,通过组合学计算S3PR网可达标识数的上限。然后,基于资源回路理论,计算包含2个以及3个资源库所的信标,进而找到大部分甚至全部不可达标识的数量.最后,由可达标识数上限减去不可达标识,得到估算的可达标识数.该方法的性能通过例子计算与分析进行了验证.结果显示该方法可以在较短时间内计算出S3PR网的可达标识数,有助于可达图的生成.An S3PR is a class of Petri Nets. This work proposes a combinatorics based method that deals with an approximate calculation of the number of reachable markings of an SaPR in an algebraic way. First,an upper bound of reachable markings of an S3 PR can be found by combinatorics. Second, the number of most even all unreachable markings can be obtained by ex- tracting siphons with two and three resource places from resource circuits. Finally, the number of reachable markings can be estimated by removing the unreachable ones from the upper bound. Example calculations and analyses show the performance of the proposed method. The result shows that the number of reachable markings of an SaPR can be calculated by the pro- posed method in a short period of time, which contributes to the generation of reachability graphs.

关 键 词：柔性制造系统 PETRI网 信标 可达标识 

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