{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:47:59Z","timestamp":1771699679266,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"Alexander von Humboldt Foundation of Germany"},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61572360"],"award-info":[{"award-number":["61572360"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["91218301"],"award-info":[{"award-number":["91218301"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003024","name":"Shanghai Education Development Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission through the Shuguang Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2016]]},"DOI":"10.1109\/access.2016.2597061","type":"journal-article","created":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T18:08:48Z","timestamp":1470074928000},"page":"4104-4118","source":"Crossref","is-referenced-by-count":44,"title":["A Branching-Process-Based Method to Check Soundness of Workflow Systems"],"prefix":"10.1109","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7523-4827","authenticated-orcid":false,"given":"Guanjun","family":"Liu","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Reisig","sequence":"additional","affiliation":[]},{"given":"Changjun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Mengchu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-65306-6_21"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02144-2_34"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1555392.1555395"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384314"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"ref37","first-page":"131","article-title":"Model checking and abstraction for workflow net verification","author":"tiplea","year":"2004","journal-title":"1st International Workshop on Coordination and Petri Nets"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2008.916747"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4"},{"key":"ref34","author":"peterson","year":"0","journal-title":"Petri Net Theory and the Modeling of Systems"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.3233\/FI-2013-782","article-title":"Branching processes of general Petri nets","volume":"122","author":"couvreur","year":"2013","journal-title":"Fundamenta Informaticae"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.4.246"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/2370405"},{"key":"ref12","first-page":"295","article-title":"Decidability problems of a basic class of object nets","volume":"79","author":"dietze","year":"2007","journal-title":"Fundamenta Informat"},{"key":"ref13","first-page":"65","article-title":"Cooperating sequential processes","author":"dijkstra","year":"2002","journal-title":"The Origin of Concurrent Programming"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2007.902622"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BFb0055044","article-title":"Reset nets between decidability and undecidability","author":"dufourd","year":"1998","journal-title":"Automata Languages and Programming"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/201024.201038"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01463946"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.01.004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31131-4_2"},{"key":"ref28","first-page":"12","article-title":"On compatibility of Web services","volume":"65","author":"martens","year":"2003","journal-title":"Petri Net Newslett"},{"key":"ref4","first-page":"3","article-title":"Beyond asymmetric choice: A note on some extensions","volume":"55","author":"van der aalst","year":"1998","journal-title":"Petri Net Newsletter"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.3233\/FI-2014-1005","article-title":"Complexity of the soundness problem of workflow Nets","volume":"131","author":"liu","year":"2014","journal-title":"Fundamenta Informaticae"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-010-0161-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45397-0_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56496-9_14"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01918-0_2"},{"key":"ref8","first-page":"545","article-title":"Verification on infinite structures","author":"burkart","year":"2000","journal-title":"Handbook of Process Algebra"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45594-9_11"},{"key":"ref9","author":"clarke","year":"1999","journal-title":"Model checking"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00982-2_6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-014-0426-0"},{"key":"ref22","first-page":"83","article-title":"Minimizing finite complete prefixes","author":"heljanko","year":"1999","journal-title":"Proc Workshop Concurrency Specification Program (CS P)"},{"key":"ref21","author":"garey","year":"1976","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73094-1_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0122-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.96"},{"key":"ref23","article-title":"Model checking based on prefixes of Petri net unfoldings","author":"khomenko","year":"2003"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxp118"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-008-9196-x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2003.819490"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/6287639\/7419931\/07527679.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7419931\/07527679.pdf?arnumber=7527679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:48Z","timestamp":1642004808000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7527679\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2016.2597061","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}