{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:48:51Z","timestamp":1771573731783,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031171079","type":"print"},{"value":"9783031171086","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17108-6_10","type":"book-chapter","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T13:04:15Z","timestamp":1663765455000},"page":"155-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constrained Training of\u00a0Recurrent Neural Networks for\u00a0Automata Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3484-5584","authenticated-orcid":false,"given":"Bernhard K.","family":"Aichernig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2881-4519","authenticated-orcid":false,"given":"Sandra","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7502-0688","authenticated-orcid":false,"given":"Cristinel","family":"Mateis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9446-9541","authenticated-orcid":false,"given":"Andrea","family":"Pferscher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8208-6087","authenticated-orcid":false,"given":"Dominik","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-5609","authenticated-orcid":false,"given":"Martin","family":"Tappler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-96562-8_3","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","author":"BK Aichernig","year":"2018","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"},{"issue":"2","key":"10_CR2","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":"10_CR3","doi-asserted-by":"publisher","unstructured":"Carr, S., Jansen, N., Topcu, U.: Verifiable RNN-based policies for POMDPs under temporal logic constraints. In: IJCAI, pp. 4121\u20134127. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/570","DOI":"10.24963\/ijcai.2020\/570"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Dong, G., et al.: Towards interpreting recurrent neural networks through probabilistic abstraction. In: ASE, pp. 499\u2013510. IEEE (2020). https:\/\/doi.org\/10.1145\/3324884.3416592","DOI":"10.1145\/3324884.3416592"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1207\/s15516709cog1402_1","volume":"14","author":"JL Elman","year":"1990","unstructured":"Elman, J.L.: Finding structure in time. Cogn. Sci. 14(2), 179\u2013211 (1990). https:\/\/doi.org\/10.1207\/s15516709cog1402_1","journal-title":"Cogn. Sci."},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90562-4","journal-title":"Inf. Control"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/72.286928","volume":"5","author":"MW Goudreau","year":"1994","unstructured":"Goudreau, M.W., Giles, C.L., Chakradhar, S.T., Chen, D.: First-order versus second-order single-layer recurrent neural networks. IEEE Trans. Neural Netw. 5(3), 511\u2013513 (1994). https:\/\/doi.org\/10.1109\/72.286928","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10664-012-9222-z","volume":"18","author":"M Heule","year":"2013","unstructured":"Heule, M., Verwer, S.: Software model synthesis using satisfiability solvers. Empir. Softw. Eng. 18(4), 825\u2013856 (2013)","journal-title":"Empir. Softw. Eng."},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C de la Higuera","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, New York (2010)"},{"key":"10_CR10","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":"10_CR11","doi-asserted-by":"crossref","unstructured":"Irfan, M.N., Oriat, C., Groz, R.: Model inference and testing. In: Advances in Computers, vol. 89, pp. 89\u2013139. Elsevier (2013)","DOI":"10.1016\/B978-0-12-408094-2.00003-5"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015, Part I. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-88885-5_24","volume-title":"Automated Technology for Verification and Analysis","author":"I Khmelnitsky","year":"2021","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"},{"key":"10_CR14","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. In: ICLR (2015)"},{"key":"10_CR15","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 (1951)"},{"key":"10_CR16","unstructured":"Koul, A., Fern, A., Greydanus, S.: Learning finite state representations of recurrent policy networks. In: ICLR. OpenReview.net (2019)"},{"issue":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1780","DOI":"10.1109\/TNNLS.2019.2926466","volume":"31","author":"Y Ma","year":"2020","unstructured":"Ma, Y., Principe, J.C.: A taxonomy for neural memory networks. IEEE Trans. Neural Netw. Learn. Syst. 31(6), 1780\u20131793 (2020). https:\/\/doi.org\/10.1109\/TNNLS.2019.2926466","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-99740-7_25","volume-title":"Machine Learning and Knowledge Extraction","author":"F Mayr","year":"2018","unstructured":"Mayr, F., Yovine, S.: Regular inference on artificial neural networks. 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"},{"key":"10_CR19","unstructured":"Michalenko, J.J., Shah, A., Verma, A., Baraniuk, R.G., Chaudhuri, S., Patel, A.B.: Representing formal languages: A comparison between finite automata and recurrent neural networks. In: ICLR. OpenReview.net (2019)"},{"key":"10_CR20","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Inc., USA (1967)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-88885-5_5","volume-title":"Automated Technology for Verification and Analysis","author":"E Mu\u0161kardin","year":"2021","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"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-031-07727-2_13","volume-title":"Integrated Formal Methods","author":"E Muskardin","year":"2022","unstructured":"Muskardin, E., Aichernig, B.K., Pill, I., Tappler, M.: Learning finite state models from recurrent neural networks. In: ter Beek, M.H., Monahan, R. (eds.) IFM 2022. LNCS, vol. 13274, pp. 229\u2013248. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07727-2_13"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.neucom.2021.04.058","volume":"452","author":"C Oliva","year":"2021","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","journal-title":"Neurocomputing"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0893-6080(95)00086-0","volume":"9","author":"CW Omlin","year":"1996","unstructured":"Omlin, C.W., Giles, C.L.: Extraction of rules from discrete-time recurrent neural networks. Neural Netw. 9(1), 41\u201352 (1996). https:\/\/doi.org\/10.1016\/0893-6080(95)00086-0","journal-title":"Neural Netw."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic Pattern Recognition. Machine Perception and Artificial Intelligence, vol. 5, pp. 99\u2013108. World Scientific (1992)","DOI":"10.1142\/9789812797919_0007"},{"key":"10_CR26","unstructured":"Paszke, A., et al.: PyTorch: An imperative style, high-performance deep learning library. In: NeurIPS, pp. 8024\u20138035. Curran Associates, Inc. (2019)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-030-90870-6_28","volume-title":"Formal Methods","author":"A Pferscher","year":"2021","unstructured":"Pferscher, A., Aichernig, B.K.: Fingerprinting Bluetooth Low Energy devices via active automata learning. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 524\u2013542. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_28"},{"key":"10_CR28","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":"10_CR29","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"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-031-06773-0_26","volume-title":"NASA Formal Methods","author":"M Tappler","year":"2022","unstructured":"Tappler, M., Aichernig, B.K., Lorber, F.: Timed automata learning via SMT solving. In: Deshmukh, J.V., Havelund, K., Perez, I. (eds.) NFM 2022. LNCS, vol. 13260, pp. 489\u2013507. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_26"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Tin\u0306o, P., S\u0306ajda, J.: Learning and extracting initial Mealy automata with a modular neural network model. Neural Comput. 7(4), 822\u2013844 (1995). https:\/\/doi.org\/10.1162\/neco.1995.7.4.822","DOI":"10.1162\/neco.1995.7.4.822"},{"key":"10_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":"10_CR33","unstructured":"Weiss, G., Goldberg, Y., Yahav, E.: Extracting automata from recurrent neural networks using queries and counterexamples. In: ICML. Proceedings of Machine Learning Research, vol. 80, pp. 5244\u20135253. PMLR (2018)"},{"key":"10_CR34","unstructured":"Weiss, G., Goldberg, Y., Yahav, E.: Learning deterministic weighted automata with queries and counterexamples. In: NeurIPS, pp. 8558\u20138569 (2019)"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-030-72016-2_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"DM Yellin","year":"2021","unstructured":"Yellin, D.M., Weiss, G.: Synthesizing context-free grammars from recurrent neural networks. In: Groote, J.F., Larsen, K.G. (eds.) TACAS 2021. LNCS, vol. 12651, pp. 351\u2013369. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_19"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17108-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T17:04:14Z","timestamp":1710867854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17108-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171079","9783031171086"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17108-6_10","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 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2022\/","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":"39","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":"19","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":"9","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":"49% - 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":"2","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)"}}]}}