一般Petri网可达性问题的原始递归算法

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI:10.1109/SFCS.1998.743436

Zakaria Bouziane

{"title":"一般Petri网可达性问题的原始递归算法","authors":"Zakaria Bouziane","doi":"10.1109/SFCS.1998.743436","DOIUrl":null,"url":null,"abstract":"E. Mayr and R. Kosaraju (1981) proved the decidability of the general Petri net reachability problem. However their algorithms are non primitive recursive. Since then the primitive recursiveness of this problem was stated as an open problem. In this paper we give a double exponential space algorithm for the general Petri net reachability problem.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"A primitive recursive algorithm for the general Petri net reachability problem\",\"authors\":\"Zakaria Bouziane\",\"doi\":\"10.1109/SFCS.1998.743436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"E. Mayr and R. Kosaraju (1981) proved the decidability of the general Petri net reachability problem. However their algorithms are non primitive recursive. Since then the primitive recursiveness of this problem was stated as an open problem. In this paper we give a double exponential space algorithm for the general Petri net reachability problem.\",\"PeriodicalId\":228145,\"journal\":{\"name\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1998.743436\",\"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 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1998.743436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

E. Mayr和R. Kosaraju(1981)证明了一般Petri网可达性问题的可决性。然而，它们的算法是非原始递归的。从那时起，这个问题的原始递归性被声明为一个开放问题。本文给出了一般Petri网可达性问题的一种双指数空间算法。

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

查看原文本刊更多论文

A primitive recursive algorithm for the general Petri net reachability problem

E. Mayr and R. Kosaraju (1981) proved the decidability of the general Petri net reachability problem. However their algorithms are non primitive recursive. Since then the primitive recursiveness of this problem was stated as an open problem. In this paper we give a double exponential space algorithm for the general Petri net reachability problem.

求助全文

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

来源期刊

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)

自引率

0.00%

发文量