{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T15:12:51Z","timestamp":1784214771920,"version":"3.55.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030557539","type":"print"},{"value":"9783030557546","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-55754-6_1","type":"book-chapter","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T23:02:37Z","timestamp":1597014157000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["From Passive to Active: Learning Timed Automata Efficiently"],"prefix":"10.1007","author":[{"given":"Bernhard K.","family":"Aichernig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Pferscher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Tappler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-09099-3_1","volume-title":"Tests and Proofs","author":"BK Aichernig","year":"2014","unstructured":"Aichernig, B.K., et al.: Model-based mutation testing of an industrial measurement device. In: Seidl, M., Tillmann, N. (eds.) TAP 2014. LNCS, vol. 8570, pp. 1\u201319. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09099-3_1"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921532.1921559","volume":"36","author":"BK Aichernig","year":"2011","unstructured":"Aichernig, B.K., Brandl, H., J\u00f6bstl, E., Krenn, W.: UML in action: a two-layered interpretation for testing. ACM SIGSOFT Softw. Eng. Notes 36(1), 1\u20138 (2011). https:\/\/doi.org\/10.1145\/1921532.1921559","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-38916-0_2","volume-title":"Tests and Proofs","author":"BK Aichernig","year":"2013","unstructured":"Aichernig, B.K., Lorber, F., Ni\u010dkovi\u0107, D.: Time for mutants \u2014 model-based mutation testing with timed automata. In: Veanes, M., Vigan\u00f2, L. (eds.) TAP 2013. LNCS, vol. 7942, pp. 20\u201338. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38916-0_2"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-57288-8_2","volume-title":"NASA Formal Methods","author":"BK Aichernig","year":"2017","unstructured":"Aichernig, B.K., Tappler, M.: Learning from faults: mutation testing in active automata learning. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 19\u201334. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_2"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"1_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0304-3975(97)00173-4","volume":"211","author":"R Alur","year":"1999","unstructured":"Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. Theor. Comput. Sci. 211(1\u20132), 253\u2013273 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(97)00173-4","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. IFAC Proc. 31(18), 447\u2013452 (1998). https:\/\/doi.org\/10.1016\/S1474-6670(17)42032-5, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1474667017420325, Special issue on the 5th IFAC Conference on System Structure and Control 1998 (SSC 1998), Nantes, France, 8\u201310 July","DOI":"10.1016\/S1474-6670(17)42032-5"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_7"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-31984-9_14","volume-title":"Fundamental Approaches to Software Engineering","author":"T Berg","year":"2005","unstructured":"Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 175\u2013189. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-49213-5_5","volume-title":"Compositionality: The Significant Difference","author":"S Bornot","year":"1998","unstructured":"Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 103\u2013129. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49213-5_5"},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.25596\/jalc-2001-003","volume":"6","author":"C Dima","year":"2001","unstructured":"Dima, C.: Real-time automata. J. Autom. Lang. Comb. 6(1), 3\u201323 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-003","journal-title":"J. Autom. Lang. Comb."},{"issue":"47","key":"1_CR13","doi-asserted-by":"publisher","first-page":"4029","DOI":"10.1016\/j.tcs.2010.07.008","volume":"411","author":"O Grinchtein","year":"2010","unstructured":"Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theor. Comput. Sci. 411(47), 4029\u20134054 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.07.008","journal-title":"Theor. Comput. Sci."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435\u2013449. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817949_29"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-24617-6_9","volume-title":"Formal Approaches to Software Testing","author":"A Hessel","year":"2004","unstructured":"Hessel, A., Larsen, K.G., Nielsen, B., Pettersson, P., Skou, A.: Time-optimal real-time test case generation using Uppaal. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 114\u2013130. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24617-6_9"},{"key":"1_CR16","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. Complex Adaptive Systems. MIT Press (1993). ISBN 978-0-262-11170-6"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-24372-1_35","volume-title":"Automated Technology for Verification and Analysis","author":"S-W Lin","year":"2011","unstructured":"Lin, S.-W., Andr\u00e9, \u00c9., Dong, J.S., Sun, J., Liu, Y.: An efficient algorithm for learning event-recording automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 463\u2013472. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_35"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10994-016-5565-9","volume":"105","author":"H Mao","year":"2016","unstructured":"Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning deterministic probabilistic automata from a model checking perspective. Mach. Learn. 105(2), 255\u2013299 (2016). https:\/\/doi.org\/10.1007\/s10994-016-5565-9","journal-title":"Mach. Learn."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-34026-0_38","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"A de Matos Pedro","year":"2012","unstructured":"de Matos Pedro, A., Crocker, P.A., de Sousa, S.M.: Learning stochastic timed automata from sample executions. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 508\u2013523. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_38"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-57288-8_13","volume-title":"NASA Formal Methods","author":"BL Mediouni","year":"2017","unstructured":"Mediouni, B.L., Nouri, A., Bozga, M., Bensalem, S.: Improved learning for stochastic timed models by state-merging algorithms. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 178\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_13"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Pastore, F., Micucci, D., Mariani, L.: Timed k-tail: automatic inference of timed automata. In: 2017 IEEE International Conference on Software Testing, Verification and Validation, ICST 2017, Tokyo, Japan, 13\u201317 March 2017, pp. 401\u2013411. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICST.2017.43, http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=7922464","DOI":"10.1109\/ICST.2017.43"},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"225","DOI":"10.25596\/jalc-2002-225","volume":"7","author":"DA Peled","year":"2002","unstructured":"Peled, D.A., Vardi, M.Y., Yannakakis, M.: Black box checking. J. Autom. Lang. Comb. 7(2), 225\u2013246 (2002). https:\/\/doi.org\/10.25596\/jalc-2002-225","journal-title":"J. Autom. Lang. Comb."},{"key":"1_CR23","unstructured":"Pferscher, A.: Active model learning of timed automata via genetic programming. Master\u2019s thesis, Graz University of Technology, Graz, Austria (2019). https:\/\/diglib.tugraz.at\/active-model-learning-of-timed-automata-via-genetic-programming-2019"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Pferscher, A., Tappler, M.: Supplemental materials for \u201cFrom passive to active: learning timed automata efficiently\u201d (2020). https:\/\/doi.org\/10.6084\/m9.figshare.9976211.v1, https:\/\/figshare.com\/articles\/Supplemental_Materials_for_From_Passive_to_Active_Learning_Timed_Automata_Efficiently_\/9976211\/1","DOI":"10.6084\/m9.figshare.9976211.v1"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-030-25540-4_16","volume-title":"Computer Aided Verification","author":"M Garc\u00eda Soto","year":"2019","unstructured":"Garc\u00eda Soto, M., Henzinger, T.A., Schilling, C., Zeleznik, L.: Membership-based synthesis of linear hybrid automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 297\u2013314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_16"},{"issue":"1\u20132","key":"1_CR26","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(99)00134-6","volume":"254","author":"J Springintveld","year":"2001","unstructured":"Springintveld, J., Vaandrager, F.W., D\u2019Argenio, P.R.: Testing timed automata. Theor. Comput. Sci. 254(1\u20132), 225\u2013257 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(99)00134-6","journal-title":"Theor. Comput. Sci."},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-030-29662-9_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Tappler","year":"2019","unstructured":"Tappler, M., Aichernig, B.K., Larsen, K.G., Lorber, F.: Time to learn \u2013 learning timed automata from tests. In: Andr\u00e9, \u00c9., Stoelinga, M. (eds.) FORMATS 2019. LNCS, vol. 11750, pp. 216\u2013235. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29662-9_13"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78917-8_1","volume-title":"Formal Methods and Testing","author":"J Tretmans","year":"2008","unstructured":"Tretmans, J.: Model based testing with labelled transition systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) Formal Methods and Testing. LNCS, vol. 4949, pp. 1\u201338. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78917-8_1"},{"issue":"5","key":"1_CR29","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test. Verification Reliab. 22(5), 297\u2013312 (2012). https:\/\/doi.org\/10.1002\/stvr.456","journal-title":"Softw. Test. Verification Reliab."},{"key":"1_CR30","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: An algorithm for learning real-time automata. In: Benelearn 2007: Proceedings of the Annual Machine Learning Conference of Belgium and the Netherlands, Amsterdam, The Netherlands, 14\u201315 May 2007, pp. 128\u2013135 (2007)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-15488-1_17","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"S Verwer","year":"2010","unstructured":"Verwer, S., de Weerdt, M., Witteveen, C.: A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 203\u2013216. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15488-1_17"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-05089-3_20","volume-title":"FM 2009: Formal Methods","author":"N Walkinshaw","year":"2009","unstructured":"Walkinshaw, N., Derrick, J., Guo, Q.: Iterative refinement of reverse-engineered models by model-based testing. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 305\u2013320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_20"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55754-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T03:26:41Z","timestamp":1619234801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-55754-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030557539","9783030557546"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55754-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moffett Field, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ti.arc.nasa.gov\/events\/nfm-2020\/","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":"62","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":"20","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":"5","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":"32% - 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.2","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":"4.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 conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}