...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Computers >A Fast Method for Extracting all Minimal Siphons from Maximal Unmarked Siphons of a Petri Net
【24h】

A Fast Method for Extracting all Minimal Siphons from Maximal Unmarked Siphons of a Petri Net

机译：从Petri网的最大无标记虹吸管中提取所有最小虹吸管的快速方法

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, a fast method named algorithm 2is proposed to extract all minimal siphons from maximalunmarked siphons obtained by the MIP-based deadlockdetection method. Redundant computation is the majordisadvantage of an existing method named algorithm 1 andit greatly decreases the computational efficiency of minimalsiphons. In order to resolve this problem, the proposedmethod improves from three aspects. Firstly, no sink placesand transitions exist in the subnet of the tree. Secondly,no equal non-null node exists in the tree. Thirdly, if theremoval of one place from a subnet node leads to theremoval of all places in this node, the same place of its sonnode is unnecessary to compute repeatedly. The applicationsof algorithm 2 are illustrated with FMS examples in thefollowing sections and comparison of algorithm 1 withalgorithm 2 is also presented. At the end, the result fromexperiment shows that the proposed method has higherefficiency.
机译：本文提出了一种快速的算法2，该算法从基于MIP的死锁检测方法获得的最大未标记虹吸管中提取所有最小虹吸管。冗余计算是称为算法1的现有方法的主要缺点，它极大地降低了最小虹吸的计算效率。为了解决这个问题，提出的方法从三个方面进行了改进。首先，树的子网中不存在汇的位置和过渡。其次，树中不存在相等的非空节点。第三，如果从子网节点移出一个位置导致该节点中所有位置都移出，则其子节点的相同位置无需重复计算。以下部分以FMS示例说明算法2的应用，并给出算法1与算法2的比较。最后，实验结果表明该方法具有较高的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号