Petri网中最小虹吸管计算的一些结果

R. Cordone, L. Ferrarini, L. Piroddi
{"title":"Petri网中最小虹吸管计算的一些结果","authors":"R. Cordone, L. Ferrarini, L. Piroddi","doi":"10.1109/CDC.2003.1271733","DOIUrl":null,"url":null,"abstract":"The problem addressed in the paper is that of computing minimal siphons in standard Petri nets. In particular, some new theoretical results are stated and proved which aim at reducing the original problem to a set of smaller sub-problems. Based on that, a conceptual algorithm is proposed which efficiently computes a set of siphons containing the minimal siphons of a net. An experimental prototypical version of the proposed search algorithm has been developed and a campaign on a large set of random test instances has been carried out to evaluate the effectiveness and efficiency of the proposed method.","PeriodicalId":371853,"journal":{"name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Some results on the computation of minimal siphons in Petri nets\",\"authors\":\"R. Cordone, L. Ferrarini, L. Piroddi\",\"doi\":\"10.1109/CDC.2003.1271733\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem addressed in the paper is that of computing minimal siphons in standard Petri nets. In particular, some new theoretical results are stated and proved which aim at reducing the original problem to a set of smaller sub-problems. Based on that, a conceptual algorithm is proposed which efficiently computes a set of siphons containing the minimal siphons of a net. An experimental prototypical version of the proposed search algorithm has been developed and a campaign on a large set of random test instances has been carried out to evaluate the effectiveness and efficiency of the proposed method.\",\"PeriodicalId\":371853,\"journal\":{\"name\":\"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2003.1271733\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2003.1271733","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22

摘要

本文讨论的问题是标准Petri网中最小虹吸管的计算问题。特别地,提出并证明了一些新的理论结果,这些结果旨在将原问题简化为一组更小的子问题。在此基础上,提出了一种有效计算包含网中最小虹吸管的一组虹吸管的概念算法。所提出的搜索算法的实验原型版本已经开发出来,并在大量随机测试实例上进行了一项运动,以评估所提出方法的有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Some results on the computation of minimal siphons in Petri nets
The problem addressed in the paper is that of computing minimal siphons in standard Petri nets. In particular, some new theoretical results are stated and proved which aim at reducing the original problem to a set of smaller sub-problems. Based on that, a conceptual algorithm is proposed which efficiently computes a set of siphons containing the minimal siphons of a net. An experimental prototypical version of the proposed search algorithm has been developed and a campaign on a large set of random test instances has been carried out to evaluate the effectiveness and efficiency of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信