{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:48:06Z","timestamp":1771573686906,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031077265","type":"print"},{"value":"9783031077272","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07727-2_13","type":"book-chapter","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T01:12:12Z","timestamp":1654045932000},"page":"229-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning Finite State Models from Recurrent Neural Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8089-5024","authenticated-orcid":false,"given":"Edi","family":"Mu\u0161kardin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3484-5584","authenticated-orcid":false,"given":"Bernhard K.","family":"Aichernig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8420-6377","authenticated-orcid":false,"given":"Ingo","family":"Pill","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-5609","authenticated-orcid":false,"given":"Martin","family":"Tappler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., et al.: Learning a behavior model of hybrid systems through combining model-based testing and machine learning. In: Gaston, C., Kosmatov, N., Gall, P.L. (eds.) Testing Software and Systems - 31st IFIP WG 6.1 International Conference, ICTSS 2019, Paris, France, 15\u201317 October 2019, Proceedings. LNPSE, vol. 11812, pp. 3\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31280-0_1","DOI":"10.1007\/978-3-030-31280-0_1"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Mostowski, W., Mousavi, M.R., Tappler, M., Taromirad, M.: Model learning and model-based testing. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 74\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_3","DOI":"10.1007\/978-3-319-96562-8_3"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Aichernig, B.K., Tappler, M., Wallner, F.: benchmarking combinations of learning and testing algorithms for active automata learning. In: Ahrendt, W., Wehrheim, H. (eds.) TAP 2020. LNCS, vol. 12165, pp. 3\u201322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50995-8_1","DOI":"10.1007\/978-3-030-50995-8_1"},{"key":"13_CR4","doi-asserted-by":"publisher","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","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Carr, S., Jansen, N., Topcu, U.: Verifiable RNN-based policies for POMDPs under temporal logic constraints. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 4121\u20134127. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/570","DOI":"10.24963\/ijcai.2020\/570"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cho, K., van Merrienboer, B., Bahdanau, D., Bengio, Y.: On the properties of neural machine translation: Encoder-decoder approaches. CoRR abs\/1409.1259 (2014). http:\/\/arxiv.org\/abs\/1409.1259","DOI":"10.3115\/v1\/W14-4012"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Software Eng. 4(3), 178\u2013187 (1978). https:\/\/doi.org\/10.1109\/TSE.1978.231496","DOI":"10.1109\/TSE.1978.231496"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Dong, G., Wang, J., Sun, J., Zhang, Y., Wang, X., Dai, T., Dong, J.S., Wang, X.: Towards interpreting recurrent neural networks through probabilistic abstraction. In: 35th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2020, 21\u201325 September 2020, pp. 499\u2013510. IEEE, Melbourne, Australia (2020). https:\/\/doi.org\/10.1145\/3324884.3416592","DOI":"10.1145\/3324884.3416592"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Gargantini, A.: 4 conformance testing. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 87\u2013111. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11498490_5","DOI":"10.1007\/11498490_5"},{"key":"13_CR10","unstructured":"Ghosh, B., Neider, D.: A formal language approach to explaining RNNs. CoRR abs\/2006.07292 (2020). https:\/\/arxiv.org\/abs\/2006.07292"},{"key":"13_CR11","unstructured":"Gopinath, D., Katz, G., Pasareanu, C.S., Barrett, C.W.: Deepsafe: a data-driven approach for checking adversarial robustness in neural networks. CoRR abs\/1710.00486 (2017). http:\/\/arxiv.org\/abs\/1710.00486"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93:1\u201393:42 (2019). https:\/\/doi.org\/10.1145\/3236009","DOI":"10.1145\/3236009"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS - lessons learned in the ZULU challenge. In: ISoLA 2010. LNCS, vol. 6415, pp. 687\u2013704 (2010)","DOI":"10.1007\/978-3-642-16558-0_55"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Huang, X., Kwiatkowska, M., Wang, S., Wu, M.: Safety verification of deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 3\u201329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_1","DOI":"10.1007\/978-3-319-63387-9_1"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32","DOI":"10.1007\/978-3-319-21690-4_32"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Khmelnitsky, I., et al.: Property-directed verification and\u00a0robustness certification of\u00a0recurrent neural networks. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 364\u2013380. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_24","DOI":"10.1007\/978-3-030-88885-5_24"},{"key":"13_CR18","volume-title":"Representation of Events in Nerve Nets and Finite Automata","author":"SC Kleene","year":"1951","unstructured":"Kleene, S.C.: Representation of Events in Nerve Nets and Finite Automata. RAND Corporation, Santa Monica, CA (1951)"},{"key":"13_CR19","unstructured":"Koul, A., Fern, A., Greydanus, S.: Learning finite state representations of recurrent policy networks. In: 7th International Conference on Learning Representations, ICLR 2019, 6\u20139 May 2019. OpenReview.net, New Orleans, LA, USA (2019). https:\/\/openreview.net\/forum?id=S1gOpsCctm"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Mayr, F., Yovine, S.: regular inference on artificial neural\u00a0networks. In: Holzinger, A., Kieseberg, P., Tjoa, A.M., Weippl, E. (eds.) CD-MAKE 2018. LNCS, vol. 11015, pp. 350\u2013369. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99740-7_25","DOI":"10.1007\/978-3-319-99740-7_25"},{"key":"13_CR21","unstructured":"Mohri, M., Rostamizadeh, A., Talwalkar, A.: Foundations of Machine Learning. The MIT Press (2012)"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Mu\u0161kardin, E., Aichernig, B.K., Pill, I., Pferscher, A., Tappler, M.: AALpy: an active automata learning library. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 67\u201373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_5","DOI":"10.1007\/978-3-030-88885-5_5"},{"key":"13_CR23","unstructured":"Neubig, G., et al.: DyNet: The dynamic neural network toolkit. CoRR abs\/1701.03980 (2017). http:\/\/arxiv.org\/abs\/1701.03980"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Oliva, C., Lago-Fern\u00e1ndez, L.F.: On the interpretation of recurrent neural networks as finite state machines. In: Tetko, I.V., Kurkov\u00e1, V., Karpov, P., Theis, F. (eds.) ICANN 2019. LNCS, vol. 11727, pp. 312\u2013323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30487-4_25","DOI":"10.1007\/978-3-030-30487-4_25"},{"key":"13_CR25","doi-asserted-by":"publisher","unstructured":"Oliva, C., Lago-Fern\u00e1ndez, L.F.: Stability of internal states in recurrent neural networks trained on regular languages. Neurocomputing 452, 212\u2013223 (2021). https:\/\/doi.org\/10.1016\/j.neucom.2021.04.058","DOI":"10.1016\/j.neucom.2021.04.058"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Omlin, C.W., Giles, C.L.: Extraction of rules from discrete-time recurrent neural networks. Neural Networks 9(1), 41\u201352 (1996). https:\/\/doi.org\/10.1016\/0893-6080(95)00086-0","DOI":"10.1016\/0893-6080(95)00086-0"},{"key":"13_CR27","doi-asserted-by":"publisher","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cwhy should I trust you?\": explaining the predictions of any classifier. In: Krishnapuram, B., Shah, M., Smola, A.J., Aggarwal, C.C., Shen, D., Rastogi, R. (eds.) Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 13\u201317 August 2016. pp. 1135\u20131144. ACM,San Francisco, CA, USA (2016). https:\/\/doi.org\/10.1145\/2939672.2939778","DOI":"10.1145\/2939672.2939778"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Shih, A., Darwiche, A., Choi, A.: Verifying binarized neural networks by angluin-style learning. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 354\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_25","DOI":"10.1007\/978-3-030-24258-9_25"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Siegelmann, H.T., Sontag, E.D.: Turing computability with neural nets. Appl. Math. Lett. 4(6), 77\u201380 (1991). https:\/\/doi.org\/10.1016\/0893-9659(91)90080-F, https:\/\/www.sciencedirect.com\/science\/article\/pii\/089396599190080F","DOI":"10.1016\/0893-9659(91)90080-F"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Smeenk, W., Moerman, J., Vaandrager, F., Jansen, D.N.: Applying automata learning to embedded control software. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 67\u201383. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25423-4_5","DOI":"10.1007\/978-3-319-25423-4_5"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Sun, Y., Wu, M., Ruan, W., Huang, X., Kwiatkowska, M., Kroening, D.: Concolic testing for deep neural networks. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, 3\u20137 September 2018, pp. 109\u2013119. ACM, Montpellier, France (2018). https:\/\/doi.org\/10.1145\/3238147.3238172","DOI":"10.1145\/3238147.3238172"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Tomita, M.: Dynamic construction of finite automata from examples using hill-climbing. In: Conference of the Cognitive Science Society, pp. 105\u2013108 (1982)","DOI":"10.21236\/ADA120123"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984). https:\/\/doi.org\/10.1145\/1968.1972","DOI":"10.1145\/1968.1972"},{"key":"13_CR34","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I.: Attention is all you need. In: Guyon, I., von Luxburg, U., Bengio, S., Wallach, H.M., Fergus, R., Vishwanathan, S.V.N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 4\u20139 December 2017, pp. 5998\u20136008. Long Beach, CA, USA 2017), https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/3f5ee243547dee91fbd053c1c4a845aa-Abstract.html"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Walkinshaw, N., Bogdanov, K.: Automated comparison of state-based software models in terms of their language and structure. ACM Trans. Softw. Eng. Methodol. 22(2), 13:1\u201313:37 (2013). https:\/\/doi.org\/10.1145\/2430545.2430549","DOI":"10.1145\/2430545.2430549"},{"key":"13_CR36","unstructured":"Wang, C., Niepert, M.: State-regularized recurrent neural networks. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9\u201315 June 2019. Proceedings of Machine Learning Research, vol. 97, pp. 6596\u20136606. PMLR,Long Beach, California, USA (2019). http:\/\/proceedings.mlr.press\/v97\/wang19j.html"},{"key":"13_CR37","unstructured":"Wang, Q., Zhang, K., II, A.G.O., Xing, X., Liu, X., Giles, C.L.: A comparison of rule extraction for different recurrent neural network models and grammatical complexity. CoRR abs\/1801.05420 (2018). http:\/\/arxiv.org\/abs\/1801.05420"},{"key":"13_CR38","unstructured":"Wang, Q., Zhang, K., Liu, X., Giles, C.L.: Verification of recurrent neural networks through rule extraction. CoRR abs\/1811.06029 (2018). http:\/\/arxiv.org\/abs\/1811.06029"},{"key":"13_CR39","unstructured":"Weiss, G., Goldberg, Y., Yahav, E.: Extracting automata from recurrent neural networks using queries and counterexamples. In: Dy, J.G., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\u00e4ssan, 10\u201315 July 2018. Proceedings of Machine Learning Research, vol. 80, pp. 5244\u20135253. PMLR, Stockholm, Sweden (2018). http:\/\/proceedings.mlr.press\/v80\/weiss18a.html"},{"key":"13_CR40","unstructured":"Weiss, G., Goldberg, Y., Yahav, E.: Learning deterministic weighted automata with queries and counterexamples. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8\u201314 December 2019, pp. 8558\u20138569. Vancouver, BC, Canada (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/d3f93e7766e8e1b7ef66dfdd9a8be93b-Abstract.html"},{"key":"13_CR41","doi-asserted-by":"publisher","unstructured":"Yellin, D.M., Weiss, G.: Synthesizing context-free grammars from recurrent neural networks. In: TACAS 2021. LNCS, vol. 12651, pp. 351\u2013369. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_19","DOI":"10.1007\/978-3-030-72016-2_19"},{"key":"13_CR42","unstructured":"Zachary Chase Lipton, John Berkowitz, C.E.: A critical review of recurrent neural networks for sequence learning. CoRR abs\/1506.00019 (2015). http:\/\/arxiv.org\/abs\/1506.00019"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07727-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T19:19:55Z","timestamp":1654629595000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07727-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031077265","9783031077272"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07727-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lugano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2022","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":"ifm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ifmconference.org\/","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":"46","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":"14","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":"30% - 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":"4","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":"Also includes: 1 abstract of an invited talk, 2 invited papers, 7 extended abstracts of presentations accepted at PhD symposium","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)"}}]}}