{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T11:07:58Z","timestamp":1742641678665,"version":"3.37.3"},"reference-count":40,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T00:00:00Z","timestamp":1581379200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862065","61662085","61702442"],"award-info":[{"award-number":["61862065","61662085","61702442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862065","61662085","61702442"],"award-info":[{"award-number":["61862065","61662085","61702442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61862065","61662085","61702442"],"award-info":[{"award-number":["61862065","61662085","61702442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,2,11]]},"abstract":"<jats:p>With the increasing popularity of cloud computing, especially the emergence of Business Process as a Service (BPaaS), more and more enterprises construct their process collaborations based on BPaaS services. Indeed, the collaborative business process built by BPaaS services can be seen as a complex system, as it covers multiple business processes (i.e., BPaaS services) and they act independently. Since business processes corresponding to BPaaS services are usually provided by different cloud service providers, and their interactions are unforeseen in advance, in actual execution, some behavioral anomalies (e.g., deadlocks) may occur. To this end, based on BPaaS services, we propose an approach to build process collaborations in the cloud. In this approach, we first model collaborative business processes using open nets. Then, we check their correctness based on stubborn sets. Finally, in case they are partially correct, we generate reliable paths for the coordination execution between business processes. Our approach is implemented in the PIPE (an open tool for Petri nets) and evaluated on actual cases that show its effectiveness and efficiency.<\/jats:p>","DOI":"10.1155\/2020\/2751084","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T18:30:53Z","timestamp":1581445853000},"page":"1-11","source":"Crossref","is-referenced-by-count":2,"title":["A Correctness Checking Approach for Collaborative Business Processes in the Cloud"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3438-5303","authenticated-orcid":true,"given":"Qi","family":"Mo","sequence":"first","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}]},{"given":"Yuqi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}]},{"given":"Jixiang","family":"Xiang","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3257-213X","authenticated-orcid":true,"given":"Tong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Big Data, Yunnan Agricultural University, Kunming 650091, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1327512.1327513"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0007-6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2749"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2005.03.008"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2926097"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2018.2844247"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/tsmc.2014.2334276"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2838053"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s10796-009-9164-1"},{"issue":"9","key":"13","first-page":"1892","volume":"54","year":"2017","journal-title":"Journal of Computer Research and Development"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2018.09.007"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2008.916747"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2037018"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.06.005"},{"year":"1989","key":"18"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2011.08.004"},{"year":"2011","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2961346"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2012.2188511"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.07.003"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2868924"},{"volume-title":"Stubborn sets for simple linear time properties","year":"2012","key":"25"},{"key":"26","first-page":"282","volume-title":"Improved question-guided stubborn set methods for state properties","volume":"1825","year":"2000"},{"year":"2009","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.12.005"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1049\/iet-sen.2008.0062"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2009.08.004"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.06.006"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2018.05.008"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.3724\/sp.j.1016.2012.02169"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.12.044"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.09.010"},{"issue":"2","key":"37","first-page":"709","volume":"54","year":"2017","journal-title":"Information and Software Technology"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2434"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.055"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00684-y"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.01.012"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2019.2944007"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2906925"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2936869"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2751084.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2751084.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2751084.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T18:30:58Z","timestamp":1581445858000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/2751084\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,11]]},"references-count":40,"alternative-id":["2751084","2751084"],"URL":"https:\/\/doi.org\/10.1155\/2020\/2751084","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2020,2,11]]}}}