活体自由选择Petri网的可达性准则

T. Matsumoto
{"title":"活体自由选择Petri网的可达性准则","authors":"T. Matsumoto","doi":"10.1109/APCAS.1996.569288","DOIUrl":null,"url":null,"abstract":"Reachability problem is one of big issues in Petri net theory and it is reduced to that of free choice nets. However, a useful criterion has not been obtained for them. In this paper, some useful discussions on reachability of live free choice nets are presented; a net reduction method for a given net to the net with siphon/trap and a concept of immature siphon/trap are shown to judge the reachability of a given net.","PeriodicalId":20507,"journal":{"name":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reachability criterion of live free choice Petri nets\",\"authors\":\"T. Matsumoto\",\"doi\":\"10.1109/APCAS.1996.569288\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reachability problem is one of big issues in Petri net theory and it is reduced to that of free choice nets. However, a useful criterion has not been obtained for them. In this paper, some useful discussions on reachability of live free choice nets are presented; a net reduction method for a given net to the net with siphon/trap and a concept of immature siphon/trap are shown to judge the reachability of a given net.\",\"PeriodicalId\":20507,\"journal\":{\"name\":\"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCAS.1996.569288\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of APCCAS'96 - Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCAS.1996.569288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

可达性问题是Petri网理论中的一个重要问题,它被简化为自由选择网的可达性问题。然而,对它们还没有一个有用的标准。本文对自由选择网的可达性进行了一些有益的讨论;用一种将给定的网减少到带有虹吸/疏水器的网的方法和一个不成熟虹吸/疏水器的概念来判断给定网的可达性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Reachability criterion of live free choice Petri nets
Reachability problem is one of big issues in Petri net theory and it is reduced to that of free choice nets. However, a useful criterion has not been obtained for them. In this paper, some useful discussions on reachability of live free choice nets are presented; a net reduction method for a given net to the net with siphon/trap and a concept of immature siphon/trap are shown to judge the reachability of a given net.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Delay analysis of coupled transmission lines Fast iterative image restoration algorithms The roundoff noise analysis for block digital filters realized in cascade form A regenerator section overhead processing chip set for STM-64 Recent trends in image restoration and enhancement techniques
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1