{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T23:40:05Z","timestamp":1785195605503,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642156175","type":"print"},{"value":"9783642156182","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15618-2_19","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T09:23:04Z","timestamp":1284369784000},"page":"260-275","source":"Crossref","is-referenced-by-count":9,"title":["Symbolic Execution of Acyclic Workflow Graphs"],"prefix":"10.1007","author":[{"given":"C\u00e9dric","family":"Favre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hagen","family":"V\u00f6lzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-00899-3_12","volume":"2","author":"J. Mendling","year":"2009","unstructured":"Mendling, J.: Empirical Studies in Process Model Verification. T. Petri Nets and Other Models of Concurrency (ToPNoC)\u00a02, 208\u2013224 (2009)","journal-title":"T. Petri Nets and Other Models of Concurrency (ToPNoC)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Weidlich, M., Polyvyanyy, A., Mendling, J., Weske, M.: Efficient Computation of Causal Behavioural Profiles using Structural Decomposition. Technical Report BPT 10, HPI (2010)","DOI":"10.1007\/978-3-642-13675-7_6"},{"key":"19_CR3","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)"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1080","volume":"114","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Reduction and synthesis of live and bounded free choice Petri nets. Information and Computation\u00a0114(1), 50\u201387 (1994)","journal-title":"Information and Computation"},{"key":"19_CR5","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., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., V\u00f6lzer, H., Wolf, K.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM. LNCS, vol.\u00a05701, pp. 278\u2013293. Springer, Heidelberg (2009)"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0306-4379(00)00012-0","volume":"25","author":"W. Sadiq","year":"2000","unstructured":"Sadiq, W., Orlowska, M.E.: Analyzing process models using graph reduction techniques. Inf. Syst.\u00a025(2), 117\u2013134 (2000)","journal-title":"Inf. Syst."},{"key":"19_CR7","unstructured":"Mendling, J.: Detection and Prediction of Errors in EPC Business Process Models. PhD thesis, Vienna University of Economics and Business Administration, Vienna, Austria (2007)"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1108\/14637150910931479","volume":"15","author":"M. Wynn","year":"2009","unstructured":"Wynn, M., Verbeek, H., Aalst, W., Hofstede, A., Edmond, D.: Business process verification- finally a reality! Business Process Management Journal\u00a015(1), 74\u201392 (2009)","journal-title":"Business Process Management Journal"},{"key":"19_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":"19_CR10","first-page":"12","volume":"65","author":"A. Martens","year":"2003","unstructured":"Martens, A.: On compatibility of web services. Petri Net Newsletter\u00a065, 12\u201320 (2003)","journal-title":"Petri Net Newsletter"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Favre, C., V\u00f6lzer, H.: Symbolic execution of acyclic workflow graphs. Technical Report RZ3780, IBM Research (2010)","DOI":"10.1007\/978-3-642-15618-2_19"},{"key":"19_CR12","series-title":"LNCS","first-page":"285","volume-title":"BPM 2010","author":"H. V\u00f6lzer","year":"2010","unstructured":"V\u00f6lzer, H.: A new semantics for the inclusive converging gateway in safe processes. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol.\u00a06336, pp. 285\u2013300. Springer, Heidelberg (2010)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/3-540-45594-9_11","volume-title":"BPM 2000","author":"W. Aalst van der","year":"2000","unstructured":"van der Aalst, W.: Workflow verification: Finding control-flow errors using Petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) BPM 2000. LNCS, vol.\u00a01806, pp. 161\u2013183. Springer, Heidelberg (2000)"},{"key":"19_CR14","first-page":"210","volume":"483","author":"J. Esparza","year":"1990","unstructured":"Esparza, J., Silva, M.: Circuits, handles, bridges and nets. Advances in Petri nets\u00a0483, 210\u2013242 (1990)","journal-title":"Advances in Petri nets"},{"issue":"4","key":"19_CR15","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM (JACM)\u00a025(1), 1\u20139 (1978)","journal-title":"Journal of the ACM (JACM)"},{"key":"19_CR17","unstructured":"Favre, C.: An efficient approach to detect lack of synchronization in acyclic workflow graphs. In: ZEUS. CEUR Workshop Proceedings, vol.\u00a0563, pp. 57\u201364 (2010)"},{"key":"19_CR18","unstructured":"Kovalyov, A., Esparza, J.: A Polynomial Algorithm to Compute the Concurrency Relation of Free-Choice Signal Transition Graphs. In: Proc. of the International Workshop on Discrete Event Systems, WODES 1996, The Institution of Electrical Engineers, Edinburgh, pp. 1\u20136 (1996)"},{"issue":"9","key":"19_CR19","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","volume":"68","author":"J. Vanhatalo","year":"2009","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng.\u00a068(9), 793\u2013818 (2009)","journal-title":"Data Knowl. Eng."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Vanhatalo, J.: Process Structure Trees: Decomposing a Business Process Model into a Hierarchy of Single-Entry-Single-Exit Fragments. PhD thesis, Universit\u00e4t Stuttgart (2009)","DOI":"10.1007\/978-3-540-85758-7_10"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15618-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T18:36:34Z","timestamp":1636482994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15618-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156175","9783642156182"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15618-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}