{"title":"UML活动图中可达性问题的计算复杂性","authors":"Xing Tan, M. Gruninger","doi":"10.1109/ICICISYS.2009.5358318","DOIUrl":null,"url":null,"abstract":"The reachability problem, the problem of checking whether certain node can be reached from some initial settings such that all restrictions on flow of control are satisfied, arises frequently in various applications of Unified Modeling Language activity diagrams. However, the complexity of the problem, or in fact the complexity of any general problem in UML activity diagrams, has yet to be investigated. Towards this initiative, we specify a class of diagrams where the reachability problem is PSPACE-complete. However, if one further condition is applied, it can be shown that the problem is NP-complete.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the computational complexity of the reachability problem in UML activity diagrams\",\"authors\":\"Xing Tan, M. Gruninger\",\"doi\":\"10.1109/ICICISYS.2009.5358318\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The reachability problem, the problem of checking whether certain node can be reached from some initial settings such that all restrictions on flow of control are satisfied, arises frequently in various applications of Unified Modeling Language activity diagrams. However, the complexity of the problem, or in fact the complexity of any general problem in UML activity diagrams, has yet to be investigated. Towards this initiative, we specify a class of diagrams where the reachability problem is PSPACE-complete. However, if one further condition is applied, it can be shown that the problem is NP-complete.\",\"PeriodicalId\":206575,\"journal\":{\"name\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2009.5358318\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2009.5358318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the computational complexity of the reachability problem in UML activity diagrams
The reachability problem, the problem of checking whether certain node can be reached from some initial settings such that all restrictions on flow of control are satisfied, arises frequently in various applications of Unified Modeling Language activity diagrams. However, the complexity of the problem, or in fact the complexity of any general problem in UML activity diagrams, has yet to be investigated. Towards this initiative, we specify a class of diagrams where the reachability problem is PSPACE-complete. However, if one further condition is applied, it can be shown that the problem is NP-complete.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
