摘要
作为Petri网的一个结构性目标,信标在柔性制造系统死锁控制理论中起着关键的作用。基于Petri网图论和信标的定义,针对Petri的一类子网S4PR网,提出了一种极小信标的计算方法。首先找出S4PR网的初始资源图,然后根据初始资源图找到所有的资源子图,对应每一个资源子图计算其对应的信标,最后根据极小信标的定义对得到的信标进行判断,删除非极小信标即得到所有的极小信标。给出一个S4PR网的例子解释提出的计算方法的应用,和传统的极小信标的计算方法比较,该计算方法可以节约计算时间,另外该算法可以用于任意规模的S4PR网的极小信标的计算。
As a structural object of Petri nets, siphons play an important role in the development ofdeadlock control policies for FMS. Based on graph theory and siphon definition, a method to compute theminimal siphons for a class of Petri nets is proposed. First, the initial resource digraph of N is found.Second, all subgraph of are found. Third, all siphons are computed. Forth, all minimal siphons aredetermined by removing siphons that are not minimal. An example is used to illustrate the application ofthe proposed method, and computation time is reduced by comparing with traditional method. In additionthe algorithm can be used compute minimal siphons for any size S4PR network.
出处
《科技通报》
北大核心
2014年第9期152-156,共5页
Bulletin of Science and Technology
基金
访问学者期间课题<柔性自动制造系统死锁问题研究>
