摘要
基于整数规划提出了一种在Petri网部分可达图范围内求解危险标识的算法.该算法首先从死标识的定义出发,结合结构不变式(P-不变式),求出Petri网的所有死标识;再利用状态方程,推算出到达这些死锁标识的坏标识及危险标识(如果Petri网不含有这些特殊标识,则输出结果为空集);最后,用一个制造系统的Petri网对该算法进行仿真.仿真结果表明,使用该算法求解网的特殊标识(死标识和危险标识),是通过求解部分可达标识实现的.该算法有效减小了算法的搜索空间,避免了Petri网的状态空间爆炸问题.
This paper proposes a method to find the set of dangerous markings of Petri nets based on integer programming by computing a partial set of reachability markings. The proposed method can be used to find all deadlock markings by employing the definition of deadlock markings and the structure information (P-invariant) on Petri nets. Then the state equation is used to derive the sets of bad and dangerous markings. Finally, using the Petri net model of a manufacturing system, we verify the computation of special markings(such as deadlock markings and dangerous markings). Experimental results show that the special markings can be computed by obtaining the partial reachability graph, which reduces state the space explosion problem.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2013年第6期85-91,共7页
Journal of Xidian University
基金
国家自然科学基金资助项目(61074035)
教育部高等学校博士点基金资助项目(20090203110009)
关键词
整数规划
PETRI网
危险状态
死锁控制
integer programming
Petri nets
dangerous markings
deadlock control