{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T18:19:26Z","timestamp":1784830766833,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642214547","type":"print"},{"value":"9783642214554","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21455-4_8","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T10:00:01Z","timestamp":1307700001000},"page":"256-296","source":"Crossref","is-referenced-by-count":110,"title":["Introduction to Active Automata Learning from a Practical Perspective"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maik","family":"Merten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_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.\u00a06435, pp. 188\u2013204. Springer, Heidelberg (2010)"},{"key":"8_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.\u00a06269, pp. 71\u201385. Springer, Heidelberg (2010)"},{"issue":"2","key":"8_CR3","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. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"8_CR4","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":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-16561-0_23","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"A. Bennaceur","year":"2010","unstructured":"Bennaceur, A., Blair, G.S., Chauvel, F., Georgantas, N., Grace, P., Howar, F., Inverardi, P., Issarny, V., Paolucci, M., Pathak, A., Spalazzese, R., Steffen, B., Souville, B.: Towards an Architecture for Runtime Interoperability. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06416, pp. 206\u2013220. Springer, Heidelberg (2010)"},{"key":"8_CR6","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.\u00a03442, pp. 175\u2013189. Springer, Heidelberg (2005)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11693017_10","volume-title":"Fundamental Approaches to Software Engineering","author":"T. Berg","year":"2006","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol.\u00a03922, pp. 107\u2013121. Springer, Heidelberg (2006)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-78743-3_24","volume-title":"Fundamental Approaches to Software Engineering","author":"T. Berg","year":"2008","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol.\u00a04961, pp. 317\u2013331. Springer, Heidelberg (2008)"},{"key":"8_CR9","series-title":"Formal Methods for Eternal Networked Software Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21455-4_11","volume-title":"Dependability and Performance Assessment of Dynamic CONNECTed Systems","author":"A. Bertolino","year":"2011","unstructured":"Bertolino, A., Calabro, A., Di Giandomenico, F., Nostro, N.: Dependability and Performance Assessment of Dynamic CONNECTed Systems. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR10","volume-title":"Interoperability in Complex Distributed Systems. Formal Methods for Eternal Networked Software Systems","author":"G.S. Blair","year":"2011","unstructured":"Blair, G.S., Paolucci, M., Grace, P., Georgantas, N.: Interoperability in Complex Distributed Systems. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Bohlin, T., Jonsson, B.: Regular Inference for Communication Protocol Entities. Technical report, Department of Information Technology, Uppsala University, Schweden (2009)","DOI":"10.1007\/978-3-642-16558-0_53"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-540-71209-1_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B. Bollig","year":"2007","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: Synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 435\u2013450. Springer, Heidelberg (2007)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-85361-9_15","volume-title":"CONCUR 2008 - Concurrency Theory","author":"B. Bollig","year":"2008","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: smyle: A tool for synthesizing distributed models from scenarios by learning. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 162\u2013166. Springer, Heidelberg (2008)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b137241","volume-title":"Model-Based Testing of Reactive Systems","author":"M. Broy","year":"2005","unstructured":"Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A.: Model-Based Testing of Reactive Systems. LNCS, vol.\u00a03472. Springer, Heidelberg (2005)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T.S. Chow","year":"1978","unstructured":"Chow, T.S.: Testing Software Design Modeled by Finite-State Machines. IEEE Trans. on Software Engineering\u00a04(3), 178\u2013187 (1978)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., P\u0103s\u0103reanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14684-8_15","volume-title":"Finite-State Methods and Natural Language Processing","author":"D. Combe","year":"2010","unstructured":"Combe, D., de la Higuera, C., Janodet, J.-C.: Zulu: an Interactive Learning Competition. In: Yli-Jyr\u00e4, A., Kornai, A., Sakarovitch, J., Watson, B. (eds.) FSMNLP 2009. LNCS, vol.\u00a06062, Springer, Heidelberg (2010)"},{"key":"8_CR18","doi-asserted-by":"publisher","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. Cambridge University Press, New York (2010)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-13675-7_13","volume-title":"Applications and Theory of Petri Nets","author":"J. Esparza","year":"2010","unstructured":"Esparza, J., Leucker, M., Schlund, M.: Learning Workflow Petri Nets. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 206\u2013225. Springer, Heidelberg (2010)"},{"issue":"6","key":"8_CR20","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/32.87284","volume":"17","author":"S. Fujiwara","year":"1991","unstructured":"Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test Selection Based on Finite State Models. IEEE Trans. on Software Engineering\u00a017(6), 591\u2013603 (1991)","journal-title":"IEEE Trans. on Software Engineering"},{"key":"8_CR21","series-title":"Formal Methods for Eternal Networked Software Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21455-4_2","volume-title":"The CONNECT Architecture","author":"P. Grace","year":"2011","unstructured":"Grace, P., Georgantas, N., Bennaceur, A., Blair, G., Chauvel, F., Issarny, V., Paolucci, M., Saadi, R., Souville, B., Sykes, D.: The CONNECT Architecture. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/11817949_29","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"O. Grinchtein","year":"2006","unstructured":"Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 435\u2013449. Springer, Heidelberg (2006)"},{"key":"8_CR23","series-title":"LNCS","first-page":"80","volume-title":"Model generation by moderated regular extrapolation","author":"A. Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. LNCS, pp. 80\u201395. Springer, Heidelberg (2002)"},{"key":"8_CR24","first-page":"1033","volume":"55","author":"A. Hagerer","year":"2001","unstructured":"Hagerer, A., Margaria, T., Niese, O., Steffen, B., Brune, G., Ide, H.-D.: Efficient regression testing of CTI-systems: Testing a complex call-center solution. Annual Review of Communication, Int. Engineering Consortium (IEC)\u00a055, 1033\u20131040 (2001)","journal-title":"Annual Review of Communication, Int. Engineering Consortium (IEC)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log 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":"8_CR26","series-title":"Addison-Wesley series in computer science","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley series in computer science. Addison-Wesley-Longman, Amsterdam (2001)","edition":"2"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16561-0_24","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Howar","year":"2010","unstructured":"Howar, F., Jonsson, B., Merten, M., Steffen, B., Cassel, S.: On Handling Data in Automata Learning. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06416, pp. 221\u2013235. Springer, Heidelberg (2010)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F. Howar","year":"2010","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS - Lessons Learned in the ZULU Challenge. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol.\u00a06415, pp. 687\u2013704. Springer, Heidelberg (2010)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F. Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata learning with automated alphabet abstraction refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 263\u2013277. Springer, Heidelberg (2011)"},{"key":"8_CR30","series-title":"FMICS Handbook on Industrial Critical Systems","volume-title":"Practical Aspects of Active Learning","author":"F. Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M., Margaria, T.: Practical Aspects of Active Learning. FMICS Handbook on Industrial Critical Systems. Wiley, Chichester (to appear, 2011)"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Computer Aided Verification","author":"H. Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 315\u2013327. Springer, Heidelberg (2003)"},{"issue":"1","key":"8_CR32","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s10009-004-0139-8","volume":"6","author":"H. Hungar","year":"2004","unstructured":"Hungar, H., Steffen, B.: Behavior-based model construction. Int. J. Softw. Tools Technol. Transf.\u00a06(1), 4\u201314 (2004)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"8_CR33","series-title":"Formal Methods for Eternal Networked Software Systems","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21455-4_5","volume-title":"Application-layer Connector Synthesis","author":"P. Inverardi","year":"2011","unstructured":"Inverardi, P., Spalazzese, R., Tivoli, M.: Application-layer Connector Synthesis. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR34","series-title":"Formal Methods for Eternal Networked Software Systems","volume-title":"Middleware-layer Connector Synthesis","author":"V. Issarny","year":"2011","unstructured":"Issarny, V., Bennaceur, A., Bromberg, Y.-D.: Middleware-layer Connector Synthesis. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR35","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":"8_CR36","series-title":"Formal Methods for Eternal Networked Software Systems","volume-title":"Machine Learning and Data","author":"B. Jonsson","year":"2011","unstructured":"Jonsson, B.: Machine Learning and Data. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Jung, G., Margaria, T., Wagner, C., Bakera, M.: Formalizing a Methodology for Design- and Runtime Self-Healing. In: IEEE International Workshop on Engineering of Autonomic and Autonomous Systems, pp. 106\u2013115 (2010)","DOI":"10.1109\/EASe.2010.21"},{"key":"8_CR38","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-12002-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Kwiatkowska","year":"2010","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Assume-Guarantee Verification for Probabilistic Systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 23\u201337. Springer, Heidelberg (2010)"},{"issue":"2","key":"8_CR40","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O. Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the Learnability of Infinitary Regular Sets. Information and Computation\u00a0118(2), 316\u2013326 (1995)","journal-title":"Information and Computation"},{"key":"8_CR41","first-page":"95","volume-title":"HLDVT 2004: Proceedings of the Ninth IEEE International High-Level Design Validation and Test Workshop","author":"T. Margaria","year":"2004","unstructured":"Margaria, T., Niese, O., Raffelt, H., Steffen, B.: Efficient test-based model generation for legacy reactive systems. In: HLDVT 2004: Proceedings of the Ninth IEEE International High-Level Design Validation and Test Workshop, pp. 95\u2013100. IEEE Computer Society, Washington, DC (2004)"},{"issue":"2","key":"8_CR42","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s11334-005-0016-y","volume":"1","author":"T. Margaria","year":"2005","unstructured":"Margaria, T., Raffelt, H., Steffen, B.: Knowledge-based relevance filtering for efficient system-level test-based model generation. Innovations in Systems and Software Engineering\u00a01(2), 147\u2013156 (2005)","journal-title":"Innovations in Systems and Software Engineering"},{"key":"8_CR43","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.\u00a06605, pp. 220\u2013223. Springer, Heidelberg (2011)"},{"issue":"4","key":"8_CR44","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. Proceedings of the American Mathematical Society\u00a09(4), 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"8_CR45","unstructured":"Niese, O.: An Integrated Approach to Testing Complex Systems. PhD thesis, University of Dortmund, Germany (2003)"},{"issue":"3","key":"8_CR46","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10703-008-0049-6","volume":"32","author":"C.S. Pasareanu","year":"2008","unstructured":"Pasareanu, C.S., Giannakopoulou, D., Bobaru, M.G., Cobleigh, J.M., Barringer, H.: Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design\u00a032(3), 175\u2013205 (2008)","journal-title":"Formal Methods in System Design"},{"key":"8_CR47","first-page":"225","volume-title":"Proc. FORTE 1999","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black Box Checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Proc. FORTE 1999, pp. 225\u2013240. Kluwer Academic, Dordrecht (1999)"},{"key":"8_CR48","first-page":"1","volume-title":"TAV-WEB 2008: Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications","author":"H. Raffelt","year":"2008","unstructured":"Raffelt, H., Margaria, T., Steffen, B., Merten, M.: Hybrid test of web applications with webtest. In: TAV-WEB 2008: Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications, pp. 1\u20137. ACM, New York (2008)"},{"issue":"4","key":"8_CR49","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.\u00a011(4), 307\u2013324 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"5","key":"8_CR50","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.\u00a011(5), 393\u2013407 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"8_CR51","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Inf. Comput.\u00a0103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"8_CR52","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.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009)"},{"key":"8_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-73066-8_22","volume-title":"Testing of Software and Communicating Systems","author":"M. Shahbaz","year":"2007","unstructured":"Shahbaz, M., Li, K., Groz, R.: Learning and Integration of Parameterized Components Through Testing. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom\/FATES 2007. LNCS, vol.\u00a04581, pp. 319\u2013334. Springer, Heidelberg (2007)"},{"key":"8_CR54","first-page":"755","volume-title":"Proc. 31st Annual Int. Computer Software and Applications Conf.","author":"M. Shahbaz","year":"2007","unstructured":"Shahbaz, M., Li, K., Groz, R.: Learning Parameterized State Machine Model for Integration Testing. In: Proc. 31st Annual Int. Computer Software and Applications Conf., vol.\u00a02, pp. 755\u2013760. IEEE Computer Society, Washington, DC (2007)"},{"key":"8_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-70889-6_7","volume-title":"Hardware and Software, Verification and Testing","author":"B. Steffen","year":"2007","unstructured":"Steffen, B., Margaria, T., Nagel, R., J\u00f6rges, S., Kubczak, C.: Model-driven development with the jABC. In: Bin, E., Ziv, A., Ur, S. (eds.) HVC 2006. LNCS, vol.\u00a04383, pp. 92\u2013108. Springer, Heidelberg (2007)"},{"key":"8_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78917-8_1","volume-title":"Formal Methods and Testing","author":"J. Tretmans","year":"2008","unstructured":"Tretmans, J.: Model Based Testing with Labelled Transition Systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST 2008. LNCS, vol.\u00a04949, pp. 1\u201338. Springer, Heidelberg (2008)"},{"key":"8_CR57","series-title":"Formal Methods for Eternal Networked Software Systems","volume-title":"Testing Supported by Learning","author":"J. Tretmans","year":"2011","unstructured":"Tretmans, J.: Testing Supported by Learning. Formal Methods for Eternal Networked Software Systems. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Eternal Networked Software Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21455-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:25:02Z","timestamp":1560255902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21455-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214547","9783642214554"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}