{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:58:59Z","timestamp":1770069539492,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031416194","type":"print"},{"value":"9783031416200","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41620-0_13","type":"book-chapter","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T23:03:46Z","timestamp":1693523026000},"page":"216-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Action-Evolution Petri Nets: A Framework for\u00a0Modeling and\u00a0Solving Dynamic Task Assignment Problems"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Lo Bianco","sequence":"first","affiliation":[]},{"given":"Remco","family":"Dijkman","sequence":"additional","affiliation":[]},{"given":"Wim","family":"Nuijten","sequence":"additional","affiliation":[]},{"given":"Willem","family":"van Jaarsveld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,1]]},"reference":[{"issue":"1\u20132","key":"13_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.ejor.2017.09.006","volume":"266","author":"N G\u00fclp\u0131nar","year":"2018","unstructured":"G\u00fclp\u0131nar, N., \u00c7anako\u011flu, E., Branke, J.: Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities. Eur. J. Oper. Res. 266(1), 291\u2013303 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2020.02.004","volume":"55","author":"L Hu","year":"2020","unstructured":"Hu, L., Liu, Z., Hu, W., Wang, Y., Tan, J.: Petri-net-based dynamic scheduling of flexible manufacturing system via deep reinforcement learning with graph convolutional network. J. Manuf. Syst. 55, 1\u201314 (2020)","journal-title":"J. Manuf. Syst."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/trsc.1030.0073","volume":"38","author":"MZ Spivey","year":"2004","unstructured":"Spivey, M.Z., Powell, W.B.: The dynamic assignment problem. Transp. Sci. 38(4), 399\u2013419 (2004)","journal-title":"Transp. Sci."},{"key":"13_CR5","first-page":"352","volume-title":"Reinforcement Learning: An Introduction","author":"R Sutton","year":"2014","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning: An Introduction, p. 352. The MIT Press, Cambridge (2014)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0035389","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Jensen","year":"1997","unstructured":"Jensen, K.: A brief introduction to coloured Petri Nets. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 203\u2013208. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0035389"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/288197.581194","volume":"26","author":"F Bause","year":"1998","unstructured":"Bause, F., Kritzinger, P.: Stochastic Petri nets: an introduction to the theory. ACM SIGMETRICS Perform. Eval. Rev. 26(2), 2\u20133 (1998)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-16138-4_8","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2010","author":"MG Eboli","year":"2010","unstructured":"Eboli, M.G., Cozman, F.G.: Markov decision processes from colored Petri nets. In: da Rocha Costa, A.C., Vicari, R.M., Tonidandel, F. (eds.) SBIA 2010. LNCS (LNAI), vol. 6404, pp. 72\u201381. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16138-4_8"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-73094-1_6","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"M Beccuti","year":"2007","unstructured":"Beccuti, M., Franceschinis, G., Haddad, S.: Markov decision Petri net and Markov decision well-formed net formalisms. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 43\u201362. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73094-1_6"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Qiu, Q., Wu, Q., Pedram, M.: Dynamic power management of complex systems using generalized stochastic Petri nets. In: Proceedings of the 37th Conference on Design Automation - DAC 2000, pp. 352\u2013356. ACM Press (2000)","DOI":"10.1145\/337292.337438"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.3390\/app7020136","volume":"7","author":"M Drakaki","year":"2017","unstructured":"Drakaki, M., Tzionas, P.: Manufacturing scheduling using colored Petri nets and reinforcement learning. Appl. Sci. 7(2), 136 (2017)","journal-title":"Appl. Sci."},{"key":"13_CR12","series-title":"Lecture Notes in Production Engineering","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-030-78424-9_51","volume-title":"Production at the Leading Edge of Technology","author":"S Riedmann","year":"2022","unstructured":"Riedmann, S., Harb, J., Hoher, S.: Timed coloured Petri net simulation model for reinforcement learning in the context of production systems. In: Behrens, B.-A., Brosius, A., Drossel, W.-G., Hintze, W., Ihlenfeldt, S., Nyhuis, P. (eds.) WGP 2021. LNPE, pp. 457\u2013465. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-78424-9_51"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-84524-6","volume-title":"High-Level Petri Nets: Theory and Application","author":"K Jensen","year":"1991","unstructured":"Jensen, K., Rozenberg, G.: High-Level Petri Nets: Theory and Application. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-3-642-84524-6"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-18381-2_4","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"L Jacobsen","year":"2011","unstructured":"Jacobsen, L., Jacobsen, M., M\u00f8ller, M.H., Srba, J.: Verification of timed-arc Petri nets. In: \u010cern\u00e1, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 46\u201372. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18381-2_4"},{"key":"13_CR15","unstructured":"CPN Tools. https:\/\/cpntools.org\/"},{"issue":"7676","key":"13_CR16","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver, D., et al.: Mastering the game of Go without human knowledge. Nature 550(7676), 354\u2013359 (2017)","journal-title":"Nature"},{"key":"13_CR17","unstructured":"Kalashnikov, D., et al.: QT-Opt: scalable deep reinforcement learning for vision-based robotic manipulation, November 2018"},{"key":"13_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2020.106886","volume":"139","author":"R Nian","year":"2020","unstructured":"Nian, R., Liu, J., Huang, B.: A review on reinforcement learning: introduction and applications in industrial process control. Comput. Chem. Eng. 139, 106886 (2020)","journal-title":"Comput. Chem. Eng."},{"key":"13_CR19","unstructured":"Yu, C., Liu, J., Nemati, S.: Reinforcement learning in healthcare: a survey, April 2020. arXiv:1908.08796 [cs]"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D.W.: Assignment problems: a golden anniversary survey. Eur. J. Oper. Res. 176(2), 774\u2013793 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR21","unstructured":"Gymnasium. https:\/\/gymnasium.farama.org\/"},{"key":"13_CR22","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal Policy Optimization Algorithms, August 2017. arXiv:1707.06347 [cs]"},{"key":"13_CR23","unstructured":"SB3-contr. https:\/\/github.com\/Stable-Baselines-Team\/stable-baselines3-contrib"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41620-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:25:44Z","timestamp":1710246344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41620-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031416194","9783031416200"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41620-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Process Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bpm2023.sites.uu.nl\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"151","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, for the BPM Forum 23 papers were accepted. 18 papers of 42 submissions were accepted for the Blockchain- Educators- and RPA Forum.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}