{"title":"非循环结构良好工作流网络的可达性研究","authors":"S. Yamaguchi","doi":"10.1109/ICNC.2012.83","DOIUrl":null,"url":null,"abstract":"Workflow net is a particular class of Petri net for verifying the correctness of workflows. Reach ability problem for workflow nets plays an important role in the verification, but the problem is known to be intractable. Limiting our analysis to a subclass of workflow net, called a cyclic well-structured workflow net, we gave a necessary and sufficient condition on the reach ability problem. Based on this condition, we also constructed a polynomial time procedure for solving the problem.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On Reachability in Acyclic Well-Structured Workflow Nets\",\"authors\":\"S. Yamaguchi\",\"doi\":\"10.1109/ICNC.2012.83\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Workflow net is a particular class of Petri net for verifying the correctness of workflows. Reach ability problem for workflow nets plays an important role in the verification, but the problem is known to be intractable. Limiting our analysis to a subclass of workflow net, called a cyclic well-structured workflow net, we gave a necessary and sufficient condition on the reach ability problem. Based on this condition, we also constructed a polynomial time procedure for solving the problem.\",\"PeriodicalId\":442973,\"journal\":{\"name\":\"2012 Third International Conference on Networking and Computing\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2012.83\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Reachability in Acyclic Well-Structured Workflow Nets
Workflow net is a particular class of Petri net for verifying the correctness of workflows. Reach ability problem for workflow nets plays an important role in the verification, but the problem is known to be intractable. Limiting our analysis to a subclass of workflow net, called a cyclic well-structured workflow net, we gave a necessary and sufficient condition on the reach ability problem. Based on this condition, we also constructed a polynomial time procedure for solving the problem.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
