Polynomial-complexity Deadlock Avoidance Policies for Automated Manufacturing Systems
-
摘要: 基于系统 Petri 网模型, 研究自动制造系统的避免死锁问题. 对不含中心资源的制造系统, 证明了它只包含安全和死锁两类可达状态. 通过一步向前看的方法, 给出了系统多项式时间复杂性的最佳避免死锁策略. 对一般系统定义了一种辅助 Petri 网. 利用辅助网的最佳避免死锁策略, 提出了综合一般制造系统多项式复杂性的避免死锁策略的方法.Abstract: Based on Petri net models, this paper addresses the deadlock avoidance problem in automated manufacturing systems. First, for manufacturing systems without center resources, it is proved that the systems have only two kinds of reachable states---safe and deadlock. An optimal or maximally permissive deadlock avoidance policy with polynomial online-computation complexity is obtained through one-step look-ahead. Then, for a general system, an auxiliary Petri net is introduced. By applying the presented design method of optimal deadlock avoidance policy to the auxiliary net, a suboptimal polynomial-complexity deadlock avoidance policy for the general system is obtained.
-
Key words:
- Manufacturing systems /
- deadlock /
- Petri net /
- complexity /
- control policy
-
点击查看大图
计量
- 文章访问数: 3270
- HTML全文浏览量: 66
- PDF下载量: 1177
- 被引次数: 0
下载:
