{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:42:14Z","timestamp":1763764934696,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031274800"},{"type":"electronic","value":"9783031274817"}],"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-27481-7_9","type":"book-chapter","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:03:10Z","timestamp":1677765790000},"page":"122-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Can We Communicate? Using Dynamic Logic to\u00a0Verify Team Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2930-6367","authenticated-orcid":false,"given":"Maurice H.","family":"ter Beek","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0006-6440","authenticated-orcid":false,"given":"Guillermina","family":"Cledou","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Hennicker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0971-8919","authenticated-orcid":false,"given":"Jos\u00e9","family":"Proen\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11817963_8","volume-title":"Computer Aided Verification","author":"BT Adler","year":"2006","unstructured":"Adler, B.T., et al.: Ticc: a tool for interface compatibility and composition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 59\u201362. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_8"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-25527-9_9","volume-title":"Programming Languages with Applications to Biology and Security","author":"M Bartoletti","year":"2015","unstructured":"Bartoletti, M., Cimoli, T., Zunino, R.: Compliance in behavioural contracts: a brief survey. In: Bodei, C., Ferrari, G.-L., Priami, C. (eds.) Programming Languages with Applications to Biology and Security. LNCS, vol. 9465, pp. 103\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25527-9_9"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Basile, D., ter Beek, M.H.: Contract automata library. Sci. Comput. Program. 221 (2022). https:\/\/doi.org\/10.1016\/j.scico.2022.102841","DOI":"10.1016\/j.scico.2022.102841"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Basile, D., ter Beek, M.H.: A runtime environment for contract automata. In: Chechik, M., et al. (eds.) FM 2023. LNCS, vol. 14000, pp. 550\u2013567. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_31","DOI":"10.1007\/978-3-031-27481-7_31"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Basile, D., et al.: Controller synthesis of service contracts with variability. Sci. Comput. Program. 187 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102344","DOI":"10.1016\/j.scico.2019.102344"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Basile, D., Degano, P., Ferrari, G.L.: Automata for specifying and orchestrating service contracts. Logical Methods Comput. Sci. 12(4:6), 1\u201351 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(4:6)2016","DOI":"10.2168\/LMCS-12(4:6)2016"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SS Bauer","year":"2010","unstructured":"Bauer, S.S., Mayer, P., Schroeder, A., Hennicker, R.: On weak modal compatibility, refinement, and the MIO workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 175\u2013189. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_15"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-59746-1_14","volume-title":"Coordination Models and Languages","author":"MH ter Beek","year":"2017","unstructured":"ter Beek, M.H., Carmona, J., Hennicker, R., Kleijn, J.: Communication requirements for team automata. In: Jacquet, J.-M., Massink, M. (eds.) COORDINATION 2017. LNCS, vol. 10319, pp. 256\u2013277. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59746-1_14"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-90870-6_26","volume-title":"Formal Methods","author":"MH ter Beek","year":"2021","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Featured team automata. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 483\u2013502. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_26"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Can we Communicate? Using dynamic logic to verify team automata (extended version). Technical report, Zenodo (2022). https:\/\/doi.org\/10.5281\/zenodo.7418074","DOI":"10.5281\/zenodo.7418074"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/0-306-48019-0_4","volume-title":"Proceedings of the 7th European Conference on Computer Supported Cooperative Work","author":"MH ter Beek","year":"2001","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Team automata for spatial access control. In: Prinz, W., Jarke, M., Rogers, Y., Schmidt, K., Wulf, V. (eds.) ECSCW 2001, pp. 59\u201378. Springer, Dordrecht (2001). https:\/\/doi.org\/10.1007\/0-306-48019-0_4"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1022407907596","volume":"12","author":"MH ter Beek","year":"2003","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Comput. Support. Coop. Work 12(1), 21\u201369 (2003). https:\/\/doi.org\/10.1023\/A:1022407907596","journal-title":"Comput. Support. Coop. Work"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-64276-1_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2020","author":"MH ter Beek","year":"2020","unstructured":"ter Beek, M.H., Hennicker, R., Kleijn, J.: Compositionality of safe communication in systems of team automata. In: Pun, V.K.I., Stolz, V., Simao, A. (eds.) ICTAC 2020. LNCS, vol. 12545, pp. 200\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64276-1_11"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-45236-2_22","volume-title":"FME 2003: Formal Methods","author":"MH ter Beek","year":"2003","unstructured":"ter Beek, M.H., Kleijn, J.: Team automata satisfying compositionality. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 381\u2013400. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45236-2_22"},{"issue":"5","key":"9_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ipl.2005.05.012","volume":"95","author":"MH ter Beek","year":"2005","unstructured":"ter Beek, M.H., Kleijn, J.: Modularity for teams of I\/O automata. Inf. Process. Lett. 95(5), 487\u2013495 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.05.012","journal-title":"Inf. Process. Lett."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2011.12.020","volume":"429","author":"MH ter Beek","year":"2012","unstructured":"ter Beek, M.H., Kleijn, J.: Vector team automata. Theor. Comput. Sci. 429, 21\u201329 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.020","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2004.11.044","volume":"128","author":"MH ter Beek","year":"2005","unstructured":"ter Beek, M.H., Lenzini, G., Petrocchi, M.: Team automata for security: a survey. Electron. Notes Theor. Comput. Sci. 128(5), 105\u2013119 (2005). https:\/\/doi.org\/10.1016\/j.entcs.2004.11.044","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"9_CR18","unstructured":"Beyer, D., et al.: CHIC: Checking Interface Compatibility (2007). https:\/\/ptolemy.berkeley.edu\/projects\/embedded\/research\/chic"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Bocchi, L., Orchard, D., Voinea, A.L.: A theory of composing protocols. Art Sci. Eng. Program. 7(2), 6:1\u20136:76 (2023). https:\/\/doi.org\/10.22152\/programming-journal.org\/2023\/7\/6","DOI":"10.22152\/programming-journal.org\/2023\/7\/6"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-31811-8_2","volume-title":"Technologies for E-Services","author":"L Bordeaux","year":"2005","unstructured":"Bordeaux, L., Sala\u00fcn, G., Berardi, D., Mecella, M.: When are two web services compatible? In: Shan, M.-C., Dayal, U., Hsu, M. (eds.) TES 2004. LNCS, vol. 3324, pp. 15\u201328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31811-8_2"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983). https:\/\/doi.org\/10.1145\/322374.322380","journal-title":"J. ACM"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-17465-1_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Bunte","year":"2019","unstructured":"Bunte, O., et al.: The mCRL2 toolset for analysing concurrent systems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 21\u201339. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_2"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-36126-X_22","volume-title":"Formal Methods in Computer-Aided Design","author":"J Carmona","year":"2002","unstructured":"Carmona, J., Cortadella, J.: Input\/output compatibility of reactive systems. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 360\u2013377. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36126-X_22"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.03.006","volume":"484","author":"J Carmona","year":"2013","unstructured":"Carmona, J., Kleijn, J.: Compatibility in a multi-component environment. Theor. Comput. Sci. 484, 1\u201315 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.03.006","journal-title":"Theor. Comput. Sci."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-39979-7_8","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2003","author":"C Carrez","year":"2003","unstructured":"Carrez, C., Fantechi, A., Najm, E.: Behavioural contracts for a sound assembly of components. In: K\u00f6nig, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 111\u2013126. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39979-7_8"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Program. Lang. Syst. 31(5), 19:1\u201319:61 (2009). https:\/\/doi.org\/10.1145\/1538917.1538920","DOI":"10.1145\/1538917.1538920"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/3-540-45657-0_35","volume-title":"Computer Aided Verification","author":"A Chakrabarti","year":"2002","unstructured":"Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Jurdzi\u0144ski, M., Mang, F.Y.C.: Interface compatibility checking for software modules. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 428\u2013441. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_35"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the 8th European Software Engineering Conference Held Jointly with 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering (ESEC\/FSE), pp. 109\u2013120. ACM (2001). https:\/\/doi.org\/10.1145\/503209.503226","DOI":"10.1145\/503209.503226"},{"issue":"7\u20138","key":"9_CR29","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.scico.2011.03.009","volume":"77","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Ouederni, M., Sala\u00fcn, G.: A generic framework for $$n$$-protocol compatibility checking. Sci. Comput. Program. 77(7\u20138), 870\u2013886 (2012). https:\/\/doi.org\/10.1016\/j.scico.2011.03.009","journal-title":"Sci. Comput. Program."},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Ellis, C.A.: Team automata for groupware systems. In: Proceedings of the 1st International ACM SIGGROUP Conference on Supporting Group Work (GROUP), pp. 415\u2013424. ACM (1997). https:\/\/doi.org\/10.1145\/266838.267363","DOI":"10.1145\/266838.267363"},{"key":"9_CR31","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9946.001.0001","volume-title":"Modeling and Analysis of Communicating Systems","author":"JF Groote","year":"2014","unstructured":"Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press, Cambridge (2014)"},{"key":"9_CR32","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic. Foundations of Computing","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. Foundations of Computing. MIT Press, Cambridge (2000). https:\/\/doi.org\/10.7551\/mitpress\/2516.001.0001"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79"},{"issue":"1","key":"9_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.23638\/LMCS-14(1:1)2018","volume":"14","author":"R Hennicker","year":"2018","unstructured":"Hennicker, R., Bidoit, M.: Compatibility properties of synchronously and asynchronously communicating components. Logical Methods Comput. Sci. 14(1), 1\u201331 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:1)2018","journal-title":"Logical Methods Comput. Sci."},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-319-39519-7_9","volume-title":"Coordination Models and Languages","author":"R Hennicker","year":"2016","unstructured":"Hennicker, R., Bidoit, M., Dang, T.-S.: On synchronous and asynchronous compatibility of communicating components. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 138\u2013156. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39519-7_9"},{"issue":"2\u20133","key":"9_CR36","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00236-015-0220-7","volume":"52","author":"R Hennicker","year":"2015","unstructured":"Hennicker, R., Knapp, A.: Moving from interface theories to assembly theories. Acta Inf. 52(2\u20133), 235\u2013268 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0220-7","journal-title":"Acta Inf."},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"KG Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O automata for interface and product line theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 64\u201379. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_6"},{"issue":"4\u20135","key":"9_CR38","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00236-014-0211-0","volume":"52","author":"G L\u00fcttgen","year":"2015","unstructured":"L\u00fcttgen, G., Vogler, W., Fendrich, S.: Richer interface automata with optimistic and pessimistic compatibility. Acta Inf. 52(4\u20135), 305\u2013336 (2015). https:\/\/doi.org\/10.1007\/s00236-014-0211-0","journal-title":"Acta Inf."},{"key":"9_CR39","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to input\/output automata. CWI Q. 2(3), 219\u2013246 (1989). https:\/\/ir.cwi.nl\/pub\/18164"},{"key":"9_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-31517-7_13","volume-title":"Fundamentals of Software Engineering","author":"J Proen\u00e7a","year":"2019","unstructured":"Proen\u00e7a, J., Madeira, A.: Taming hierarchical connectors. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 186\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31517-7_13"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27481-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:06:11Z","timestamp":1677765971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27481-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274800","9783031274817"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27481-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"6 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fm2023.isp.uni-luebeck.de\/wordpress\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"95","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":"26","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":"2","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":"27% - 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":"The proceedings also include 7 short industry papers","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)"}}]}}