{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T11:39:32Z","timestamp":1791459572228,"version":"4.3.4"},"publisher-location":"Cham","reference-count":71,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030223472","type":"print"},{"value":"9783030223489","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22348-9_23","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T13:04:54Z","timestamp":1561467894000},"page":"390-416","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Benchmarks for Automata Learning and Conformance Testing"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Neider","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rick","family":"Smetsers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harco","family":"Kuppens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"23_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, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25150-9_11"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-662-45234-9_15","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"F Aarts","year":"2014","unstructured":"Aarts, F., Howar, F., Kuppens, H., Vaandrager, F.: Algorithms for inferring register automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2014. LNCS, vol. 8802, pp. 202\u2013219. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-45234-9_15"},{"key":"23_CR4","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16573-3_14"},{"issue":"1\u20132","key":"23_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10994-013-5405-0","volume":"96","author":"F Aarts","year":"2014","unstructured":"Aarts, F., Kuppens, H., Tretmans, G.J., Vaandrager, F.W., Verwer, S.: Improving active Mealy machine learning for protocol conformance testing. Mach. Learn. 96(1\u20132), 189\u2013224 (2014)","journal-title":"Mach. Learn."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Aarts, F., de Ruiter, J., Poll, E.: Formal models of bank cards for free. In: IEEE International Conference on Software Testing Verification and Validation Workshop, Los Alamitos, CA, USA, pp. 461\u2013468. IEEE Computer Society (2013)","DOI":"10.1109\/ICSTW.2013.60"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., Vaandrager, F.: Inference and abstraction of the biometric passport. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 673\u2013686. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16558-0_54"},{"issue":"2","key":"23_CR8","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":"23_CR9","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). \n                      https:\/\/doi.org\/10.1007\/978-3-540-31984-9_14"},{"key":"23_CR10","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Boutilier, C. (ed.) Proceedings of IJCAI 2009, pp. 1004\u20131009 (2009)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14295-6_32","volume-title":"Computer Aided Verification","author":"B Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.-P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: The automata learning framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 360\u2013364. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-14295-6_32"},{"key":"23_CR12","unstructured":"Brglez, F.: ACM\/SIGDA benchmark dataset (1996). \n                      http:\/\/people.engr.ncsu.edu\/brglez\/CBL\/benchmarks\/Benchmarks-upto-1996.html\n                      \n                    . Accessed 14 Aug 2018"},{"key":"23_CR13","unstructured":"BSI: Advanced security mechanisms for machine readable travel documents - extended access control (EAC) - version 1.11. Technical report TR-03110, German Federal Office for Information Security (BSI), Bonn, Germany (2008)"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jlamp.2014.07.004","volume":"84","author":"S Cassel","year":"2015","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. J. Log. Algebr. Meth. Program. 84(1), 54\u201366 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00165-016-0355-5","volume":"28","author":"S Cassel","year":"2016","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Asp. Comput. 28(2), 233\u2013263 (2016)","journal-title":"Formal Asp. Comput."},{"key":"23_CR16","unstructured":"Chalupar, G., Peherstorfer, S., Poll, E., de Ruiter, J.: Automated reverse engineering using Lego. In: Proceedings WOOT 2014, Los Alamitos, CA, USA. IEEE Computer Society, August 2014"},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.tcs.2004.03.072","volume":"330","author":"J-M Champarnaud","year":"2005","unstructured":"Champarnaud, J.-M., Parantho\u00ebn, T.: Random generation of DFAs. Theor. Comput. Sci. 330(2), 221\u2013235 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02382-2","volume-title":"Logic and Structure","author":"D Dalen van","year":"1983","unstructured":"van Dalen, D.: Logic and Structure. Springer, London (1983)"},{"key":"23_CR19","unstructured":"D\u2019Antoni, L.: AutomatArk. \n                      https:\/\/github.com\/lorisdanto\/automatark\n                      \n                    . Accessed 14 Aug 2018"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/BFb0035403","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PR D\u2019Argenio","year":"1997","unstructured":"D\u2019Argenio, P.R., Katoen, J.-P., Ruys, T.C., Tretmans, J.: The bounded retransmission protocol must be on time!. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 416\u2013431. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/BFb0035403"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings ESEC\/FSE-01, Software Engineering Notes, vol. 26, pp. 109\u2013120. ACM Press, New York, September 2001","DOI":"10.1145\/503271.503226"},{"key":"23_CR22","unstructured":"Heidarian Dehkordi, F.: Studies on verification of wireless sensor networks and abstraction learning for system inference. Ph.D. thesis, Radboud University Nijmegen, July 2012"},{"issue":"12","key":"23_CR23","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":"23_CR24","unstructured":"Fiser, P.: Collection of digital design benchmarks. \n                      https:\/\/ddd.fit.cvut.cz\/prj\/Benchmarks\/\n                      \n                    . Accessed 14 Aug 2018"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-67113-0_12","volume-title":"Critical Systems: Formal Methods and Automated Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2017","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Howar, F.: Learning-based testing the sliding window behavior of TCP implementations. In: Petrucci, L., Seceleanu, C., Cavalcanti, A. (eds.) FMICS\/AVoCS -2017. LNCS, vol. 10471, pp. 185\u2013200. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-67113-0_12"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Lenaerts, T., Poll, E., de Ruiter, J., Vaandrager, F., Verleg, P.: Model learning and model checking of SSH implementations. In: Proceedings SPIN Symposium, SPIN 2017, pp. 142\u2013151. ACM, New York (2017)","DOI":"10.1145\/3092282.3092289"},{"issue":"11","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"ER Gansner","year":"2000","unstructured":"Gansner, E.R., North, S.C.: An open graph visualization system and its applications to software engineering. Softw. Pract. Exper. 30(11), 1203\u20131233 (2000)","journal-title":"Softw. Pract. Exper."},{"issue":"5","key":"23_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0019-9958(67)91186-2","volume":"10","author":"F Harary","year":"1967","unstructured":"Harary, F., Palmer, E.M.: Enumeration of finite automata. Inf. Control. 10(5), 499\u2013508 (1967)","journal-title":"Inf. Control."},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-58085-9_75","volume-title":"Types for Proofs and Programs","author":"L Helmink","year":"1994","unstructured":"Helmink, L., Sellink, M.P.A., Vaandrager, F.W.: Proof-checking a data link protocol. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 127\u2013165. Springer, Heidelberg (1994). \n                      https:\/\/doi.org\/10.1007\/3-540-58085-9_75"},{"issue":"11","key":"23_CR31","doi-asserted-by":"publisher","first-page":"3089","DOI":"10.1093\/comjnl\/bxv041","volume":"58","author":"RM Hierons","year":"2015","unstructured":"Hierons, R.M., T\u00fcrker, U.C.: Incomplete distinguishing sequences for finite state machines. Comput. J. 58(11), 3089\u20133113 (2015)","journal-title":"Comput. J."},{"key":"23_CR32","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"23_CR33","unstructured":"Howar, F.: Active learning of interface programs. Ph.D. thesis, University of Dortmund, June 2012"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-34026-0_41","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change","author":"F Howar","year":"2012","unstructured":"Howar, F., Isberner, M., Steffen, B., Bauer, O., Jonsson, B.: Inferring semantic interfaces of data structures. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7609, pp. 554\u2013571. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34026-0_41"},{"key":"23_CR35","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). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96562-8_5"},{"key":"23_CR36","unstructured":"ICAO: Doc 9303 - machine readable travel documents - part 1\u20132. Technical report, International Civil Aviation Organization, Sixth edition (2006)"},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Jasper, M., et al.: The RERS 2017 challenge and workshop (invited paper). In: Proceedings SPIN Symposium, pp. 11\u201320. ACM (2017)","DOI":"10.1145\/3092282.3098206"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Jonsson, B.: Modular verification of asynchronous networks. In: PODC 1987 [54], pp. 152\u2013166","DOI":"10.1145\/41840.41853"},{"key":"23_CR40","doi-asserted-by":"publisher","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":"7","key":"23_CR41","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"23_CR42","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). \n                      https:\/\/doi.org\/10.1007\/BFb0054059"},{"issue":"3","key":"23_CR43","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1109\/12.272431","volume":"43","author":"D Lee","year":"1994","unstructured":"Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306\u2013320 (1994)","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"23_CR44","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 \u2014 a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"issue":"1","key":"23_CR45","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"Jure Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graph evolution: densification and shrinking diameters. TKDD 1(1), 1\u201341 (2007). \n                      https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"23_CR46","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Fransisco (1996)"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: PODC 1987 [54], pp. 137\u2013151. A full version is available as MIT Technical Report MIT\/LCS\/TR-387","DOI":"10.1145\/41840.41852"},{"issue":"5","key":"23_CR48","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":"23_CR49","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19835-9_18"},{"issue":"1","key":"23_CR50","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/3093333.3009879","volume":"52","author":"Joshua Moerman","year":"2017","unstructured":"Moerman, J., Sammartino, M., Silva, A., Klin, B., Szynwelski, M.: Learning nominal automata. In: Proceedings POPL 2017, pp. 613\u2013625. ACM (2017)","journal-title":"ACM SIGPLAN Notices"},{"key":"23_CR51","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies. Annals of Mathematics Studies, vol. 34, pp. 129\u2013153. Princeton University Press (1956)","DOI":"10.1515\/9781400882618-006"},{"issue":"4","key":"23_CR52","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/90.649519","volume":"5","author":"K Naik","year":"1997","unstructured":"Naik, K.: Efficient computation of unique input\/output sequences in finite-state machines. IEEE\/ACM Trans. Netw. 5(4), 585\u2013599 (1997)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"23_CR53","unstructured":"Nicaud, C.: \u00c9tude du comportement en moyenne des automates finis et des langages rationnels. Ph.D. thesis, Universit\u00e9 Paris 7 (2000)"},{"key":"23_CR54","unstructured":"Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, August 1987"},{"key":"23_CR55","doi-asserted-by":"crossref","unstructured":"Raffelt, H., Steffen, B., Berg, T.: LearnLib: a library for automata learning and experimentation. In: Proceedings FMICS 2005, pp. 62\u201371. ACM Press, New York (2005)","DOI":"10.1145\/1081180.1081189"},{"issue":"5","key":"23_CR56","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. STTT 11(5), 393\u2013407 (2009)","journal-title":"STTT"},{"issue":"2","key":"23_CR57","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 automata using homing sequences. Inf. Comput. 103(2), 299\u2013347 (1993)","journal-title":"Inf. Comput."},{"key":"23_CR58","unstructured":"de Ruiter, J., Poll, E.: Protocol state fuzzing of TLS implementations. In: Proceedings USENIX Security 15, pp. 193\u2013206. USENIX Association, August 2015"},{"key":"23_CR59","unstructured":"Schuts, M.: Industrial experiences in applying domain specific languages for system evolution. Ph.D. thesis, Radboud University Nijmegen, September 2017"},{"key":"23_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-33693-0_20","volume-title":"Integrated Formal Methods","author":"M Schuts","year":"2016","unstructured":"Schuts, M., Hooman, J., Vaandrager, F.: Refactoring of legacy software using model learning and equivalence checking: an industrial experience report. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 311\u2013325. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-33693-0_20"},{"key":"23_CR61","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-05089-3_14"},{"key":"23_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-25423-4_5","volume-title":"Formal Methods and Software Engineering","author":"W Smeenk","year":"2015","unstructured":"Smeenk, W., Moerman, J., Vaandrager, F., Jansen, D.N.: Applying automata learning to embedded control software. In: Butler, M., Conchon, S., Za\u00efdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 67\u201383. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25423-4_5"},{"key":"23_CR63","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21455-4_8"},{"key":"23_CR64","doi-asserted-by":"crossref","unstructured":"Tappler, M., Aichernig, B.K., Bloem, R.: Model-based testing IoT communication via active automata learning. In: Proceedings ICST 2017, pp. 276\u2013287. IEEE Computer Society (2017)","DOI":"10.1109\/ICST.2017.32"},{"key":"23_CR65","first-page":"103","volume":"17","author":"J Tretmans","year":"1996","unstructured":"Tretmans, J.: Test generation with inputs, outputs, and repetitive quiescence. Softw. Concepts Tools 17, 103\u2013120 (1996)","journal-title":"Softw. Concepts Tools"},{"key":"23_CR66","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.) Formal Methods and Testing. LNCS, vol. 4949, pp. 1\u201338. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78917-8_1"},{"issue":"5","key":"23_CR67","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/stvr.456","volume":"22","author":"M Utting","year":"2012","unstructured":"Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Softw. Test. Verif. Reliab. 22(5), 297\u2013312 (2012)","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"2","key":"23_CR68","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"23_CR69","doi-asserted-by":"crossref","unstructured":"Volpato, M., Tretmans, J.: Towards quality of model-based testing in the ioco framework. In: Proceedings JAMAICA 2013, pp. 41\u201346. ACM, New York (2013)","DOI":"10.1145\/2489280.2489293"},{"key":"23_CR70","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K., Damas, C., Lambeau, B., Dupont, P.: A framework for the competitive evaluation of model inference techniques. In: Proceedings MIIT 2010, pp. 1\u20139. ACM (2010)","DOI":"10.1145\/1868044.1868045"},{"issue":"4","key":"23_CR71","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."}],"container-title":["Lecture Notes in Computer Science","Models, Mindsets, Meta: The What, the How, and the Why Not?"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22348-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T14:14:44Z","timestamp":1561558484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-22348-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030223472","9783030223489"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22348-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}