{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T17:26:22Z","timestamp":1743269182442,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031416224"},{"type":"electronic","value":"9783031416231"}],"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-41623-1_4","type":"book-chapter","created":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T23:03:46Z","timestamp":1693523026000},"page":"55-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Foundations of\u00a0Collaborative $$\\textsf{DECLARE}$$"],"prefix":"10.1007","author":[{"given":"Luca","family":"Geatti","sequence":"first","affiliation":[]},{"given":"Marco","family":"Montali","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Rivkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,1]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1093\/comjnl\/bxn064","volume":"53","author":"WMP van der Aalst","year":"2010","unstructured":"van der Aalst, W.M.P., Lohmann, N., Massuthe, P., Stahl, C., Wolf, K.: Multiparty contracts: agreeing and implementing interorganizational processes. Comput. J. 53(1), 90\u2013106 (2010)","journal-title":"Comput. J."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aminof, B., De Giacomo, G., Rubin, S.: Best-effort synthesis: doing your best is not harder than giving up. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI), pp. 1766\u20131772. ijcai.org (2021)","DOI":"10.24963\/ijcai.2021\/243"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aminof, B., Giacomo, G.D., Murano, A., Rubin, S.: Planning under LTL environment specifications. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling (ICAPS), pp. 31\u201339. AAAI Press (2019)","DOI":"10.1609\/icaps.v29i1.3457"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Badouel, \u00c9., H\u00e9lou\u00ebt, L., Kouamou, G.E., Morvan, C.: A grammatical approach to data-centric case management in a distributed collaborative environment. In: Wainwright, R.L., Corchado, J.M., Bechini, A., Hong, J. (eds.) Proceedings of SAC 2015, pp. 1834\u20131839. ACM (2015)","DOI":"10.1145\/2695664.2695698"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11948148_28","volume-title":"Service-Oriented Computing \u2013 ICSOC 2006","author":"M Baldoni","year":"2006","unstructured":"Baldoni, M., Baroglio, C., Martelli, A., Patti, V.: A priori conformance verification for guaranteeing interoperability in open environments. In: Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. LNCS, vol. 4294, pp. 339\u2013351. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11948148_28"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, S., Li, Y., Tabajara, L.M., Vardi, M.Y.: Hybrid compositional reasoning for reactive synthesis from finite-horizon specifications. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 9766\u20139774. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i06.6528"},{"key":"4_CR7","unstructured":"Benveniste, A., et al.: Contracts for System Design. Now Foundations and Trends (2018)"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2011.08.007","volume":"78","author":"R Bloem","year":"2012","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A., Saar, Y.: Synthesis of reactive (1) designs. J. Comput. Syst. Sci. 78(3), 911\u2013938 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Buchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. In: Mac Lane, S., Siefkes, D. (eds) The Collected Works of J. Richard B\u00fcchi. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4613-8928-6_29","DOI":"10.1007\/978-1-4613-8928-6_29"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Camacho, A., Baier, J.A., Muise, C.J., McIlraith, S.A.: Finite LTL synthesis as planning. In: Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018), pp. 29\u201338. AAAI Press (2018)","DOI":"10.1609\/icaps.v28i1.13908"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 261\u2013275. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_21"},{"key":"4_CR12","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Proceedings of International Congress of Mathematicians. vol. 1962, pp. 23\u201335 (1962)"},{"key":"4_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2021.111007","volume":"180","author":"F Corradini","year":"2021","unstructured":"Corradini, F., Fornari, F., Polini, A., Re, B., Tiezzi, F., Vandin, A.: A formal approach for the analysis of BPMN collaboration models. J. Syst. Softw. 180, 111007 (2021)","journal-title":"J. Syst. Softw."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L De Alfaro","year":"2007","unstructured":"De Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci. 386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Maggi, F.M., Montali, M.: Monitoring constraints and metaconstraints with temporal logics on finite traces. ACM Trans. Soft. Eng. and Method. 31(4), 1\u201344 (2022)","DOI":"10.1145\/3506799"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1027\u20131033. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8872"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., Favorito, M., Li, J., Vardi, M.Y., Xiao, S., Zhu, S.: LTLF synthesis as and-or graph search: Knowledge compilation at work. In: Thirty-First International Joint Conference on Artificial Intelligence (IJCAI) (2022)","DOI":"10.24963\/ijcai.2022\/359"},{"key":"4_CR18","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Association for Computing Machinery IJCAI 2013, pp. 854\u2013860. IJCAI\/AAAI (2013)"},{"key":"4_CR19","unstructured":"De Giacomo, G., Vardi, M.Y.: Synthesis for LTL and LDL on finite traces. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (AAAI), pp. 1558\u20131564. AAAI Press (2015)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-75183-0_22","volume-title":"Business Process Management","author":"G Decker","year":"2007","unstructured":"Decker, G., Weske, M.: Local enforceability in interaction petri nets. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 305\u2013319. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75183-0_22"},{"issue":"12","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1016\/j.infsof.2008.02.006","volume":"50","author":"RM Dijkman","year":"2008","unstructured":"Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in BPMN. Inf. Softw. Technol. 50(12), 1281\u20131294 (2008)","journal-title":"Inf. Softw. Technol."},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Dumas, M., Rosa, M.L., Mendling, J., Reijers, H.A.: Fundamentals of Business Process Management, Second Edition. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-662-56509-4","DOI":"10.1007\/978-3-662-56509-4"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-40176-3_22","volume-title":"Business Process Management","author":"R Eshuis","year":"2013","unstructured":"Eshuis, R., Hull, R., Sun, Y., Vacul\u00edn, R.: Splitting GSM schemas: a framework for outsourcing of declarative artifact systems. In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 259\u2013274. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40176-3_22"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1613\/jair.1.11256","volume":"63","author":"V Fionda","year":"2018","unstructured":"Fionda, V., Greco, G.: LTL on finite and process traces: complexity results and a practical reasoner. J. Artif. Intell. Res. 63, 557\u2013623 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"4_CR25","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TKDE.2019.2897309","volume":"32","author":"V Fionda","year":"2019","unstructured":"Fionda, V., Guzzo, A.: Control-flow modeling with declare: behavioral properties, computational complexity, and tools. IEEE Trans. Knowl. Data Eng. 32(5), 898\u2013911 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR26","unstructured":"Geatti, L., Montali, M., Rivkin, A.: Reactive synthesis for DECLARE via symbolic automata. CoRR abs\/2212.10875 (2022)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Giacomo, G.D., Favorito, M., Li, J., Vardi, M.Y., Xiao, S., Zhu, S.: LTLF synthesis as AND-OR graph search: Knowledge compilation at work. In: Thirty-First International Joint Conference on Artificial Intelligence (IJCAI 2022), pp. 2591\u20132598. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/359"},{"key":"4_CR28","unstructured":"Giacomo, G.D., Masellis, R.D., Montali, M.: Reasoning on LTL on finite traces: Insensitivity to infiniteness. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 1027\u20131033. AAAI Press (2014)"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Giacomo, G.D., Stasio, A.D., Vardi, M.Y., Zhu, S.: Two-stage technique for LTLf synthesis under LTL assumptions. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pp. 304\u2013314 (2020)","DOI":"10.24963\/kr.2020\/31"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Harel, D., Pnueli, A.: On the development of reactive systems. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13, pp. 477\u2013498. Springer, Berlin, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82453-1_17","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T.T., Mukkamala, R.R., Slaats, T.: Designing a cross-organizational case management system using dynamic condition response graphs. In: 2011 IEEE 15th International Enterprise Distributed Object Computing Conference (EDOC 2011), pp. 161\u2013170. IEEE Computer Society (2011)","DOI":"10.1109\/EDOC.2011.35"},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-21759-4_8","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"TT Hildebrandt","year":"2019","unstructured":"Hildebrandt, T.T., Slaats, T., L\u00f3pez, H.A., Debois, S., Carbone, M.: Declarative choreographies and liveness. In: P\u00e9rez, J.A., Yoshida, N. (eds.) FORTE 2019. LNCS, vol. 11535, pp. 129\u2013147. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21759-4_8"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-030-26619-6_6","volume-title":"Business Process Management","author":"S Houhou","year":"2019","unstructured":"Houhou, S., Baarir, S., Poizat, P., Qu\u00e9innec, P.: A first-order logic semantics for communication-parametric BPMN collaborations. In: Hildebrandt, T., van Dongen, B.F., R\u00f6glinger, M., Mendling, J. (eds.) BPM 2019. LNCS, vol. 11675, pp. 52\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26619-6_6"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Jacobs, S., et al.: The first reactive synthesis competition. Int. J. Soft. Tools for Tech. Transf. 19(3), 367\u2013390 (2017)","DOI":"10.1007\/s10009-016-0416-3"},{"key":"4_CR35","unstructured":"Jacobs, S., et al.: The reactive synthesis competition (syntcomp): 2018\u20132021. arXiv preprint arXiv:2206.00251 (2022)"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-14458-5_7","volume-title":"Web Services and Formal Methods","author":"N Lohmann","year":"2010","unstructured":"Lohmann, N., Wolf, K.: Realizability is controllability. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 110\u2013127. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14458-5_7"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Lomidze, G., Schuster, D., Li, CY., van Zelst, S.J.: Enhanced transformation of bpmn models with cancellation features. In: Almeida, J.P.A., Karastoyanova, D., Guizzardi, G., Montali, M., Maggi, F.M., Fonseca, C.M. (eds) Enterprise Design, Operations, and Computing. EDOC 2022. Lecture Notes in Computer Science. vol 13585, pp. 128\u2013144. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17604-3_8","DOI":"10.1007\/978-3-031-17604-3_8"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-33666-9_22","volume-title":"Model Driven Engineering Languages and Systems","author":"S Maoz","year":"2012","unstructured":"Maoz, S., Sa\u2019ar, Y.: Assume-guarantee scenarios: semantics and synthesis. In: France, R.B., Kazmeier, J., Breu, R., Atkinson, C. (eds.) MODELS 2012. LNCS, vol. 7590, pp. 335\u2013351. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33666-9_22"},{"key":"4_CR39","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14538-4","volume-title":"Specification and Verification of Declarative Open Interaction Models","author":"M Montali","year":"2010","unstructured":"Montali, M.: Specification and Verification of Declarative Open Interaction Models. LNBIP, vol. 56. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14538-4"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative specification and verification of service choreographies. ACM Trans. Web 4(1), 1\u201362 (2010)","DOI":"10.1145\/1658373.1658376"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., van der Aalst, W.M.P.: DECLARE: full support for loosely-structured processes. In: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC), pp. 287\u2013300. IEEE Computer Society (2007)","DOI":"10.1109\/EDOC.2007.14"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"4_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652\u2013671. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035790"},{"key":"4_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30409-5","volume-title":"Enabling Flexibility in Process-Aware Information Systems - Challenges, Methods","author":"M Reichert","year":"2012","unstructured":"Reichert, M., Weber, B.: Enabling Flexibility in Process-Aware Information Systems - Challenges, Methods. Springer, Technologies (2012)"},{"key":"4_CR45","unstructured":"Rosner, R.: Modular synthesis of reactive systems. Ph.D. thesis, PhD thesis, Weizmann Institute of Science (1992)"},{"issue":"9","key":"4_CR46","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.datak.2009.02.012","volume":"68","author":"C Stahl","year":"2009","unstructured":"Stahl, C., Wolf, K.: Deciding service composition and substitutability using extended operating guidelines. Data Knowl. Eng. 68(9), 819\u2013833 (2009)","journal-title":"Data Knowl. Eng."},{"key":"4_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-23059-2_10","volume-title":"Business Process Management","author":"M Westergaard","year":"2011","unstructured":"Westergaard, M.: Better algorithms for analyzing and enacting declarative workflow languages using LTL. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 83\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23059-2_10"},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Xiao, S., Li, J., Zhu, S., Shi, Y., Pu, G., Vardi, M.Y.: On-the-fly synthesis for LTL over finite traces. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 6530\u20136537. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i7.16809"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"Zhu, S., De Giacomo, G.: Synthesis of maximally permissive strategies for ltlf specifications. In: Thirty-First International Joint Conference on Artificial Intelligence (IJCAI), pp. 2783\u20132789. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/386"},{"key":"4_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-70389-3_10","volume-title":"Hardware and Software: Verification and Testing","author":"S Zhu","year":"2017","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: A symbolic approach to safety LTL synthesis. In: HVC 2017. LNCS, vol. 10629, pp. 147\u2013162. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70389-3_10"},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"Zhu, S., Tabajara, L.M., Li, J., Pu, G., Vardi, M.Y.: Symbolic LTLf synthesis. arXiv preprint arXiv:1705.08426 (2017)","DOI":"10.24963\/ijcai.2017\/189"}],"container-title":["Lecture Notes in Business Information Processing","Business Process Management Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41623-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T08:54:09Z","timestamp":1730019249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41623-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031416224","9783031416231"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41623-1_4","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"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)"}}]}}