{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:16:20Z","timestamp":1742930180403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030642754"},{"type":"electronic","value":"9783030642761"}],"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-64276-1_3","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"43-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages"],"prefix":"10.1007","author":[{"given":"Frits","family":"Vaandrager","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhisek","family":"Midya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-014-0216-x","volume":"46","author":"F Aarts","year":"2014","unstructured":"Aarts, F., Jonsson, B., Uijen, J., Vaandrager, F.: Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46(1), 1\u201341 (2014). https:\/\/doi.org\/10.1007\/s10703-014-0216-x","journal-title":"Formal Methods Syst. Des."},{"issue":"2","key":"3_CR3","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)","journal-title":"Inf. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.07.031","volume":"650","author":"D Angluin","year":"2016","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. Theor. Comput. Sci. 650, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR5","unstructured":"Benedikt, M., Ley, C., Puppis, G.: What you must remember when processing data words. In: Proceedings International Workshop on Foundations of Data Management, CEUR Workshop Proceedings 619. CEUR-WS.org (2010)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: Proceedings LICS 2011, pp. 355\u2013364. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.48"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Botin\u010dan, M., Babi\u0107, D.: Sigma*: symbolic learning of input-output specifications. In: Proceedings POPL 2013, New York, NY, USA, pp. 443\u2013456. ACM (2013)","DOI":"10.1145\/2480359.2429123"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"3_CR9","unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. In: Proceedings DIFTS 15, Austin, Texas (2015)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jlamp.2014.07.004","volume":"84","author":"S Cassel","year":"2015","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. J. Log. Algebr. Meth. Program. 84(1), 54\u201366 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233\u2013263 (2016). https:\/\/doi.org\/10.1007\/s00165-016-0355-5","journal-title":"Formal Aspects Comput."},{"key":"3_CR12","unstructured":"Cho, C., Babi\u0107, D., Poosankam, P., Chen, K., Wu, E., Song, D.: Mace: model-inference-assisted concolic exploration for protocol and vulnerability discovery. In: Proceedings SEC 2011, Berkeley, CA, USA, p. 10. USENIX Association (2011)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-67113-0_12","volume-title":"Critical Systems: Formal Methods and Automated Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2017","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Howar, F.: Learning-based testing the sliding window behavior of TCP implementations. In: Petrucci, L., Seceleanu, C., Cavalcanti, A. (eds.) FMICS\/AVoCS -2017. LNCS, vol. 10471, pp. 185\u2013200. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67113-0_12"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Lenaerts, T., Poll, E., de Ruiter, J., Vaandrager, F., Verleg, P.: Model learning and model checking of SSH implementations. In: Proceedings SPIN 2017, New York, NY, USA, pp. 142\u2013151. ACM (2017)","DOI":"10.1145\/3092282.3092289"},{"issue":"1\u20133","key":"3_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(03)00246-9","volume":"306","author":"N Francez","year":"2003","unstructured":"Francez, N., Kaminski, M.: An algebraic characterization of deterministic regular languages over infinite alphabets. Theor. Comput. Sci. 306(1\u20133), 155\u2013175 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Garhewal, B., Vaandrager, F., Howar, F., Schrijvers, T., Lenaerts, T., Smits, R.: Grey-box learning of register automata. In: Proceedings ICTAC 2020. Full version available as CoRR arXiv:2009.09975, September 2020, to appear","DOI":"10.1007\/978-3-030-63461-2_2"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-33125-1_18","volume-title":"Static Analysis","author":"D Giannakopoulou","year":"2012","unstructured":"Giannakopoulou, D., Rakamari\u0107, Z., Raman, V.: Symbolic learning of component interfaces. In: Min\u00e9, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 248\u2013264. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33125-1_18"},{"issue":"6","key":"3_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/1064978.1065036","volume":"40","author":"P Godefroid","year":"2005","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: directed automated random testing. SIGPLAN Not. 40(6), 213\u2013223 (2005)","journal-title":"SIGPLAN Not."},{"key":"3_CR20","first-page":"1033","volume":"55","author":"A Hagerer","year":"2001","unstructured":"Hagerer, A., Margaria, T., Niese, O., Steffen, B., Brune, G., Ide, H.: Efficient regression testing of CTI-systems: testing a complex call-center solution. Ann. Rev. Commun. Int. Eng. Consortium (IEC) 55, 1033\u20131040 (2001)","journal-title":"Ann. Rev. Commun. Int. Eng. Consortium (IEC)"},{"key":"3_CR21","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"H\u00f6schele, M., Zeller, A.: Mining input grammars from dynamic taints. In: Proceeding ASE 2016, pp. 720\u2013725. ACM (2016)","DOI":"10.1145\/2970276.2970321"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-34026-0_41","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"F Howar","year":"2012","unstructured":"Howar, F., Isberner, M., Steffen, B., Bauer, O., Jonsson, B.: Inferring semantic interfaces of data structures. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 554\u2013571. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34026-0_41"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Howar, F., Giannakopoulou, D., Rakamari\u0107, Z.: Hybrid learning: interface generation through static, dynamic, and symbolic analysis. In: Proceedings ISSTA 2013, New York, NY, USA, pp. 268\u2013279. ACM (2013)","DOI":"10.1145\/2483760.2483783"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-319-91908-9_26","volume-title":"Computing and Software Science","author":"F Howar","year":"2019","unstructured":"Howar, F., Jonsson, B., Vaandrager, F.: Combining black-box and white-box techniques for learning register automata. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 563\u2013588. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91908-9_26"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-96562-8_5","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","author":"F Howar","year":"2018","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 123\u2013148. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_5"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-030-17502-3_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Jasper","year":"2019","unstructured":"Jasper, M., et al.: RERS 2019: combining synthesis with real-world models. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 101\u2013115. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_7"},{"key":"3_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and Computability. Undergraduate Texts in Computer Science","author":"D Kozen","year":"1997","unstructured":"Kozen, D.: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-1-4612-1844-9"},{"issue":"1","key":"3_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00312-X","volume":"183","author":"O Maler","year":"1997","unstructured":"Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theor. Comput. Sci. 183(1), 93\u2013112 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: Proceedings POPL 2017, pp. 613\u2013625. ACM (2017)","DOI":"10.1145\/3093333.3009879"},{"issue":"4","key":"3_CR32","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Am. Math. Soc. 9(4), 541\u2013544 (1958)","journal-title":"Proc. Am. Math. Soc."},{"key":"3_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8622-1","volume-title":"A Course in Model Theory - An Introduction to Contempary Mathematical Logic","author":"B Poizat","year":"2000","unstructured":"Poizat, B.: A Course in Model Theory - An Introduction to Contempary Mathematical Logic. Springer-Verlag, New York (2000). https:\/\/doi.org\/10.1007\/978-1-4419-8622-1"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"RL Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-33693-0_20","volume-title":"Integrated Formal Methods","author":"M Schuts","year":"2016","unstructured":"Schuts, M., Hooman, J., Vaandrager, F.: Refactoring of legacy software using model learning and equivalence checking: an industrial experience report. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 311\u2013325. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_20"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 207\u2013222. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-77313-1_14","volume-title":"Language and Automata Theory and Applications","author":"R Smetsers","year":"2018","unstructured":"Smetsers, R., Fiter\u0103u-Bro\u015ftean, P., Vaandrager, F.: Model learning as a satisfiability modulo theories problem. In: Klein, S.T., Mart\u00edn-Vide, C., Shapira, D. (eds.) LATA 2018. LNCS, vol. 10792, pp. 182\u2013194. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77313-1_14"},{"issue":"2","key":"3_CR38","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Vaandrager, F.W., Midya, A.: A Myhill-Nerode theorem for register automata and symbolic trace languages. CoRR arXiv:2007.03540, July 2020","DOI":"10.1007\/978-3-030-64276-1_3"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Yang, N., et al.: Improving model inference in industry by combining active and passive learning. In: Proceedings SANER 2019, pp. 253\u2013263. IEEE (2019)","DOI":"10.1109\/SANER.2019.8668007"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64276-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T01:33:12Z","timestamp":1619227992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64276-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030642754","9783030642761"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64276-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2020.github.io\/","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":"40","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":"15","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":"38% - 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":"4","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 conference was planned to take place in Macau, China, and changed to a virtual format 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)"}}]}}