{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:11:10Z","timestamp":1762459870760,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51831-8_10","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"196-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7523-4827","authenticated-orcid":false,"given":"Guanjun","family":"Liu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"10_CR1","first-page":"335","volume":"34","author":"WMP van der Aalst","year":"1999","unstructured":"van der Aalst, W.M.P.: Interorganizational Workflows: an approach based on message sequence charts and petri nets. Syst. Anal. Model. 34, 335\u2013367 (1999)","journal-title":"Syst. Anal. Model."},{"key":"10_CR2","unstructured":"van der Aalst, W.M.P.: Structural characterizations of sound workflow nets. Computing Science Report 96\/23, Eindhoven University of Technology (1996)"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"WMP van der Aalst","year":"2011","unstructured":"van der Aalst, W.M.P., et al.: Soundness of workflow nets: classification, decidability, and analysis. Form. Aspects Comput. 23, 333\u2013363 (2011). \nhttps:\/\/doi.org\/10.1007\/s00165-010-0161-4","journal-title":"Form. Aspects Comput."},{"key":"10_CR4","first-page":"3","volume":"55","author":"W van der Aalst","year":"1998","unstructured":"van der Aalst, W., Kindler, E., Desel, J.: Beyond asymmetric choice: a note on some extensions. Petri Net Newsl. 55, 3\u201313 (1998)","journal-title":"Petri Net Newsl."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-61363-3_4","volume-title":"Application and Theory of Petri Nets 1996","author":"K Barkaoui","year":"1996","unstructured":"Barkaoui, K., Pradat-Peyre, J.-F.: On liveness and controlled siphons in Petri nets. In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol. 1091, pp. 57\u201372. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61363-3_4"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-47919-2_8","volume-title":"Petri Nets: Central Models and Their Properties","author":"E Best","year":"1987","unstructured":"Best, E.: Structure theory of petri nets: the free choice hiatus. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 168\u2013205. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/978-3-540-47919-2_8"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00289141","volume":"21","author":"E Best","year":"1984","unstructured":"Best, E., Voss, K.: Free choice systems have home states. Acta Informatica 21, 89\u2013100 (1984). \nhttps:\/\/doi.org\/10.1007\/BF00289141","journal-title":"Acta Informatica"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoret. Comput. Sci. 147, 117\u2013136 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Lasota, S., Lazi\u0107, R., Laroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 24\u201333 (2019)","DOI":"10.1145\/3313276.3316369"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol. 40. Cambridge University Press, Cambridge (1995)","DOI":"10.1017\/CBO9780511526558"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.peva.2017.09.006","volume":"117","author":"J Esparza","year":"2017","unstructured":"Esparza, J., Hoffmann, P., Saha, R.: Polynomial analysis algorithms for free choice probabilistic workflow nets. Perform. Eval. 117, 104\u2013129 (2017)","journal-title":"Perform. Eval."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"key":"10_CR13","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1976)"},{"key":"10_CR14","unstructured":"Hack, M.: Petri Net languages. Technical report 159, MIT (1976)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0304-3975(03)00359-1","volume":"311","author":"L Jiao","year":"2004","unstructured":"Jiao, L., Cheung, T.Y., Lu, W.: On liveness and boundedness of asymmetric choice nets. Theoret. Comput. Sci. 311, 165\u2013197 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","volume":"4","author":"ND Jones","year":"1977","unstructured":"Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theoret. Comput. Sci. 4, 277\u2013299 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 1\u201313 (2019)","DOI":"10.1109\/LICS.2019.8785796"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1109\/TSMC.2014.2386802","volume":"45","author":"G Liu","year":"2015","unstructured":"Liu, G., Jiang, C.: Co-NP-hardness of the soundness problem for asymmetric-choice workflow nets. IEEE Trans. Syst. Man Cybern.: Syst. 45, 1201\u20131204 (2015)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5259-5","volume":"58","author":"G Liu","year":"2015","unstructured":"Liu, G., Jiang, C.: Net-structure-based conditions to decide compatibility and weak compatibility for a class of inter-organizational workflow nets. Sci. China Inf. Sci. 58, 1\u201316 (2015). \nhttps:\/\/doi.org\/10.1007\/s11432-014-5259-5","journal-title":"Sci. China Inf. Sci."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.3233\/FI-2014-1005","volume":"131","author":"G Liu","year":"2014","unstructured":"Liu, G., Sun, J., Liu, Y., Dong, J.: Complexity of the soundness problem of workflow nets. Fundamenta Informaticae 131, 81\u2013101 (2014)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-27793-4_12","volume-title":"Applications and Theory of Petri Nets 2004","author":"K van Hee","year":"2004","unstructured":"van Hee, K., Sidorova, N., Voorhoeve, M.: Generalised soundness of workflow nets is decidable. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 197\u2013215. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-27793-4_12"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Kang, M.H., Park, J.S., Froscher, J.N.: Access control mechanisms for inter-organizational workflow. In: Proceedings of the Sixth ACM Symposium on Access Control Models and Technologies, pp. 66\u201374. ACM Press, New York (2001)","DOI":"10.1145\/373256.373266"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-21834-7_18","volume-title":"Applications and Theory of Petri Nets","author":"E Kindler","year":"2011","unstructured":"Kindler, E.: The ePNK: an extensible Petri net tool for PNML. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 318\u2013327. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21834-7_18"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-45594-9_15","volume-title":"Business Process Management","author":"E Kindler","year":"2000","unstructured":"Kindler, E., Martens, A., Reisig, W.: Inter-operability of workflow applications: local criteria for global soundness. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 235\u2013253. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-45594-9_15"},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1587\/transinf.2017FOP0008","volume":"E101\u2013D","author":"M Malek","year":"2018","unstructured":"Malek, M., Ahmadon, M., Yamaguchi, S.: Computational complexity and polynomial time procedure of response property problem in workflow nets. IEICE Trans. Inf. Syst. E101\u2013D, 1503\u20131510 (2018)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"10_CR26","first-page":"12","volume":"65","author":"A Martens","year":"2003","unstructured":"Martens, A.: On compatibility of web services. Petri Net Newsl. 65, 12\u201320 (2003)","journal-title":"Petri Net Newsl."},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17465-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PJ Meyer","year":"2019","unstructured":"Meyer, P.J., Esparza, J., Offtermatt, P.: Computing the expected execution time of probabilistic workflow nets. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 154\u2013171. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17465-1_9"},{"key":"10_CR28","first-page":"1071","volume":"E85\u2013A","author":"A Ohta","year":"2002","unstructured":"Ohta, A., Tsuji, K.: NP-hardness of liveness problem of bounded asymmetric choice net. IEICE Trans. Fundam. E85\u2013A, 1071\u20131074 (2002)","journal-title":"IEICE Trans. Fundam."},{"key":"10_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies","author":"W Reisig","year":"2013","unstructured":"Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33278-4"},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1109\/TII.2019.2949591","volume":"16","author":"XY Tao","year":"2020","unstructured":"Tao, X.Y., Liu, G.J., Yang, B., Yan, C.G., Jiang, C.J.: Workflow nets with tables and their soundness. IEEE Trans. Ind. Inf. 16, 1503\u20131515 (2020)","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0019-9958(84)80052-2","volume":"61","author":"PS Thiagarajan","year":"1984","unstructured":"Thiagarajan, P.S., Voss, K.: A fresh look at free choice nets. Inf. Control 61, 85\u2013113 (1984)","journal-title":"Inf. Control"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1109\/TSMC.2015.2394735","volume":"45","author":"FL Tiplea","year":"2015","unstructured":"Tiplea, F.L., Bocaenealae, C., Chirosecae, R.: On the complexity of deciding soundness of acyclic workflow nets. IEEE Trans. Syst. Man Cybern.: Syst. 45, 1292\u20131298 (2015)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-02144-2_34","volume-title":"Advanced Information Systems Engineering","author":"N Tr\u010dka","year":"2009","unstructured":"Tr\u010dka, N., van der Aalst, W.M.P., Sidorova, N.: Data-flow anti-patterns: discovering data-flow errors in workflows. In: van Eck, P., Gordijn, J., Wieringa, R. (eds.) CAiSE 2009. LNCS, vol. 5565, pp. 425\u2013439. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02144-2_34"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1093\/comjnl\/bxl074","volume":"50","author":"HMW Verbeek","year":"2007","unstructured":"Verbeek, H.M.W., van der Aalst, W.M.P., Ter Hofstede, A.H.M.: Verifying workflows with cancellation regions and OR-joins: an approach based on relaxed soundness and invariants. Comput. J. 50, 294\u2013314 (2007)","journal-title":"Comput. J."},{"key":"10_CR35","unstructured":"Wimmel, H.: Synthesis of reduced asymmetric choice Petri nets. \narXiv:1911.09133\n\n, pp. 1\u201327 (2019)"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Xiang, D.M., Liu, G.J., Yan, C.G., Jiang, C.J.: A guard-driven analysis approach of workflow net with data. IEEE Trans. Serv. Comput. (2019, published online). \nhttps:\/\/doi.org\/10.1109\/TSC.2019.2899086","DOI":"10.1109\/TSC.2019.2899086"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1093\/ietfec\/e90-a.4.829","volume":"E90\u2013A","author":"S Yamaguchi","year":"2007","unstructured":"Yamaguchi, S., Matsuo, H., Ge, Q.W., Tanaka, M.: WF-net based modeling and soundness verification of interworkflows. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E90\u2013A, 829\u2013835 (2007)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"5","key":"10_CR38","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00607-017-0582-5","volume":"100","author":"SJ van Zelst","year":"2017","unstructured":"van Zelst, S.J., van Dongen, B.F., van\u00a0der Aalst, W.M.P., Verbeek, H.M.W.: Discovering workflow nets using integer linear programming. Computing 100(5), 529\u2013556 (2017). \nhttps:\/\/doi.org\/10.1007\/s00607-017-0582-5","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T01:22:42Z","timestamp":1593480162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.89","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}