{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:53:17Z","timestamp":1743018797709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031131875"},{"type":"electronic","value":"9783031131882"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":217,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p> Workflow nets are a well-established mathematical formalism for the analysis of business processes arising from either modeling tools or process mining. The central decision problems for workflow nets are <jats:italic>k<\/jats:italic>-soundness, generalised soundness and structural soundness. Most existing tools focus on <jats:italic>k<\/jats:italic>-soundness. In this work, we propose novel scalable semi-procedures for generalised and structural soundness. This is achieved via integral and continuous Petri net reachability relaxations. We show that our approach is competitive against state-of-the-art tools.<\/jats:p>","DOI":"10.1007\/978-3-031-13188-2_23","type":"book-chapter","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:16:57Z","timestamp":1659687417000},"page":"468-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2914-2734","authenticated-orcid":false,"given":"Michael","family":"Blondin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4535-6508","authenticated-orcid":false,"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-2849","authenticated-orcid":false,"given":"Philip","family":"Offtermatt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-63139-9_48","volume-title":"Application and Theory of Petri Nets 1997","author":"WMP van der Aalst","year":"1997","unstructured":"van der Aalst, W.M.P., et al.: Verification of workflow nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407\u2013426. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63139-9_48"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"WMP van der Aalst","year":"1998","unstructured":"van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circuits Syst. Comput. 8(1), 21\u201366 (1998). https:\/\/doi.org\/10.1142\/S0218126698000043","journal-title":"J. Circuits Syst. Comput."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45594-9_11","volume-title":"Business Process Management","author":"WMP van der Aalst","year":"2000","unstructured":"van der Aalst, W.M.P., et al.: Workflow verification: finding control-flow errors using Petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161\u2013183. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45594-9_11"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. Cooperative Information Systems. MIT Press, Cambridge (2002)","DOI":"10.7551\/mitpress\/7301.001.0001"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/978-3-319-40229-1_35","volume-title":"Automated Reasoning","author":"K Athanasiou","year":"2016","unstructured":"Athanasiou, K., Liu, P., Wahl, T.: Unbounded-thread program verification using thread-state equations. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 516\u2013531. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_35"},{"key":"23_CR6","unstructured":"Barkaoui, K., Petrucci, L.: Structural analysis of workflow nets with shared resources. In: Proceedings of Workflow Management: Net-Based Concepts, Models, Techniques and Tools (WFM), vol. 98\/7, pp. 82\u201395 (1998)"},{"key":"23_CR7","doi-asserted-by":"publisher","unstructured":"Blondin, M.: The ABCs of Petri net reachability relaxations. ACM SIGLOG News 7(3) (2020). https:\/\/doi.org\/10.1145\/3436980.3436984","DOI":"10.1145\/3436980.3436984"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: The logical view on continuous Petri nets. ACM Trans. Comput. Log. (TOCL) 18(3), 24:1\u201324:28 (2017). https:\/\/doi.org\/10.1145\/3105908","DOI":"10.1145\/3105908"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Blondin, M., Mazowiecki, F., Offtermatt, P.: The complexity of soundness in workflow nets. In: Proceedings of 37th Symposium on Logic in Computer Science (LICS) (2022)","DOI":"10.1145\/3531130.3533341"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-52234-0_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"H Bride","year":"2017","unstructured":"Bride, H., Kouchnarenko, O., Peureux, F.: Reduction of workflow nets for generalised soundness verification. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 91\u2013111. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_6"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups: preliminary report. In: Proceedings of 8th Annual ACM Symposium on Theory of Computing (STOC), pp. 50\u201354 (1976). https:\/\/doi.org\/10.1145\/800113.803630","DOI":"10.1145\/800113.803630"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Chistikov, D., Haase, C., Halfon, S.: Context-free commutative grammars with integer counters and resets. Theor. Comput. Sci. 735, 147\u2013161 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2016.06.017","DOI":"10.1016\/j.tcs.2016.06.017"},{"key":"23_CR13","unstructured":"Czerwinski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. In: Proceedings of 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2021, to appear)"},{"key":"23_CR14","doi-asserted-by":"publisher","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995). https:\/\/doi.org\/10.1017\/CBO9780511526558","DOI":"10.1017\/CBO9780511526558"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-08867-9_40","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An SMT-based approach to coverability analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 603\u2013619. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_40"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-03848-8_19","volume-title":"Business Process Management","author":"D Fahland","year":"2009","unstructured":"Fahland, D., et al.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278\u2013293. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03848-8_19"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-49674-9_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Favre","year":"2016","unstructured":"Favre, C., V\u00f6lzer, H., M\u00fcller, P.: Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets). In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 463\u2013479. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_27"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2015-1168","volume":"137","author":"E Fraca","year":"2015","unstructured":"Fraca, E., Haddad, S.: Complexity analysis of continuous Petri nets. Fundamenta Informaticae 137(1), 1\u201328 (2015). https:\/\/doi.org\/10.3233\/FI-2015-1168","journal-title":"Fundamenta Informaticae"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-70881-0_21","volume-title":"Perspectives of Systems Informatics","author":"K van Hee","year":"2007","unstructured":"van Hee, K., Oanea, O., Sidorova, N., Voorhoeve, M.: Verifying generalized soundness of workflow nets. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 235\u2013247. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70881-0_21"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44919-1_22","volume-title":"Applications and Theory of Petri Nets 2003","author":"K van Hee","year":"2003","unstructured":"van Hee, K., Sidorova, N., Voorhoeve, M.: Soundness and separability of workflow nets in the stepwise refinement approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 337\u2013356. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44919-1_22"},{"key":"23_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). https:\/\/doi.org\/10.1007\/978-3-540-27793-4_12"},{"key":"23_CR22","unstructured":"Hoffmann, P.E.: Workflow nets: reduction rules and games. Ph.D. thesis, Technische Universit\u00e4t M\u00fcnchen (2017)"},{"issue":"3","key":"23_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00236-002-0105-4","volume":"39","author":"B Kiepuszewski","year":"2003","unstructured":"Kiepuszewski, B., ter Hofstede, A.H.M., van der Aalst, W.M.P.: Fundamentals of control flow in workflows. Acta Informatica 39(3), 143\u2013209 (2003). https:\/\/doi.org\/10.1007\/s00236-002-0105-4","journal-title":"Acta Informatica"},{"key":"23_CR24","unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. In: Proceedings of 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2021, to appear)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/11841760_38","volume-title":"Business Process Management","author":"J Mendling","year":"2006","unstructured":"Mendling, J., et al.: Faulty EPCs in the SAP reference model. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 451\u2013457. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841760_38"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24https:\/\/github.com\/Z3Prover\/z3"},{"issue":"4","key":"23_CR27","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989). https:\/\/doi.org\/10.1109\/5.24143","journal-title":"Proc. IEEE"},{"key":"23_CR28","unstructured":"Ping, L., Hao, H., Jian, L.: On 1-soundness and soundness of workflow nets. In: Third Workshop on Modelling of Objects, Components, and Agents, p. 21 (2004)"},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223\u2013231 (1978). https:\/\/doi.org\/10.1016\/0304-3975(78)90036-1","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"23_CR30","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1109\/TSMC.2015.2394735","volume":"45","author":"FL \u0162iplea","year":"2015","unstructured":"\u0162iplea, F.L., Boc\u0103neal\u0103, C., Chiro\u015fc\u0103, R.: On the complexity of deciding soundness of acyclic workflow nets. IEEE Trans. Syst. Man Cybern. Syst. 45(9), 1292\u20131298 (2015). https:\/\/doi.org\/10.1109\/TSMC.2015.2394735","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"2","key":"23_CR31","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ipl.2005.06.002","volume":"96","author":"FL \u0162iplea","year":"2005","unstructured":"\u0162iplea, F.L., Marinescu, D.C.: Structural soundness of workflow nets is decidable. Inf. Process. Lett. 96(2), 54\u201358 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.06.002","journal-title":"Inf. Process. Lett."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-49851-4_1","volume-title":"Process Mining","author":"W van der Aalst","year":"2016","unstructured":"van der Aalst, W.: Data science in action. In: Process Mining, pp. 3\u201323. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49851-4_1"},{"key":"23_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-44988-4_28","volume-title":"Application and Theory of Petri Nets 2000","author":"E Verbeek","year":"2000","unstructured":"Verbeek, E., van der Aalst, W.M.P.: Woflan 2.0 a Petri-net-based workflow diagnosis tool. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 475\u2013484. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44988-4_28"},{"issue":"4","key":"23_CR34","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1093\/comjnl\/44.4.246","volume":"44","author":"HMW Verbeek","year":"2001","unstructured":"Verbeek, H.M.W., Basten, T., van der Aalst, W.M.P.: Diagnosing workflow processes using Woflan. Comput. J. 44(4), 246\u2013279 (2001). https:\/\/doi.org\/10.1093\/comjnl\/44.4.246","journal-title":"Comput. J."},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-91268-4_18","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"K Wolf","year":"2018","unstructured":"Wolf, K.: Petri Net model checking with LoLA 2. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 351\u2013362. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91268-4_18"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13188-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:22:04Z","timestamp":1659687724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13188-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031131875","9783031131882"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13188-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"209","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":"40","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":"11","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":"19% - 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.9","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":"9.7","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)"}}]}}