Petri网的合法发射顺序及相关问题

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI:10.1109/PNPM.1989.68561

Toshimasa Watanabe, Y. Mizobata, K. Onaga

{"title":"Petri网的合法发射顺序及相关问题","authors":"Toshimasa Watanabe, Y. Mizobata, K. Onaga","doi":"10.1109/PNPM.1989.68561","DOIUrl":null,"url":null,"abstract":"Development of computational tools and techniques dealing with large-scale Petri nets will provide a firm foundation of Petri net theory. A discussion is presented of the computational complexity aspect of the legal firing sequence problem (LFS) and some related problems of Petri nets, each having applications to practical problems. Their NP-completeness and polynomial-time solvability are presented.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"Legal firing sequence and related problems of Petri nets\",\"authors\":\"Toshimasa Watanabe, Y. Mizobata, K. Onaga\",\"doi\":\"10.1109/PNPM.1989.68561\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Development of computational tools and techniques dealing with large-scale Petri nets will provide a firm foundation of Petri net theory. A discussion is presented of the computational complexity aspect of the legal firing sequence problem (LFS) and some related problems of Petri nets, each having applications to practical problems. Their NP-completeness and polynomial-time solvability are presented.<<ETX>>\",\"PeriodicalId\":366060,\"journal\":{\"name\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1989.68561\",\"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 the Third International Workshop on Petri Nets and Performance Models, PNPM89","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1989.68561","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 43

摘要

处理大规模Petri网的计算工具和技术的发展将为Petri网理论提供坚实的基础。讨论了合法发射序列问题(LFS)的计算复杂性和Petri网的一些相关问题，每个问题都有实际应用。给出了它们的np完备性和多项式时间可解性

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Legal firing sequence and related problems of Petri nets

Development of computational tools and techniques dealing with large-scale Petri nets will provide a firm foundation of Petri net theory. A discussion is presented of the computational complexity aspect of the legal firing sequence problem (LFS) and some related problems of Petri nets, each having applications to practical problems. Their NP-completeness and polynomial-time solvability are presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89

自引率

0.00%

发文量