一类Petri网和在确定多项式时间内可解的可达性问题

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

Keiko Nakamura, Kiyohiko Nakamura, A. Ichikawa

{"title":"一类Petri网和在确定多项式时间内可解的可达性问题","authors":"Keiko Nakamura, Kiyohiko Nakamura, A. Ichikawa","doi":"10.1109/PNPM.1989.68559","DOIUrl":null,"url":null,"abstract":"The computational complexity of reachability problems for Petri nets is analyzed and a new class of Petri nets is introduced. A net of the class is composed of subnets of state machines. Sufficient conditions on initial and target markings are obtained under which the reachability problem for the class is solvable in deterministic polynomial time. Also presented is an algorithm that examines in deterministic polynomial time whether a Petri net is in the class.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A class of Petri nets and a reachability problem solvable in deterministic polynomial time\",\"authors\":\"Keiko Nakamura, Kiyohiko Nakamura, A. Ichikawa\",\"doi\":\"10.1109/PNPM.1989.68559\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The computational complexity of reachability problems for Petri nets is analyzed and a new class of Petri nets is introduced. A net of the class is composed of subnets of state machines. Sufficient conditions on initial and target markings are obtained under which the reachability problem for the class is solvable in deterministic polynomial time. Also presented is an algorithm that examines in deterministic polynomial time whether a Petri net is in the class.<<ETX>>\",\"PeriodicalId\":366060,\"journal\":{\"name\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.68559\",\"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.68559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

分析了Petri网可达性问题的计算复杂度，并引入了一类新的Petri网。该类的网络由状态机的子网组成。得到了初始标记和目标标记存在的充分条件，在此条件下，该类可达性问题在确定性多项式时间内可解。本文还提出了一种在确定多项式时间内检测Petri网是否在类中的算法。

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

查看原文本刊更多论文

A class of Petri nets and a reachability problem solvable in deterministic polynomial time

The computational complexity of reachability problems for Petri nets is analyzed and a new class of Petri nets is introduced. A net of the class is composed of subnets of state machines. Sufficient conditions on initial and target markings are obtained under which the reachability problem for the class is solvable in deterministic polynomial time. Also presented is an algorithm that examines in deterministic polynomial time whether a Petri net is in the class.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量