{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:14:31Z","timestamp":1742922871931,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88081-1_25","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"330-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8480-9867","authenticated-orcid":false,"given":"Costin","family":"B\u0103dic\u0103","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3364-1210","authenticated-orcid":false,"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"issue":"8","key":"25_CR1","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0950-7051(02)00032-1","volume":"15","author":"R Aler","year":"2002","unstructured":"Aler, R., Borrajo, D., Camacho, D., Sierra-Alonso, A.: A knowledge-based approach for business process reengineering, shamash. Knowl.-Based Syst. 15(8), 473\u2013483 (2002)","journal-title":"Knowl.-Based Syst."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.datak.2018.04.007","volume":"117","author":"A Augusto","year":"2018","unstructured":"Augusto, A., Conforti, R., Dumas, M., La Rosa, M., Bruno, G.: Automated discovery of structured process models from event logs: The discover-and-structure approach. Data Knowl. Eng. 117, 373\u2013392 (2018)","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2018.2841877","volume":"31","author":"A Augusto","year":"2019","unstructured":"Augusto, A., et al.: Automated discovery of process models from event logs: review and benchmark. IEEE Trans. Knowl. Data Eng. 31(4), 686\u2013705 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR4","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-92007-8_16","volume-title":"Artificial Intelligence Applications and Innovations","author":"A B\u0103dic\u0103","year":"2018","unstructured":"B\u0103dic\u0103, A., B\u0103dic\u0103, C., D\u0103nciulescu, D., Logof\u0103tu, D.: Greedy heuristics for automatic synthesis of efficient block-structured scheduling processes from declarative specifications. In: Iliadis, L., Maglogiannis, I., Plagianakos, V. (eds.) AIAI 2018. IAICT, vol. 519, pp. 183\u2013195. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92007-8_16"},{"key":"25_CR5","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-32258-8_17","volume-title":"Intelligent Distributed Computing XIII","author":"A B\u0103dic\u0103","year":"2020","unstructured":"B\u0103dic\u0103, A., B\u0103dic\u0103, C., Ivanovi\u0107, M., Logof\u0103tu, D.: Exploring the space of block structured scheduling processes using constraint logic programming. In: Kotenko, I., Badica, C., Desnitsky, V., El Baz, D., Ivanovic, M. (eds.) IDC 2019. SCI, vol. 868, pp. 149\u2013159. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-32258-8_17"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3233\/AIC-200650","volume":"33","author":"A B\u0103dic\u0103","year":"2020","unstructured":"B\u0103dic\u0103, A., B\u0103dic\u0103, C., Ivanovi\u0107, M.: Block structured scheduling using constraint logic programming. AI Commun. 33(1), 41\u201357 (2020)","journal-title":"AI Commun."},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Dumas, M., La Rosa, M., Mendling, J., Reijers, H.A.: Fundamentals of Business Process Management (2nd ed.). Springer, New York (2018) https:\/\/doi.org\/10.1007\/978-3-662-56509-4","DOI":"10.1007\/978-3-662-56509-4"},{"key":"25_CR8","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 and Company, New York (1979)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"JE Kelley","year":"1961","unstructured":"Kelley, J.E.: Critical-path planning and scheduling: mathematical basis. Math. Oper. Res. 9(3), 296\u2013320 (1961)","journal-title":"Math. Oper. Res."},{"key":"25_CR10","unstructured":"Kinne, J., Manuch, J., Rafiey, A., Rafiey, A.: Ordering with precedence constraints and budget minimization. CoRR, abs\/1507.04885 (2015)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-30793-5_5","volume-title":"Formal Techniques for Distributed Systems","author":"K Klai","year":"2012","unstructured":"Klai, K., Desel, J.: Checking soundness of business processes compositionally using symbolic observation graphs. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 67\u201383. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30793-5_5"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: Psplib - a project scheduling library. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"25_CR13","first-page":"3","volume":"4","author":"O Kopp","year":"2009","unstructured":"Kopp, O., Martin, D., Wutke, D., Leymann, F.: The difference between graph-based and block-structured business process modelling languages. Enterp. Model. Inf. Syst. Architect. 4(1), 3\u201313 (2009)","journal-title":"Enterp. Model. Inf. Syst. Architect."},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00453-007-9004-y","volume":"55","author":"VSA Kumar","year":"2009","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Scheduling on unrelated machines under tree-like precedence constraints. Algorithmica 55(1), 205\u2013226 (2009)","journal-title":"Algorithmica"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-38697-8_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"SJJ Leemans","year":"2013","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs - a constructive approach. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 311\u2013329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38697-8_17"},{"issue":"2","key":"25_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s13740-018-0096-0","volume":"8","author":"A Marrella","year":"2019","unstructured":"Marrella, A.: Automated planning for business process management. J. Data Sem. 8(2), 79\u201398 (2019)","journal-title":"J. Data Sem."},{"issue":"4","key":"25_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11761-017-0215-z","volume":"11","author":"A Marrella","year":"2017","unstructured":"Marrella, A., Lesp\u00e9rance, Y.: A planning approach to the automated synthesis of template-based process models. SOCA 11(4), 367\u2013392 (2017)","journal-title":"SOCA"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mili, H., Tremblay, G., Jaoude, G.B., Lefebvre, E., Elabed, L., El-Boussaidi, G.: Business process modeling languages: sorting through the alphabet soup. ACM Comput. Surv. 43(1), 4:1\u20134:56 (2010)","DOI":"10.1145\/1824795.1824799"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-319-19069-3_24","volume-title":"Advanced Information Systems Engineering","author":"R Mrasek","year":"2015","unstructured":"Mrasek, R., M\u00fclle, J., B\u00f6hm, K.: Automatic generation of optimized process models from declarative specifications. In: Zdravkovic, J., Kirikova, M., Johannesson, P. (eds.) CAiSE 2015. LNCS, vol. 9097, pp. 382\u2013397. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19069-3_24"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-48472-3_3","volume-title":"On the Move to Meaningful Internet Systems: OTM 2016 Conferences","author":"R Mrasek","year":"2016","unstructured":"Mrasek, R., M\u00fclle, J., B\u00f6hm, K.: Process synthesis with sequential and parallel constraints. In: Debruyne, C., et al. (eds.) OTM 2016. LNCS, vol. 10033, pp. 43\u201360. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48472-3_3"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11837862_18","volume-title":"Business Process Management Workshops","author":"M Pesic","year":"2006","unstructured":"Pesic, M., van der Aalst, W.M.P.: A declarative approach for flexible business processes management. In: Eder, J., Dustdar, S. (eds.) BPM 2006. LNCS, vol. 4103, pp. 169\u2013180. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11837862_18"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"A. Polyvyanyy. Structuring process models. PhD thesis, University of Potsdam (2012)","DOI":"10.1016\/j.is.2011.10.005"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-15618-2_20","volume-title":"Business Process Management","author":"A Polyvyanyy","year":"2010","unstructured":"Polyvyanyy, A., Garc\u00eda-Ba\u00f1uelos, L., Dumas, M.: Structuring acyclic process models. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol. 6336, pp. 276\u2013293. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15618-2_20"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10(3), 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BFb0024728","volume-title":"Euro-Par\u201996 Parallel Processing","author":"AJC Gemund","year":"1996","unstructured":"Gemund, A.J.C.: SPC: a model of parallel computation. In: Boug\u00e9, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1124, pp. 397\u2013400. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0024728"},{"key":"25_CR26","unstructured":"Zatelli, M., H\u00fcbner, J.F., Bordini, R.H.: Concurrency in Jason. http:\/\/jason.sourceforge.net\/doc\/tech\/concurrency.html (2016)"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88081-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:16:05Z","timestamp":1632914165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","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":"231","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":"58","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":"25% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}