{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:53:18Z","timestamp":1773201198008,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"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":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10009-019-00544-0","type":"journal-article","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T13:03:30Z","timestamp":1573045410000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning Moore machines from input\u2013output traces"],"prefix":"10.1007","volume":"23","author":[{"given":"Georgios","family":"Giantamidis","sequence":"first","affiliation":[]},{"given":"Stavros","family":"Tripakis","sequence":"additional","affiliation":[]},{"given":"Stylianos","family":"Basagiannis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"544_CR1","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"issue":"2","key":"544_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"F Vaandrager","year":"2017","unstructured":"Vaandrager, F.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"544_CR3","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Data-driven and model-based design. In: 1st IEEE International Conference on Industrial Cyber-Physical Systems (ICPS) (2018)","DOI":"10.1109\/ICPHYS.2018.8387644"},{"key":"544_CR4","volume-title":"System Identification: Theory for the User","author":"L Ljung","year":"1999","unstructured":"Ljung, L.: System Identification: Theory for the User, 2nd edn. Prentice Hall, Upper Saddle River (1999)","edition":"2"},{"issue":"5\u20136","key":"544_CR5","doi-asserted-by":"publisher","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"},{"key":"544_CR6","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\/1925844.1926423"},{"key":"544_CR7","doi-asserted-by":"crossref","unstructured":"Seshia, S.A.: Sciduction: combining induction, deduction, and structure for verification and synthesis. In: DAC, pp. 356\u2013365 (2012)","DOI":"10.1145\/2228360.2228425"},{"key":"544_CR8","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\u201914 (2014)","DOI":"10.1145\/2635868.2635922"},{"key":"544_CR9","doi-asserted-by":"crossref","unstructured":"Alur, R., Martin, M., Raghothaman, M., Stergiou, C., Tripakis, S., Udupa, A.: Synthesizing finite-state protocols from scenarios and requirements. In: HVC, Volume 8855 of LNCS. Springer (2014)","DOI":"10.1007\/978-3-319-13338-6_7"},{"issue":"1","key":"544_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/3061640.3061652","volume":"48","author":"R Alur","year":"2017","unstructured":"Alur, R., Tripakis, S.: Automatic synthesis of distributed protocols. SIGACT News 48(1), 55\u201390 (2017)","journal-title":"SIGACT News"},{"key":"544_CR11","volume-title":"Why Programs Fail\u2014A Guide to Systematic Debugging","author":"A Zeller","year":"2009","unstructured":"Zeller, A.: Why Programs Fail\u2014A Guide to Systematic Debugging, 2nd edn. Academic Press, Cambridge (2009)","edition":"2"},{"key":"544_CR12","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":"544_CR13","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. CUP, Cambridge (2010)"},{"issue":"5","key":"544_CR14","doi-asserted-by":"publisher","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"},{"key":"544_CR15","doi-asserted-by":"crossref","unstructured":"Raffelt, H., Steffen, B.: Learnlib: a library for automata learning and experimentation, vol. 3922, pp. 377\u2013380 (2006)","DOI":"10.1007\/11693017_28"},{"key":"544_CR16","doi-asserted-by":"crossref","unstructured":"Verwer, S., Hammerschmidt, C.: flexfringe: a passive automaton learning package, pp. 638\u2013642 (2017)","DOI":"10.1109\/ICSME.2017.58"},{"issue":"5","key":"544_CR17","doi-asserted-by":"publisher","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":"544_CR18","doi-asserted-by":"crossref","unstructured":"Giantamidis, G., Tripakis, S.: Learning Moore machines from input\u2013output traces. In: Fitzgerald, J.S., Heitmeyer, C.L., Gnesi, S., Philippou, A. (eds.) 21st International Symposium on Formal Methods (FM 2016), Volume 9995 of LNCS, pp. 291\u2013309 (2016)","DOI":"10.1007\/978-3-319-48989-6_18"},{"key":"544_CR19","doi-asserted-by":"publisher","unstructured":"Mens, I.-E., Maler, O.: Learning regular languages over large ordered alphabets. Log. Methods Comput. Sci. 11(3) (2015). https:\/\/doi.org\/10.2168\/LMCS-11(3:13)2015","DOI":"10.2168\/LMCS-11(3:13)2015"},{"key":"544_CR20","doi-asserted-by":"crossref","unstructured":"Argyros, G., Stais, I., Kiayias, A., Keromytis, A.D.: Back in black: towards formal, black box analysis of sanitizers and filters. In: IEEE Symposium on Security and Privacy, SP 2016, pp. 91\u2013109 (2016)","DOI":"10.1109\/SP.2016.14"},{"key":"544_CR21","doi-asserted-by":"crossref","unstructured":"Drews, S., D\u2019Antoni, L.: Learning symbolic automata. In: Tools and Algorithms for the Construction and Analysis of Systems\u201423rd International Conference, TACAS 2017, volume 10205 of LNCS, pp. 173\u2013189 (2017)","DOI":"10.1007\/978-3-662-54577-5_10"},{"key":"544_CR22","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.) Grammatical Inference. Springer, Berlin (1998)"},{"issue":"4","key":"544_CR23","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10664-012-9210-3","volume":"18","author":"N Walkinshaw","year":"2013","unstructured":"Walkinshaw, N., Lambeau, B., Damas, C., Bogdanov, K., Dupont, P.: Stamina: a competition to encourage the development and assessment of software model inference techniques. Empir. Softw. Eng. 18(4), 791\u2013824 (2013)","journal-title":"Empir. Softw. Eng."},{"issue":"1","key":"544_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10994-013-5409-9","volume":"96","author":"S Verwer","year":"2014","unstructured":"Verwer, S., Eyraud, R., Higuera, C.: Pautomac: a probabilistic automata and hidden markov models learning competition. Mach. Learn. 96(1), 129\u2013154 (2014)","journal-title":"Mach. Learn."},{"key":"544_CR25","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., Mues, M., Murtovi, A., Schl\u00fcter, M., Howar, F., Steffen, B., Schordan, M., Hendriks, D., Schiffelers, R., Kuppens, H., Vaandrager, F.W.: Rers 2019: combining synthesis with real-world models. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 101\u2013115. Springer International Publishing, Cham (2019)"},{"key":"544_CR26","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies, number\u00a034. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"544_CR27","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/S0019-9958(61)80003-X","volume":"4","author":"A Gill","year":"1961","unstructured":"Gill, A.: State-identification experiments in finite automata. Inf. Control 4, 132\u2013154 (1961)","journal-title":"Inf. Control"},{"issue":"2","key":"544_CR28","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":"544_CR29","doi-asserted-by":"crossref","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: FM 2009, pp. 207\u2013222 (2009)","DOI":"10.1007\/978-3-642-05089-3_14"},{"key":"544_CR30","doi-asserted-by":"crossref","unstructured":"Jonsson, B.: Learning of automata models extended with data. In: SFM 2011, Advanced Lectures, pp. 327\u2013349 (2011)","DOI":"10.1007\/978-3-642-21455-4_10"},{"key":"544_CR31","doi-asserted-by":"crossref","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: SEFM 2014, Proceedings, pp. 250\u2013264 (2014)","DOI":"10.1007\/978-3-319-10431-7_18"},{"key":"544_CR32","doi-asserted-by":"crossref","unstructured":"Aarts, F., Vaandrager, F.: Learning I\/O automata. In: CONCUR. Springer, pp. 71\u201385 (2010)","DOI":"10.1007\/978-3-642-15375-4_6"},{"key":"544_CR33","doi-asserted-by":"crossref","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: VMCAI 2012, Proceedings, pp. 251\u2013266 (2012)","DOI":"10.1007\/978-3-642-27940-9_17"},{"key":"544_CR34","doi-asserted-by":"crossref","unstructured":"Aarts, F., Fiterau-Brostean, P., Kuppens, H., Vaandrager, F.W.: Learning register automata with fresh value generation. In: Theoretical Aspects of Computing\u2014ICTAC, volume 9399 of LNCS, pp. 165\u2013183 (2015)","DOI":"10.1007\/978-3-319-25150-9_11"},{"key":"544_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"},{"issue":"3","key":"544_CR36","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)","journal-title":"Inf. Control"},{"issue":"4","key":"544_CR37","doi-asserted-by":"publisher","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":"544_CR38","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: BFS-based symmetry breaking predicates for DFA identification. In: Language and Automata Theory and Applications (LATA), volume 8977 of LNCS. Springer, pp. 611\u2013622 (2015)","DOI":"10.1007\/978-3-319-15579-1_48"},{"key":"544_CR39","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"},{"key":"544_CR40","doi-asserted-by":"crossref","unstructured":"Dupont, P.: Incremental regular inference. In: ICGI-96, pp. 222\u2013237 (1996)","DOI":"10.1007\/BFb0033357"},{"key":"544_CR41","doi-asserted-by":"crossref","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: ICGI-98, pp. 1\u201312 (1998)","DOI":"10.1007\/BFb0054059"},{"key":"544_CR42","doi-asserted-by":"crossref","unstructured":"Beschastnikh, I., Brun, Y., Ernst, M.D., Krishnamurthy, A.: Inferring models of concurrent systems from logs of their behavior with csight. In: Proceedings of the 36th International Conference on Software Engineering, ICSE 2014. ACM, New York, NY, USA, pp. 468\u2013479 (2014)","DOI":"10.1145\/2568225.2568246"},{"key":"544_CR43","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.) Grammatical Inference: Theoretical Results and Applications, pp. 203\u2013216. Springer, Berlin (2010)"},{"issue":"3","key":"544_CR44","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10664-015-9367-7","volume":"21","author":"N Walkinshaw","year":"2016","unstructured":"Walkinshaw, N., Taylor, R., Derrick, J.: Inferring extended finite state machine models from software executions. Empir. Softw. Eng. 21(3), 811\u2013853 (2016). https:\/\/doi.org\/10.1007\/s10664-015-9367-7","journal-title":"Empir. Softw. Eng."},{"issue":"1","key":"544_CR45","doi-asserted-by":"publisher","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":"3","key":"544_CR46","doi-asserted-by":"publisher","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. Sys. Sc. Int. 52(3), 410\u2013425 (2013)","journal-title":"J. Comput. Sys. Sc. Int."},{"issue":"2","key":"544_CR47","doi-asserted-by":"publisher","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. Sys. Sc. Int. 53(2), 256\u2013266 (2014)","journal-title":"J. Comput. Sys. Sc. Int."},{"key":"544_CR48","doi-asserted-by":"crossref","unstructured":"Meinke, K.: CGE: a sequential learning algorithm for mealy automata. In: Sempere, J.M., Garc\u00eda, P. (eds.) Grammatical Inference: Theoretical Results and Applications, 10th International Colloquium, ICGI 2010, Valencia, Spain, September 13\u201316, 2010. Proceedings, volume 6339 of LNCS. Springer, pp. 148\u2013162 (2010)","DOI":"10.1007\/978-3-642-15488-1_13"},{"issue":"2","key":"544_CR49","doi-asserted-by":"publisher","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."},{"issue":"1","key":"544_CR50","doi-asserted-by":"publisher","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."},{"issue":"6","key":"544_CR51","doi-asserted-by":"publisher","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."},{"key":"544_CR52","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":"544_CR53","doi-asserted-by":"crossref","unstructured":"Grinchtein, O., Leucker, M.: Learning finite-state machines from inexperienced teachers. In: ICGI, pp. 344\u2013345 (2006)","DOI":"10.1007\/11872436_30"},{"key":"544_CR54","doi-asserted-by":"crossref","unstructured":"Leucker, M., Neider, D.: Learning minimal deterministic automata from inexperienced teachers. In: ISoLA, pp. 524\u2013538 (2012)","DOI":"10.1007\/978-3-642-34026-0_39"},{"issue":"2","key":"544_CR55","doi-asserted-by":"publisher","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":"1","key":"544_CR56","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10009-016-0442-1","volume":"20","author":"V Ulyantsev","year":"2018","unstructured":"Ulyantsev, V., Buzhinsky, I., Shalyto, A.: Exact finite-state machine identification from scenarios and temporal properties. STTT 20(1), 35\u201355 (2018)","journal-title":"STTT"},{"key":"544_CR57","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI\u201908. ACM, pp. 281\u2013292 (2008)","DOI":"10.1145\/1379022.1375616"},{"key":"544_CR58","doi-asserted-by":"crossref","unstructured":"Col\u00f3n, M.A., Sankaranarayanan, S., Sipma, H.B.: Linear invariant generation using non-linear constraint solving. In: CAV. Springer, pp. 420\u2013432 (2003)","DOI":"10.1007\/978-3-540-45069-6_39"},{"key":"544_CR59","doi-asserted-by":"crossref","unstructured":"Gupta, A., Rybalchenko, A.: Invgen: an efficient invariant generator. In: Computer Aided Verification, CAV. Springer, pp. 634\u2013640 (2009)","DOI":"10.1007\/978-3-642-02658-4_48"},{"key":"544_CR60","doi-asserted-by":"crossref","unstructured":"Ackermann, C., Cleaveland, R., Huang, S., Ray, A., Shelton, C., Latronico, E.: Automatic requirement extraction from test cases. In: Runtime Verification, RV\u201910 (2010)","DOI":"10.1007\/978-3-642-16612-9_1"},{"issue":"11","key":"544_CR61","doi-asserted-by":"publisher","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":"544_CR62","doi-asserted-by":"crossref","unstructured":"Lemieux, C., Park, D., Beschastnikh, I.: General LTL specification mining. In: Automated Software Engineering (ASE), pp. 81\u201392 (2015)","DOI":"10.1109\/ASE.2015.71"},{"key":"544_CR63","doi-asserted-by":"crossref","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.R.: Mining specifications. In: POPL\u201902. ACM, pp. 4\u201316 (2002)","DOI":"10.1145\/565816.503275"},{"issue":"8","key":"544_CR64","doi-asserted-by":"publisher","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\u2014a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"issue":"3","key":"544_CR65","doi-asserted-by":"publisher","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."},{"issue":"12","key":"544_CR66","doi-asserted-by":"publisher","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":"544_CR67","doi-asserted-by":"crossref","unstructured":"Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: FASE, volume 3442 of LNCS. Springer, pp. 175\u2013189 (2005)","DOI":"10.1007\/978-3-540-31984-9_14"},{"key":"544_CR68","unstructured":"Sorower, M.S.: A literature survey on algorithms for multi-label learning. Technical report (2010)"},{"key":"544_CR69","doi-asserted-by":"crossref","unstructured":"Coste, F., Nicolas, J.: ICGI-98, chapter How considering incompatible state mergings may reduce the DFA induction search tree. Springer, pp. 199\u2013210 (1998)","DOI":"10.1007\/BFb0054076"},{"key":"544_CR70","unstructured":"The D Programming Language. https:\/\/dlang.org\/"},{"key":"544_CR71","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K.: Inferring finite-state models with temporal constraints. In: ASE, pp. 248\u2013257 (2008)","DOI":"10.1109\/ASE.2008.35"},{"key":"544_CR72","doi-asserted-by":"crossref","unstructured":"Tsarev, F., Egorov, K.: Finite state machine induction using genetic algorithm based on testing and model checking. In: 13th Annual Genetic and Evolutionary Computation Conference, GECCO, pp. 759\u2013762 (2011)","DOI":"10.1145\/2001858.2002085"},{"key":"544_CR73","doi-asserted-by":"crossref","unstructured":"Lo, D., Khoo, S.-C.: Smartic: towards building an accurate, robust and scalable specification miner. In: FSE. ACM, New York, NY, USA, pp. 265\u2013275 (2006)","DOI":"10.1145\/1181775.1181808"},{"key":"544_CR74","doi-asserted-by":"crossref","unstructured":"Akram, H.I., de\u00a0la Higuera, C., Xiao, H., Eckert, C.: Grammatical inference algorithms in matlab. In: ICGI\u201910. Springer, pp. 262\u2013266 (2010)","DOI":"10.1007\/978-3-642-15488-1_22"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-019-00544-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-019-00544-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-019-00544-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,22]],"date-time":"2021-01-22T08:15:09Z","timestamp":1611303309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-019-00544-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["544"],"URL":"https:\/\/doi.org\/10.1007\/s10009-019-00544-0","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"6 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}