{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:50:16Z","timestamp":1771699816780,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540389019","type":"print"},{"value":"9783540389033","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841760_28","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T11:52:02Z","timestamp":1160049122000},"page":"389-394","source":"Crossref","is-referenced-by-count":14,"title":["Verifying Workflows with Cancellation Regions and OR-Joins: An Approach Based on Reset Nets and Reachability Analysis"],"prefix":"10.1007","author":[{"given":"M. T.","family":"Wynn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. M. P.","family":"van der Aalst","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. H. M.","family":"ter Hofstede","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Edmond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","first-page":"407","volume-title":"Application and Theory of Petri Nets 1997","author":"W.M.P. Aalst van der","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":"28_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W.M.P. Aalst van der","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"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.is.2004.02.002","volume":"30","author":"W.M.P. Aalst van der","year":"2005","unstructured":"van der Aalst, W.M.P., ter Hofstede, A.H.M.: YAWL: Yet Another Workflow Language. Information Systems\u00a030(4), 245\u2013275 (2005)","journal-title":"Information Systems"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1022883727209","volume":"14","author":"W.M.P. Aalst van der","year":"2003","unstructured":"van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow Patterns. Distributed and Parallel Databases\u00a014, 5\u201351 (2003)","journal-title":"Distributed and Parallel Databases"},{"key":"28_CR5","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":"28_CR6","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)"},{"issue":"6","key":"28_CR7","first-page":"1","volume":"68","author":"A. Finkel","year":"2002","unstructured":"Finkel, A., Raskin, J.-F., Samuelides, M., van Begin, L.: Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Electronic Notes in Theoretical Computer Science\u00a068(6), 1\u201322 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1\u20132","key":"28_CR8","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"},{"key":"28_CR9","unstructured":"Verbeek, H.M.W.: Verification of WF-nets. PhD thesis, Eindhoven University of Technology, The Netherlands (June 2004)"},{"key":"28_CR10","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 Invariants. Technical Report WP 156, Eindhoven University of Technology, The Netherlands (2006)"},{"key":"28_CR11","doi-asserted-by":"crossref","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 (Revised version). Technical report BPM-06-16, bpmcenter.org. (2006)","DOI":"10.1007\/11841760_28"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/11494744_24","volume-title":"Applications and Theory of Petri Nets 2005","author":"M.T. Wynn","year":"2005","unstructured":"Wynn, M.T., Edmond, D., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Achieving a General, Formal and Decidable Approach to the OR-join in Workflow using Reset nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 423\u2013443. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841760_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T09:53:53Z","timestamp":1555840433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841760_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389019","9783540389033"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11841760_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}