摘要
基于受控系统可达状态数最多的标准,提出了最优基本信标的思想,一组信标如果与之相对的从属信标都是强从属信标就可以确保目标网系统动态性能最优.在此基础上,以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法.实验结果表明采用相同的控制策略,最优基本信标可以使目标网系统在添加尽可能少的控制库所的同时生成尽可能多的许可行为.
Petri nets are used to model the concurrent execution and the deadlock problem in a flexible manufacturing system（FMS）. With the number of reachable states in the controlled system being the criterion, an idea of the optimal set of elementary siphons is illustrated. A set of siphons can be used to optimize the dynamical behavior of the resultant system if their corresponding dependant siphons are all strictly dependant ones. Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons. Experimental results show that the optimal set of elementary siphons ensures more permissive behavior with fewer controlling places in the controlled net system when the same deadlock control policy is applied.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2006年第4期607-611,共5页
Journal of Xidian University
基金
国家自然科学基金资助项目(60474018)
教育部归国留学人员基金资助项目(2004-527)
关键词
PETRI网
死锁预防
最优基本信标
柔性制造系统
Petri net
deadlock prevention
optimal set of elementary siphons
flexible manufacturingsystem（FMS）
