.png){kind=icon}
返回
An Improved Mixed-Integer Programming Method to Compute Emptiable Minimal Siphons in S3PR Nets
.png){kind=icon}
PRE
AI
DOI：10.1109/TCST.2017.2754982.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Emptiable minimal siphons (EMSs) play a key role in the development of many deadlock control policies for resource allocation systems modeled with Petri nets. Recent research results show that siphon-based deadlock prevention methods can avoid complete siphon enumeration by using mixed-integer programming (MIP). This brief proposes a novel MIP approach, called MIP' for short, to compute EMSs for deadlock control in a class of Petri nets, i.e., a system of simple sequential processes with resources ((SPR)-P-3). Compared with classical MIP, since MIP' utilizes the structural characteristics of (SPR)-P-3 nets to compute EMSs and more constraints are included in it, its solution space is drastically narrowed. As a result, the number of iterations to solve the MIP' problem is significantly reduced, and the computational efficiency is considerably improved. Comparisons are provided on several (SPR)-P-3 nets to show its superior efficiency.
Keyword:
Deadlocks
liveness
mixed-integer programming (MIP)
Petri nets
siphons
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
4.9K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容