{"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":1725864634188},"publisher-location":"Cham","reference-count":18,"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_15","type":"book-chapter","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T12:06:15Z","timestamp":1473249975000},"page":"252-268","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Deadline Analysis for Workflow Graphs with Multiple Resources"],"prefix":"10.1007","author":[{"given":"Mirela","family":"Botezatu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hagen","family":"V\u00f6lzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lothar","family":"Thiele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-47961-9_37","volume-title":"Advanced Information Systems Engineering","author":"WMP Aalst van der","year":"2002","unstructured":"van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W.E.: An alternative way to analyze workflow graphs. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 535\u2013552. Springer, Heidelberg (2002)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Botezatu, M., V\u00f6lzer, H., Thiele, L.: The complexity of deadline analysis for workflow graphs with a single resource. In: Proceedings of the 20th IEEE ICECCS Conference, December 2015","DOI":"10.1109\/ICECCS.2015.22"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Botezatu, M., V\u00f6lzer, H., Thiele, L.: The complexity of deadline analysis for workflow graphs with multiple resources. Technical report RZ3896, IBM (2016)","DOI":"10.1007\/978-3-319-45348-4_15"},{"key":"15_CR5","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":"15_CR6","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":"15_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/S0022-0000(03)00039-4","volume":"66","author":"B Gaujal","year":"2003","unstructured":"Gaujal, B., Haar, S., Mairesse, J.: Blocking a transition in a free choice net and what it tells about its throughput. J. Comput. Syst. Sci. 66(3), 515\u2013548 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: Proceedings of the Real Time Systems Symposium, 1989, pp. 102\u2013111, December 1989","DOI":"10.1109\/REAL.1989.63561"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/1824795.1824799","volume":"43","author":"H Mili","year":"2010","unstructured":"Mili, H., Tremblay, G., Jaoude, G., Lefebvre, \u00c9., Elabed, L., El Boussaidi, G.: Business process modeling languages: sorting through the alphabet soup. ACM Comput. Surv. 43(1), 4:1\u20134:56 (2010)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"15_CR12","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":"15_CR13","unstructured":"Popova-Zeugmann, L., Heiner, M.: Worst-case analysis of concurrent systems with duration interval petri nets. In: BTU COTTBUS, pp. 162\u2013179 (1996)"},{"issue":"9","key":"15_CR14","doi-asserted-by":"crossref","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. 68(9), 793\u2013818 (2009)","journal-title":"Data Knowl. Eng."},{"key":"15_CR15","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)"},{"issue":"2\u20133","key":"15_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.tcs.2006.01.015","volume":"358","author":"D Varacca","year":"2006","unstructured":"Varacca, D., V\u00f6lzer, H., Winskel, G.: Probabilistic event structures and domains. Theor. Comput. Sci. 358(2\u20133), 173\u2013199 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-44685-0_13","volume-title":"CONCUR 2001 - Concurrency Theory","author":"H V\u00f6lzer","year":"2001","unstructured":"V\u00f6lzer, H.: Randomized non-sequential processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 184\u2013201. Springer, Heidelberg (2001)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/978-3-540-95891-8_53","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"M Wan","year":"2009","unstructured":"Wan, M., Ciardo, G.: Symbolic reachability analysis of integer timed Petri nets. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 595\u2013608. Springer, Heidelberg (2009)"}],"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_15","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_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319453477","9783319453484"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45348-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}