{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:01Z","timestamp":1767340081626,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048548"},{"type":"electronic","value":"9783642048562"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04856-2_3","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T07:41:51Z","timestamp":1257320511000},"page":"50-70","source":"Crossref","is-referenced-by-count":9,"title":["Soundness of Workflow Nets with Reset Arcs"],"prefix":"10.1007","author":[{"given":"Wil M. P.","family":"van der Aalst","sequence":"first","affiliation":[]},{"given":"Kees M.","family":"van Hee","sequence":"additional","affiliation":[]},{"given":"Arthur H. M.","family":"ter Hofstede","sequence":"additional","affiliation":[]},{"given":"Natalia","family":"Sidorova","sequence":"additional","affiliation":[]},{"given":"H. M. W.","family":"Verbeek","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Voorhoeve","sequence":"additional","affiliation":[]},{"given":"Moe T.","family":"Wynn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/3-540-63139-9_48","volume-title":"Application and Theory of Petri Nets 1997","author":"W.M.P. van der Aalst","year":"1997","unstructured":"van der Aalst, W.M.P.: Verification of Workflow Nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.\u00a01248, pp. 407\u2013426. Springer, Heidelberg (1997)"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W.M.P. van der Aalst","year":"1998","unstructured":"van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers\u00a08(1), 21\u201366 (1998)","journal-title":"The Journal of Circuits, Systems and Computers"},{"key":"3_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":"W.M.P. van der Aalst","year":"2000","unstructured":"van der Aalst, W.M.P.: Workflow Verification: Finding Control-Flow Errors using Petri-net-based Techniques. In: van der Aalst, W.M.P., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol.\u00a01806, pp. 161\u2013183. Springer, Heidelberg (2000)"},{"key":"3_CR4","volume-title":"Workflow Management: Models, Methods, and Systems","author":"W.M.P. van der Aalst","year":"2004","unstructured":"van der Aalst, W.M.P., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2004)"},{"key":"3_CR5","unstructured":"van der Aalst, W.M.P., van Hee, K.M., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of Workflow Nets: Classification, Decidability, and Analysis. Computer Science Report No. 08-13, Technische Universiteit Eindhoven, The Netherlands (2008)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T. Araki","year":"1977","unstructured":"Araki, T., Kasami, T.: Some Decision Problems Related to the Reachability Problem for Petri Nets. Theoretical Computer Science\u00a03(1), 85\u2013104 (1977)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Basten","year":"1996","unstructured":"Basten, T.: Branching Bisimilarity is an Equivalence indeed! Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/S0218843004000973","volume":"13","author":"J. Dehnert","year":"2004","unstructured":"Dehnert, J., van der Aalst, W.M.P.: Bridging the Gap Between Business Models and Workflow Specifications. International Journal of Cooperative Information Systems\u00a013(3), 289\u2013332 (2004)","journal-title":"International Journal of Cooperative Information Systems"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45341-5_11","volume-title":"Advanced Information Systems Engineering","author":"J. Dehnert","year":"2001","unstructured":"Dehnert, J., Rittgen, P.: Relaxed Soundness of Business Processes. In: Dittrich, K.R., Geppert, A., Norrie, M.C. (eds.) CAiSE 2001. LNCS, vol.\u00a02068, pp. 157\u2013170. Springer, Heidelberg (2001)"},{"key":"3_CR10","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J. Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge Tracts in Theoretical Computer Science, vol.\u00a040. Cambridge University Press, Cambridge (1995)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of Reset P\/T Nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 301\u2013310. Springer, Heidelberg (1999)"},{"key":"3_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/0471741442","volume-title":"Process-Aware Information Systems: Bridging People and Software through Process Technology","author":"M. Dumas","year":"2005","unstructured":"Dumas, M., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Process-Aware Information Systems: Bridging People and Software through Process Technology. Wiley & Sons, Chichester (2005)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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: An Introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 374\u2013428. Springer, Heidelberg (1998)"},{"key":"3_CR15","first-page":"143","volume":"30","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets: A Survey. Journal of Information Processing and Cybernetics\u00a030, 143\u2013160 (1994)","journal-title":"Journal of Information Processing and Cybernetics"},{"issue":"1\u20132","key":"3_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured Transition Systems everywhere! Theoretical Computer Science\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","volume":"2","author":"M.H.T. Hack","year":"1976","unstructured":"Hack, M.H.T.: The Equality Problem for Vector Addition Systems is Undecidable. Theoretical Computer Science\u00a02, 77\u201395 (1976)","journal-title":"Theoretical Computer Science"},{"key":"3_CR19","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.M. van Hee","year":"2003","unstructured":"van Hee, K.M., 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.\u00a02679, pp. 337\u2013356. Springer, Heidelberg (2003)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-540-27793-4_12","volume-title":"Applications and Theory of Petri Nets 2004","author":"K.M. van Hee","year":"2004","unstructured":"van Hee, K.M., Sidorova, N., Voorhoeve, M.: Generalised Soundness of Workflow Nets Is Decidable. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol.\u00a03099, pp. 197\u2013215. Springer, Heidelberg (2004)"},{"key":"3_CR21","series-title":"EATCS monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60794-3","volume-title":"Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use","author":"K. Jensen","year":"1997","unstructured":"Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS monographs on Theoretical Computer Science, vol.\u00a01. Springer, Berlin (1997)"},{"key":"3_CR22","series-title":"Analysis Methods. Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60794-3","volume-title":"Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use","author":"K. Jensen","year":"1997","unstructured":"Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Analysis Methods. Monographs in Theoretical Computer Science, vol.\u00a02. Springer, Berlin (1997)"},{"issue":"6","key":"3_CR23","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0020-0190(99)00074-5","volume":"70","author":"E. Kindler","year":"1999","unstructured":"Kindler, E., van der Aalst, W.M.P.: Liveness, Fairness, and Recurrence. Information Processing Letters\u00a070(6), 269\u2013274 (1999)","journal-title":"Information Processing Letters"},{"key":"3_CR24","volume-title":"Production Workflow: Concepts and Techniques","author":"F. Leymann","year":"1999","unstructured":"Leymann, F., Roller, D.: Production Workflow: Concepts and Techniques. Prentice-Hall PTR, Upper Saddle River (1999)"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-540-31984-9_3","volume-title":"Fundamental Approaches to Software Engineering","author":"A. Martens","year":"2005","unstructured":"Martens, A.: Analyzing Web Service Based Business Processes. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol.\u00a03442, pp. 19\u201333. Springer, Heidelberg (2005)"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/800076.802477","volume-title":"STOC 1981: Proceedings of the thirteenth annual ACM symposium on Theory of computing","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An Algorithm for the General Petri Net Reachability Problem. In: STOC 1981: Proceedings of the thirteenth annual ACM symposium on Theory of computing, pp. 238\u2013246. ACM, New York (1981)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-76848-7_9","volume-title":"On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS","author":"J. Mendling","year":"2007","unstructured":"Mendling, J., Neumann, G., van der Aalst, W.M.P.: Understanding the Occurrence of Errors in Process Models Based on Metrics. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol.\u00a04803, pp. 113\u2013130. Springer, Heidelberg (2007)"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11841760_11","volume-title":"Business Process Management","author":"F. Puhlmann","year":"2006","unstructured":"Puhlmann, F., Weske, M.: Investigations on Soundness Regarding Lazy Activities. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol.\u00a04102, pp. 145\u2013160. Springer, Heidelberg (2006)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Lectures on Petri Nets I: Basic Models","year":"1998","unstructured":"Reisig, W., Rozenberg, G. (eds.): Lectures on Petri Nets I: Basic Models. LNCS, vol.\u00a01491. Springer, Heidelberg (1998)"},{"key":"3_CR30","unstructured":"van der Toorn, R.: Component-Based Software Design with Petri nets: An Approach Based on Inheritance of Behavior. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (2004)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-08860-1_35","volume-title":"Automata, Languages and Programming","author":"R. Valk","year":"1978","unstructured":"Valk, R.: Self-Modifying Nets: A Natural Extension of Petri Nets. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 464\u2013476. Springer, Heidelberg (1978)"},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1093\/comjnl\/bxl074","volume":"50","author":"H.M.W. 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. The Computer Journal\u00a050(3), 294\u2013314 (2007)","journal-title":"The Computer Journal"},{"key":"3_CR33","unstructured":"Verbeek, H.M.W., Wynn, M.T., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Reduction Rules for Reset\/Inhibitor Nets. BPM Center Report BPM-07-13, BPMcenter.org (2007)"},{"key":"3_CR34","volume-title":"Business Process Management: Concepts, Languages, Architectures","author":"M. Weske","year":"2007","unstructured":"Weske, M.: Business Process Management: Concepts, Languages, Architectures. Springer, Berlin (2007)"},{"key":"3_CR35","unstructured":"Workflow Patterns Home Page, \n                    http:\/\/www.workflowpatterns.com"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/11841760_28","volume-title":"Business Process Management","author":"M.T. Wynn","year":"2006","unstructured":"Wynn, M.T., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D.: Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Reset Nets and Reachability Analysis. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol.\u00a04102, pp. 389\u2013394. Springer, Heidelberg (2006)"},{"issue":"1","key":"3_CR37","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1108\/14637150910931479","volume":"15","author":"M.T. Wynn","year":"2009","unstructured":"Wynn, M.T., Verbeek, H.M.W., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D.: Business Process Verification: Finally a Reality! Business Process Management Journal\u00a015(1), 74\u201392 (2009)","journal-title":"Business Process Management Journal"},{"issue":"6","key":"3_CR38","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.ins.2008.10.033","volume":"179","author":"M.T. Wynn","year":"2009","unstructured":"Wynn, M.T., Verbeek, H.M.W., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D.: Soundness-preserving Reduction Rules for Reset Workflow Nets. Information Sciences\u00a0179(6), 769\u2013790 (2009)","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04856-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:32:23Z","timestamp":1676680343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-04856-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048548","9783642048562"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04856-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}