{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:45:40Z","timestamp":1762101940725,"version":"3.41.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319489889"},{"type":"electronic","value":"9783319489896"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48989-6_18","type":"book-chapter","created":{"date-parts":[[2016,11,7]],"date-time":"2016-11-07T06:31:19Z","timestamp":1478500279000},"page":"291-309","source":"Crossref","is-referenced-by-count":20,"title":["Learning Moore Machines from Input-Output Traces"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Giantamidis","sequence":"first","affiliation":[]},{"given":"Stavros","family":"Tripakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,8]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-25150-9_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2015","author":"F Aarts","year":"2015","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.: Learning register automata with fresh value generation. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) ICTAC 2015. LNCS, vol. 9399, pp. 165\u2013183. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25150-9_11"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010 - Concurrency Theory","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Vaandrager, F.: Learning I\/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71\u201385. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15375-4_6"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-15488-1_22","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"HI Akram","year":"2010","unstructured":"Akram, H.I., Higuera, C., Xiao, H., Eckert, C.: Grammatical inference algorithms in MATLAB. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 262\u2013266. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15488-1_22"},{"issue":"3","key":"18_CR4","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1134\/S1064230713020020","volume":"52","author":"AV Aleksandrov","year":"2013","unstructured":"Aleksandrov, A.V., Kazakov, S.V., Sergushichev, A.A., Tsarev, F.N., Shalyto, A.A.: The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior. J. Comput. Syst. Sci. Int. 52(3), 410\u2013425 (2013)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-13338-6_7","volume-title":"Hardware and Software: Verification and Testing","author":"R Alur","year":"2014","unstructured":"Alur, R., Martin, M., Raghothaman, M., Stergiou, C., Tripakis, S., Udupa, A.: Synthesizing finite-state protocols from scenarios and requirements. In: Yahav, E. (ed.) HVC 2014. LNCS, vol. 8855, pp. 75\u201391. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-13338-6_7"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.R.: Mining specifications. In: POPL 2002, pp. 4\u201316. ACM (2002)","DOI":"10.1145\/503272.503275"},{"issue":"2","key":"18_CR7","doi-asserted-by":"crossref","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":"18_CR8","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). doi: 10.1007\/978-3-540-31984-9_14"},{"issue":"6","key":"18_CR9","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"AW Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. 21(6), 592\u2013597 (1972)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"18_CR10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1134\/S106423071402004X","volume":"53","author":"IP Buzhinsky","year":"2014","unstructured":"Buzhinsky, I.P., Ulyantsev, V.I., Chivilikhin, D.S., Shalyto, A.A.: Inducing finite state machines from training samples using ant colony optimization. J. Comput. Syst. Sci. Int. 53(2), 256\u2013266 (2014)","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-10431-7_18","volume-title":"Software Engineering and Formal Methods","author":"S Cassel","year":"2014","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 250\u2013264. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-10431-7_18"},{"issue":"3","key":"18_CR12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"TS Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178\u2013187 (1978)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-45069-6_39","volume-title":"Computer Aided Verification","author":"MA Col\u00f3n","year":"2003","unstructured":"Col\u00f3n, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear invariant generation using non-linear constraint solving. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 420\u2013432. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45069-6_39"},{"key":"18_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C Higuera de la","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. CUP, Cambridge (2010)"},{"issue":"12","key":"18_CR15","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1016\/j.infsof.2010.07.001","volume":"52","author":"R Dorofeeva","year":"2010","unstructured":"Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A.R., Yevtushenko, N.: FSM-based conformance testing methods: a survey annotated with experimental evaluation. Inf. Softw. Technol. 52(12), 1286\u20131297 (2010)","journal-title":"Inf. Softw. Technol."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BFb0033357","volume-title":"Grammatical Interference: Learning Syntax from Sentences","author":"P Dupont","year":"1996","unstructured":"Dupont, P.: Incremental regular inference. In: Miclet, L., Higuera, C. (eds.) ICGI 1996. LNCS, vol. 1147, pp. 222\u2013237. Springer, Heidelberg (1996). doi: 10.1007\/BFb0033357"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Giantamidis, G., Tripakis, S.: Learning Moore machines from input-output traces. ArXiv e-prints, v2, September 2016. http:\/\/arxiv.org\/abs\/1605.07805","DOI":"10.1007\/978-3-319-48989-6_18"},{"issue":"5","key":"18_CR18","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"issue":"3","key":"18_CR19","doi-asserted-by":"crossref","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)","journal-title":"Inf. Control"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11872436_30","volume-title":"Grammatical Inference: Algorithms and Applications","author":"O Grinchtein","year":"2006","unstructured":"Grinchtein, O., Leucker, M.: Learning finite-state machines from inexperienced teachers. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 344\u2013345. Springer, Heidelberg (2006). doi: 10.1007\/11872436_30"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Gulwani, S.: Automating string processing in spreadsheets using input-output examples. In: 38th POPL, pp. 317\u2013330 (2011)","DOI":"10.1145\/1926385.1926423"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI 2008, pp. 281\u2013292. ACM (2008)","DOI":"10.1145\/1375581.1375616"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-642-02658-4_48","volume-title":"Computer Aided Verification","author":"A Gupta","year":"2009","unstructured":"Gupta, A., Rybalchenko, A.: InvGen: an efficient invariant generator. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 634\u2013640. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02658-4_48"},{"issue":"2","key":"18_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10515-014-0157-z","volume":"22","author":"CL Heitmeyer","year":"2015","unstructured":"Heitmeyer, C.L., Pickett, M., Leonard, E.I., Archer, M.M., Ray, I., Aha, D.W., Trafton, J.G.: Building high assurance human-centric decision systems. Autom. Softw. Eng. 22(2), 159\u2013197 (2015)","journal-title":"Autom. Softw. Eng."},{"issue":"4","key":"18_CR25","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1007\/s10664-012-9222-z","volume":"18","author":"MJ Heule","year":"2013","unstructured":"Heule, M.J., Verwer, S.: Software model synthesis using satisfiability solvers. Empir. Softw. Eng. 18(4), 825\u2013856 (2013)","journal-title":"Empir. Softw. Eng."},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251\u2013266. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-27940-9_17"},{"issue":"11","key":"18_CR27","doi-asserted-by":"crossref","first-page":"1704","DOI":"10.1109\/TCAD.2015.2421907","volume":"34","author":"X Jin","year":"2015","unstructured":"Jin, X., Donz, A., Deshmukh, J.V., Seshia, S.A.: Mining requirements from closed-loop control models. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(11), 1704\u20131717 (2015)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-21455-4_10","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B Jonsson","year":"2011","unstructured":"Jonsson, B.: Learning of automata models extended with data. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 327\u2013349. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21455-4_10"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Karthik, A.V., Ray, S., Nuzzo, P., Mishchenko, A., Brayton, R., Roychowdhury, J.: ABCD-NL: approximating continuous non-linear dynamical systems using purely Boolean models for analog\/mixed-signal verification. In: ASP-DAC, pp. 250\u2013255 (2014)","DOI":"10.1109\/ASPDAC.2014.6742898"},{"key":"18_CR30","volume-title":"Switching and Finite Automata Theory","author":"Z Kohavi","year":"1978","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory, 2nd edn. McGraw-Hill, New York (1978)","edition":"2"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"KJ Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 1\u201312. Springer, Heidelberg (1998). doi: 10.1007\/BFb0054059"},{"issue":"8","key":"18_CR32","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Lemieux, C., Park, D., Beschastnikh, I.: General LTL specification mining. In: Automated Software Engineering (ASE), pp. 81\u201392, November 2015","DOI":"10.1109\/ASE.2015.71"},{"key":"18_CR34","volume-title":"System Identification: Theory for the User","year":"1999","unstructured":"Ljung, L. (ed.): System Identification: Theory for the User, 2nd edn. Prentice Hall, Englewood Cliffs (1999)","edition":"2"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Medhat, R., Ramesh, S., Bonakdarpour, B., Fischmeister, S.: A framework for mining hybrid automata from input\/output traces. In: Embedded Software (EMSOFT), pp. 177\u2013186 (2015)","DOI":"10.1109\/EMSOFT.2015.7318273"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15488-1_13","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"K Meinke","year":"2010","unstructured":"Meinke, K.: CGE: a sequential learning algorithm for Mealy automata. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 148\u2013162. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15488-1_13"},{"key":"18_CR37","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Identifying regular languages in polynomial time. In: Advances in Structural and Syntactic, Pattern Recognition, pp. 99\u2013108 (1992)","DOI":"10.1142\/9789812797919_0007"},{"issue":"5","key":"18_CR39","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/34.211465","volume":"15","author":"J Oncina","year":"1993","unstructured":"Oncina, J., Garc\u00eda, P., Vidal, E.: Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 448\u2013458 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Ray, B., Posnett, D., Filkov, V., Devanbu, P.: A large scale study of programming languages and code quality in github. In: ACM SIGSOFT, FSE 2014 (2014)","DOI":"10.1145\/2635868.2635922"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Seshia, S.A.: Sciduction: combining induction, deduction, and structure for verification and synthesis. In: DAC, pp. 356\u2013365, June 2012","DOI":"10.1145\/2228360.2228425"},{"key":"18_CR42","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). doi: 10.1007\/978-3-642-05089-3_14"},{"issue":"5\u20136","key":"18_CR43","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10009-012-0249-7","volume":"15","author":"A Solar-Lezama","year":"2013","unstructured":"Solar-Lezama, A.: Program sketching. STTT 15(5\u20136), 475\u2013495 (2013)","journal-title":"STTT"},{"issue":"1","key":"18_CR44","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3176\/proc.2013.1.05","volume":"62","author":"M Spichakova","year":"2013","unstructured":"Spichakova, M.: An approach to inference of finite state machines based on gravitationally-inspired search algorithm. Proc. Estonian Acad. Sci. 62(1), 39\u201346 (2013)","journal-title":"Proc. Estonian Acad. Sci."},{"issue":"1","key":"18_CR45","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/scj.1184","volume":"34","author":"K Takahashi","year":"2003","unstructured":"Takahashi, K., Fujiyoshi, A., Kasai, T.: A polynomial time algorithm to infer sequential machines. Syst. Comput. Jpn. 34(1), 59\u201367 (2003)","journal-title":"Syst. Comput. Jpn."},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Buzhinsky, I., Shalyto, A.: Exact finite-state machine identification from scenarios and temporal properties. CoRR, abs\/1601.06945 (2016)","DOI":"10.1007\/s10009-016-0442-1"},{"key":"18_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-319-15579-1_48","volume-title":"Language and Automata Theory and Applications","author":"V Ulyantsev","year":"2015","unstructured":"Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: BFS-based symmetry breaking predicates for DFA identification. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 611\u2013622. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-15579-1_48"},{"issue":"2","key":"18_CR48","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TC.1978.1675053","volume":"27","author":"LPJ Veelenturf","year":"1978","unstructured":"Veelenturf, L.P.J.: Inference of sequential machines from sample computations. IEEE Trans. Comput. 27(2), 167\u2013170 (1978)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","FM 2016: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48989-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T01:27:09Z","timestamp":1749691629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48989-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319489889","9783319489896"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48989-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}