{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:19:32Z","timestamp":1740097172956,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238197"},{"type":"electronic","value":"9783319238203"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23820-3_25","type":"book-chapter","created":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T10:21:39Z","timestamp":1442658099000},"page":"358-377","source":"Crossref","is-referenced-by-count":4,"title":["LearnLib Tutorial"],"prefix":"10.1007","author":[{"given":"Malte","family":"Isberner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,15]]},"reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16573-3_14","volume-title":"Testing Software and Systems","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., Uijen, J.: Generating models of infinite-state communication protocols using regular inference with abstraction. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 188\u2013204. Springer, Heidelberg (2010)"},{"issue":"2","key":"25_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)","journal-title":"Inf. Comput."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e0, R.: Algorithms for learning finite automata from queries: a unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53\u201372 (1997)","DOI":"10.1007\/978-1-4613-3394-4_2"},{"key":"25_CR4","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)"},{"key":"25_CR5","unstructured":"Bertolino, A., Calabr\u00f2, A., Merten, M., Steffen, B.: Never-stop learning: continuous validation of learned models for evolving systems through monitoring. ERCIM News 2012(88) (2012)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Cho, C.Y., Babi\u0107, D., Shin, R., Song, D.: Inference and analysis of formal models of botnet command and control protocols. In: Proceedings of the CCS 2010, pp. 426\u2013440. ACM, Chicago (2010)","DOI":"10.1145\/1866307.1866355"},{"issue":"3","key":"25_CR7","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."},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Fundamental Approaches to Software Engineering","author":"A Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80\u201395. Springer, Heidelberg (2002)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An \n                      \n                        \n                      \n                      $$n \\log n$$\n                      \n                        \n                          \n                            n\n                            log\n                            n\n                          \n                        \n                      \n                     algorithm for minimizing states in a finite automaton. Technical report, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"25_CR10","series-title":"Addison-Wesley series in computer science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley series in computer science, 2nd edn. Addison-Wesley-Longman, Reading (2001)","edition":"2"},{"key":"25_CR11","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, TU Dortmund University (2012). \n                      http:\/\/dx.doi.org\/2003\/29486"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-662-45234-9_34","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation","author":"F Howar","year":"2014","unstructured":"Howar, F., Isberner, M., Steffen, B.: Tutorial: automata learning in practice. In: Margaria, T., Steffen, B. (eds.) ISoLA 2014, Part I. LNCS, vol. 8802, pp. 499\u2013513. Springer, Heidelberg (2014)"},{"key":"25_CR13","unstructured":"Irfan, M.N.: Analysis and optimization of software model inference algorithms. Ph.D. thesis, Universit\u00e9 de Grenoble, Grenoble, France, September 2012"},{"issue":"1\u20132","key":"25_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1\u20132), 65\u201398 (2014). \n                      http:\/\/dx.doi.org\/10.1007\/s10994-013-5419-7","journal-title":"Mach. Learn."},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"key":"25_CR16","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. LNCS, vol. 9206, pp. 487\u2013495. Springer, Heidelberg (2015)"},{"key":"25_CR17","unstructured":"Isberner, M., Steffen, B.: An abstract framework for counterexample analysis in active automata learning. In: Clark, A., Kanazawa, M., Yoshinaka, R. (eds.) Proceedings of the ICGI 2014. JMLR W&CP, vol. 34, pp. 79\u201393 (2014)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Issarny, V., Steffen, B., Jonsson, B., Blair, G.S., Grace, P., Kwiatkowska, M.Z., Calinescu, R., Inverardi, P., Tivoli, M., Bertolino, A., Sabetta, A.: CONNECT challenges: towards emergent connectors for eternal networked systems. In: ICECCS, pp. 154\u2013161 (2009)","DOI":"10.1109\/ICECCS.2009.44"},{"key":"25_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"issue":"5","key":"25_CR20","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-19835-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Merten","year":"2011","unstructured":"Merten, M., Steffen, B., Howar, F., Margaria, T.: Next generation LearnLib. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 220\u2013223. Springer, Heidelberg (2011)"},{"issue":"4","key":"25_CR22","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":"25_CR23","unstructured":"Niese, O.: An integrated approach to testing complex systems. Ph.D. thesis, University of Dortmund, Germany (2003)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Proceedings of the FORTE 1999, pp. 225\u2013240. Kluwer Academic (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"issue":"4","key":"25_CR25","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10009-009-0120-7","volume":"11","author":"H Raffelt","year":"2009","unstructured":"Raffelt, H., Merten, M., Steffen, B., Margaria, T.: Dynamic testing via automata learning. Int. J. Softw. Tools Technol. Transf. 11(4), 307\u2013324 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"5","key":"25_CR26","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10009-009-0111-8","volume":"11","author":"H Raffelt","year":"2009","unstructured":"Raffelt, H., Steffen, B., Berg, T., Margaria, T.: LearnLib: a framework for extrapolating behavioral models. Int. J. Softw. Tools Technol. Transf. 11(5), 393\u2013407 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"25_CR27","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 futomata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"25_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)"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-21455-4_8","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B Steffen","year":"2011","unstructured":"Steffen, B., Howar, F., Merten, M.: Introduction to active automata learning from a practical perspective. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 256\u2013296. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Runtime Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23820-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:45:24Z","timestamp":1559249124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23820-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238197","9783319238203"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23820-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}