{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:50:34Z","timestamp":1725864634203},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319453477"},{"type":"electronic","value":"9783319453484"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45348-4_14","type":"book-chapter","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T12:06:15Z","timestamp":1473249975000},"page":"234-251","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Skipping and Blocking and Dead Path Elimination for Cyclic Workflows"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Fahland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hagen","family":"V\u00f6lzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"14_CR1","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 University Press, New York (1995)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-76848-7_5","volume-title":"On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA, and IS","author":"M Dumas","year":"2007","unstructured":"Dumas, M., Grosskopf, A., Hettel, T., Wynn, M.T.: Semantics of standard process models with OR-joins. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 41\u201358. Springer, Heidelberg (2007)"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.is.2013.12.007","volume":"47","author":"D Fahland","year":"2015","unstructured":"Fahland, D., van der Aalst, W.M.P.: Model repair - aligning process models to reality. Inf. Syst. 47, 220\u2013243 (2015)","journal-title":"Inf. Syst."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Fahland, D., V\u00f6lzer, H.: Dynamic Skipping and Blocking and Dead Path Elimination for Cyclic Workflows (Ext. Version). BPM Center Report BPM-16-05 (2016). http:\/\/bpmcenter.org","DOI":"10.1007\/978-3-319-45348-4_14"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.is.2013.12.004","volume":"47","author":"C Favre","year":"2015","unstructured":"Favre, C., Fahland, D., V\u00f6lzer, H.: The relationship between workflow graphs and free-choice workflow nets. Inf. Syst. 47, 197\u2013219 (2015)","journal-title":"Inf. Syst."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(84)90137-3","volume":"30","author":"HJ Genrich","year":"1984","unstructured":"Genrich, H.J., Thiagarajan, P.S.: A theory of bipolar synchronization schemes. Theor. Comput. Sci. 30, 241\u2013318 (1984)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1142\/S0218843008001798","volume":"17","author":"F Gottschalk","year":"2008","unstructured":"Gottschalk, F., van der Aalst, W.M.P., Jansen-Vullers, M.H., La Rosa, M.: Configurable workflow models. Int. J. Coop. Inf. Syst. 17(2), 177\u2013221 (2008)","journal-title":"Int. J. Coop. Inf. Syst."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-55676-1_15","volume-title":"Application and Theory of Petri Nets 1992","author":"P Kemper","year":"1992","unstructured":"Kemper, P., Bause, F.: An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 263\u2013278. Springer, Heidelberg (1992)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.datak.2005.02.005","volume":"56","author":"E Kindler","year":"2006","unstructured":"Kindler, E.: On the semantics of EPCs: resolving the vicious circle. Data Knowl. Eng. 56(1), 23\u201340 (2006)","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"14_CR10","doi-asserted-by":"crossref","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)","journal-title":"Proc. IEEE"},{"key":"14_CR11","unstructured":"OMG: Business process model and notation (BPMN) version 2.0, OMG document number dtc\/2010-05-03. Technical report (2010)"},{"issue":"2","key":"14_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1008604709862","volume":"10","author":"M Reichert","year":"1998","unstructured":"Reichert, M., Dadam, P.: ADEPT $${}_{\\text{ flex }}$$ -supporting dynamic changes of workflows without losing control. J. Intell. Inf. Syst. 10(2), 93\u2013129 (1998)","journal-title":"J. Intell. Inf. Syst."},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-30409-5","volume-title":"Enabling Flexibility in Process-Aware Information Systems - Challenges, Methods, Technologies","author":"M Reichert","year":"2012","unstructured":"Reichert, M., Weber, B.: Enabling Flexibility in Process-Aware Information Systems - Challenges, Methods, Technologies. Springer, Heidelberg (2012)"},{"key":"14_CR14","unstructured":"La Rosa, M., van der Aalst, W.M.P., Dumas, M., Milani, F.P.: Business process variability modeling: a survey. QUT e-Print 61842, QUT, Australia (2013)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"van Breugel, F., Koshkina, M.: Dead-path-elimination in BPEL4WS. In: Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 6\u20139 June 2005, St. Malo, France, pp. 192\u2013201. IEEE Computer Society (2005)","DOI":"10.1109\/ACSD.2005.11"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-540-74974-5_4","volume-title":"Service-Oriented Computing \u2013 ICSOC 2007","author":"J Vanhatalo","year":"2007","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models through SESE decomposition. In: Kr\u00e4mer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43\u201355. Springer, Heidelberg (2007)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-642-15618-2_21","volume-title":"Business Process Management","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. 6336, pp. 294\u2013309. Springer, Heidelberg (2010)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Weidlich, M., Gro\u00dfkopf, A., Barros, A.P.: Realising dead path elimination in BPMN. In: 2009 IEEE Conference on Commerce and Enterprise Computing, CEC 2009, Vienna, Austria, 20\u201323 July 2009, pp. 345\u2013352. IEEE Computer Society (2009)","DOI":"10.1109\/CEC.2009.32"},{"key":"14_CR19","unstructured":"Weske, M.: Workflow management systems: formal foundation, conceptual design, implementation aspects. Habilitationsschrift Fachbereich Mathematik und Informatik, Universit\u00e4t M\u00fcnster (2000)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Weske, M.: Formal foundation and conceptual design of dynamic adaptations in a workflow management system. In: 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 3\u20136 January 2001, Maui, Hawaii, USA. IEEE Computer Society (2001)","DOI":"10.1109\/HICSS.2001.927082"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45348-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T03:39:49Z","timestamp":1568345989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45348-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319453477","9783319453484"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45348-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}