{"title":"BUCKER: A basic unfolding based checker for soundness of workflow systems","authors":"Kun Zhang, Guanjun Liu, Dongming Xiang","doi":"10.1109/ICNSC.2017.8000161","DOIUrl":null,"url":null,"abstract":"Soundness is an important property of WF-net (workflow net). It guarantees the correct execution of workflow systems without deadlocks or livelocks. The traditional method of verifying soundness is based on reachability graph. However, it suffers from the state space explosion problem. The unfolding technique of Petri nets can effectively alleviate this problem. Our previous work proposed the concept of basic unfolding and gave a necessary and sufficient condition to decide soundness based on it. This paper introduces the related tool we developed. After a WF-net is input in this tool, its basic unfolding can be generated, and then its soundness can be verified. Moreover, some cases show the effectiveness of our tool, and we also give some experiments to illustrate the advantages of the basic unfolding technique compared with the reachability graph technique.","PeriodicalId":145129,"journal":{"name":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 14th International Conference on Networking, Sensing and Control (ICNSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNSC.2017.8000161","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Soundness is an important property of WF-net (workflow net). It guarantees the correct execution of workflow systems without deadlocks or livelocks. The traditional method of verifying soundness is based on reachability graph. However, it suffers from the state space explosion problem. The unfolding technique of Petri nets can effectively alleviate this problem. Our previous work proposed the concept of basic unfolding and gave a necessary and sufficient condition to decide soundness based on it. This paper introduces the related tool we developed. After a WF-net is input in this tool, its basic unfolding can be generated, and then its soundness can be verified. Moreover, some cases show the effectiveness of our tool, and we also give some experiments to illustrate the advantages of the basic unfolding technique compared with the reachability graph technique.