{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:07:02Z","timestamp":1743142022989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174644"},{"type":"electronic","value":"9783030174651"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17465-1_9","type":"book-chapter","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:50:37Z","timestamp":1554331837000},"page":"154-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Computing the Expected Execution Time of Probabilistic Workflow Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1334-9079","authenticated-orcid":false,"given":"Philipp J.","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9862-4919","authenticated-orcid":false,"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-2849","authenticated-orcid":false,"given":"Philip","family":"Offtermatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"WMP Aalst van der","year":"1998","unstructured":"van der Aalst, W.M.P.: The application of Petri nets to workflow management. J. Circ. Syst. Comput. 8(1), 21\u201366 (1998). \n                      https:\/\/doi.org\/10.1142\/S0218126698000043","journal-title":"J. Circ. Syst. Comput."},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"WMP Aalst van der","year":"2011","unstructured":"van der Aalst, W.M.P., et al.: Soundness of workflow nets: classification, decidability, and analysis. Formal Asp. Comput. 23(3), 333\u2013363 (2011). \n                      https:\/\/doi.org\/10.1007\/s00165-010-0161-4","journal-title":"Formal Asp. Comput."},{"key":"9_CR3","volume-title":"Workflow Management: Models, Methods, and Systems","author":"W Aalst van der","year":"2004","unstructured":"van der Aalst, W., van Hee, K.M.: Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge (2004)"},{"key":"9_CR4","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-45348-4_15","volume-title":"Business Process Management","author":"M Botezatu","year":"2016","unstructured":"Botezatu, M., V\u00f6lzer, H., Thiele, L.: The complexity of deadline analysis for workflow graphs with multiple resources. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNCS, vol. 9850, pp. 252\u2013268. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-45348-4_15"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-50580-6_24","volume-title":"Advances in Petri Nets 1988","author":"J Carlier","year":"1988","unstructured":"Carlier, J., Chr\u00e9tienne, P.: Timed Petri net schedules. In: Rozenberg, G. (ed.) APN 1987. LNCS, vol. 340, pp. 62\u201384. Springer, Heidelberg (1988). \n                      https:\/\/doi.org\/10.1007\/3-540-50580-6_24"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45594-9_9","volume-title":"Business Process Management","author":"J Desel","year":"2000","unstructured":"Desel, J., Erwin, T.: Modeling, simulation and analysis of business processes. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 129\u2013141. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/3-540-45594-9_9"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"van Dongen, B.F.: BPI Challenge 2017 (2017). \n                      https:\/\/doi.org\/10.4121\/uuid:5f3067df-f10b-45da-b98b-86ae4c7a310b","DOI":"10.4121\/uuid:5f3067df-f10b-45da-b98b-86ae4c7a310b"},{"key":"9_CR9","volume-title":"Activity Networks: Project Planning and Control by Network Models","author":"SE Elmaghraby","year":"1977","unstructured":"Elmaghraby, S.E.: Activity Networks: Project Planning and Control by Network Models. Wiley, Hoboken (1977)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-662-49665-7_20","volume-title":"Fundamental Approaches to Software Engineering","author":"J Esparza","year":"2016","unstructured":"Esparza, J., Hoffmann, P.: Reduction rules for colored workflow nets. In: Stevens, P., W\u0105sowski, A. (eds.) FASE 2016. LNCS, vol. 9633, pp. 342\u2013358. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49665-7_20"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.peva.2017.09.006","volume":"117","author":"J Esparza","year":"2017","unstructured":"Esparza, J., Hoffmann, P., Saha, R.: Polynomial analysis algorithms for free choice probabilistic workflow nets. Perform. Eval. 117, 104\u2013129 (2017). \n                      https:\/\/doi.org\/10.1016\/j.peva.2017.09.006","journal-title":"Perform. Eval."},{"key":"9_CR12","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., et al.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278\u2013293. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-03848-8_19"},{"key":"9_CR13","doi-asserted-by":"publisher","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). \n                      https:\/\/doi.org\/10.1016\/j.is.2013.12.004","journal-title":"Inf. Syst."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-662-49674-9_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Favre","year":"2016","unstructured":"Favre, C., V\u00f6lzer, H., M\u00fcller, P.: Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets). In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 463\u2013479. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49674-9_27"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Gaubert, S., Mairesse, J.: Asymptotic analysis of heaps of pieces and application to timed Petri nets. In: Proceedings of the 8th International Workshop on Petri Nets and Performance Models, PNPM 1999, Zaragoza, Spain, 8\u201310 September 1999, pp. 158\u2013169 (1999). \n                      https:\/\/doi.org\/10.1109\/PNPM.1999.796562","DOI":"10.1109\/PNPM.1999.796562"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/9.754807","volume":"44","author":"S Gaubert","year":"1999","unstructured":"Gaubert, S., Mairesse, J.: Modeling and analysis of timed Petri nets using heaps of pieces. IEEE Trans. Autom. Control 44(4), 683\u2013697 (1999). \n                      https:\/\/doi.org\/10.1109\/9.754807","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.3230180206","volume":"18","author":"JN Hagstrom","year":"1988","unstructured":"Hagstrom, J.N.: Computational complexity of PERT problems. Networks 18(2), 139\u2013147 (1988). \n                      https:\/\/doi.org\/10.1002\/net.3230180206","journal-title":"Networks"},{"key":"9_CR18","unstructured":"Mannhardt, F., de Leoni, M., Reijers, H.A.: The multi-perspective process explorer. In: Proceedings of the BPM Demo Session 2015 Co-located with the 13th International Conference on Business Process Management, BPM 2015, Innsbruck, Austria, 2 September 2015, pp. 130\u2013134 (2015)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, P.J., Esparza, J., Offtermatt, P.: Computing the expected execution time of probabilistic workflow nets. \n                      arXiv:1811.06961\n                      \n                     [cs.LO] (2018)","DOI":"10.1007\/978-3-030-17465-1_9"},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"JS Provan","year":"1983","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777\u2013788 (1983). \n                      https:\/\/doi.org\/10.1137\/0212053","journal-title":"SIAM J. Comput."},{"key":"9_CR21","unstructured":"Rodrigues, A., et al.: Stairway to value: mining a loan application process (2017). \n                      https:\/\/www.win.tue.nl\/bpi\/lib\/exe\/fetch.php?media=2017:bpi2017_winner_academic.pdf"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/BFb0027048","volume-title":"Current Trends in Concurrency","author":"G Rozenberg","year":"1986","unstructured":"Rozenberg, G., Thiagarajan, P.S.: Petri nets: basic notions, structure, behaviour. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Current Trends in Concurrency. LNCS, vol. 224, pp. 585\u2013668. Springer, Heidelberg (1986). \n                      https:\/\/doi.org\/10.1007\/BFb0027048"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189\u2013201 (1979). \n                      https:\/\/doi.org\/10.1016\/0304-3975(79)90044-6","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Meyer, P.J., Esparza, J., Offtermatt, P.: Artifact and instructions to generate experimental results for TACAS 2019 paper: Computing the Expected Execution Time of Probabilistic Workflow Nets (artifact). Figshare (2019). \n                      https:\/\/doi.org\/10.6084\/m9.figshare.7831781.v1","DOI":"10.6084\/m9.figshare.7831781.v1"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17465-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:52:11Z","timestamp":1558345931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17465-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174644","9783030174651"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17465-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"164","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12 full papers and 11 short papers accepted for TOOLympics and SV-COMP (avg. 4 reviewers\/paper, selected from 43 submissions)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}