]. F. Aarts-2010a, F. W. Aarts, and . Vaandrager, Learning I/O Automata, CON- CUR 2010 -Concurrency Theory, 21th International Conference, pp.71-85, 2010.
DOI : 10.1007/978-3-642-15375-4_6

B. Fides-aarts, J. Jonsson, and . Uijen, Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction, ICTSS, pp.188-204, 2010.

J. Abela, F. Coste, and S. Spina, Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA, Grammatical Inference: Algorithms and Applications, 7th International Colloquium, pp.28-39, 2004.
DOI : 10.1007/978-3-540-30195-0_4

R. Ammons, J. R. Bodík, and . Larus, Mining specifications, POPL, pp.4-16, 2002.
DOI : 10.1145/565816.503275

D. Angluin, Learning regular sets from queries and counterexamples, Information and Computation, vol.75, issue.2, pp.87-106, 1987.
DOI : 10.1016/0890-5401(87)90052-6

L. Apfelbaum and J. Doyle, Model Based Testing, Software Quality Week Conference, pp.296-300, 1997.

L. José, J. Balcázar, R. Díaz, and . Gavaldà, Algorithms for Learning Finite Automata from Queries: A Unified View, Advances in Algorithms , Languages, and Complexity, pp.53-72, 1997.

]. Berg, O. Grinchtein, B. Jonsson, M. Leucker, H. Raffelt et al., On the Correspondence Between Conformance Testing and Regular Inference, FASE, pp.175-189, 2005.
DOI : 10.1007/978-3-540-31984-9_14

]. Berg, B. Jonsson, M. Leucker, and M. Saksena, Insights to Angluin's Learning, Electronic Notes in Theoretical Computer Science, vol.118, pp.3-18, 2005.
DOI : 10.1016/j.entcs.2004.12.015

T. Berg and H. Raffelt, Model Checking In Model-Based Testing of Reactive Systems, LNCS, vol.3472, pp.557-603, 2005.

]. A. Biermann and J. A. Feldman, On the synthesis of finitestate machines from samples of their behaviour, IEEE Trans Computers, vol.21, issue.13, pp.591-597, 1972.

A. Birkendorf, A. Böker, and H. U. Simon, Learning Deterministic Finite Automata from Smallest Counterexamples, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms , SODA '98, pp.599-608, 1998.
DOI : 10.1137/S0895480198340943

]. Bohlin, B. Jonsson, and S. Soleimanifard, Inferring Compact Models of Communication Protocol Entities, ISoLA (1), pp.658-672, 2010.
DOI : 10.1007/BF01068590
URL : https://hal.archives-ouvertes.fr/hal-00767431

. Angluin-style, . Learning, and . Nfa, Research Report LSV-08-28, p.27, 2008.

M. Broy, B. Jonsson, J. Katoen, M. Leucker, and A. Pretschner, Model-based testing of reactive systems, advanced lectures [the volume is the outcome of a research seminar that was held in schloss dagstuhl in january, Lecture Notes in Computer Science, vol.3472, 2004.

H. Nader, R. Bshouty, S. Cleve, C. Kannan, and . Tamon, Oracles and queries that are sufficient for exact learning (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, COLT '94, pp.130-139, 1994.

]. Bué, F. Dadeau, and P. Héam, Model-Based Testing Using Symbolic Animation and Machine Learning, ICST Workshops, pp.355-360, 2010.

M. M. Bugalho and A. L. Oliveira, Inference of regular languages using state merging algorithms with search, Pattern Recognition, vol.38, issue.9, pp.1457-1467, 2005.
DOI : 10.1016/j.patcog.2004.03.027

M. Edmund, O. Clarke, S. Grumberg, Y. Jha, H. Lu et al., Counterexample-guided abstraction refinement for symbolic model checking, J. ACM, vol.50, issue.5, pp.752-794, 2003.

H. De-la and J. Janodet, Zulu: An interactive learning competition. ZULU workshop organised during ICGI, pp.28-60, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00476802

E. Jonathan, A. L. Cook, and . Wolf, Automating Process Discovery Through Event-Data Analysis, ICSE, pp.73-82, 1995.

E. Jonathan, A. Cook, A. L. Klauser, B. G. Wolf, and . Zorn, Semi-automatic, Self-adaptive Control of Garbage Collection Rates in Object Databases, SIGMOD Conference, pp.377-388, 1996.

J. E. Cook and A. L. Wolf, Discovering models of software processes from event-based data, ACM Transactions on Software Engineering and Methodology, vol.7, issue.3, pp.215-249, 1998.
DOI : 10.1145/287000.287001

S. R. Dalal, A. Jain, N. Karunanithi, J. M. Leaton, C. M. Lott et al., Model-based testing in practice, Proceedings of the 21st international conference on Software engineering, ICSE '99, pp.285-294, 1999.
DOI : 10.1145/302405.302640

]. V. Dallmeier, N. Knopp, C. Mallon, S. Hack, and A. Zeller, Generating test cases for specification mining, Proceedings of the 19th international symposium on Software testing and analysis, ISSTA '10, pp.85-96, 2010.
DOI : 10.1145/1831708.1831719

G. David-detlefs, J. B. Nelson, and . Saxe, Simplify: a theorem prover for program checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.
DOI : 10.1145/1066100.1066102

M. Domaratzki, D. Kisman, and J. Shallit, On the Number of Distinct Languages Accepted by Finite Automata with n States, Journal of Automata, Languages and Combinatorics, vol.7, issue.118, pp.469-486, 2002.

]. Dorofeeva, N. Yevtushenko, K. El-fakih, and A. R. Cavalli, Experimental evaluation of FSM-based testing methods, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), pp.23-32, 2005.
DOI : 10.1109/SEFM.2005.17

]. P. Dupont, L. Miclet, and E. Vidal, What is the search space of the regular inference?, ICGI'94 - Lectures Notes in Computer ScienceGrammatical Inference and Applications, pp.25-37, 1994.
DOI : 10.1007/3-540-58473-0_134

S. Eisenstat and D. Angluin, Learning Random DFAs with Membership Queries: the GoodSplit Algorithm. ZULU workshop organised during ICGI, pp.12-29, 2010.

R. Fakih, M. N. Groz, M. Irfan, and . Shahbaz, Learning Finite State Models of Observable Nondeterministic Systems in a Testing Context, 22nd IFIP International Conference on Testing Software and Systems, pp.97-102, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00953395

]. M. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin, Dynamically discovering likely program invariants to support program evolution, Proceedings of the 21st International Conference on Software Engineering, pp.99-123, 1999.
DOI : 10.1109/32.908957

]. Fujiwara, G. Von-bochmann, F. Khendek, M. Amalou, and A. Ghedamsi, Test selection based on finite state models, IEEE Transactions on Software Engineering, vol.17, issue.6, pp.591-603, 1991.
DOI : 10.1109/32.87284

]. Garcia, M. Vazquez-de-parga, and D. Lopez, Some ideas on active learning using membership queries. ZULU workshop organised during ICGI'10, pp.12-20, 2010.

M. Gheorghiu, D. Giannakopoulou, and C. S. P?s?reanu, Refining Interface Alphabets for Compositional Verification, Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems, TACAS'07, pp.292-307, 2007.
DOI : 10.1007/978-3-540-71209-1_23

]. E. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

]. E. Gold, System identification via state characterization, Automatica, vol.8, issue.5, pp.621-636, 1972.
DOI : 10.1016/0005-1098(72)90033-7

]. A. Groce, D. Peled, and M. Yannakakis, Adaptive Model Checking, Logic Journal of IGPL, vol.14, issue.5, pp.729-744, 2006.
DOI : 10.1093/jigpal/jzl007

]. Groz and K. Li, Alexandre Petrenko and Muzammil Shahbaz. Modular System Verification by Inference, Testing and Reachability Analysis, pp.216-233, 2008.

]. M. Harrison, Introduction to formal language theory, 1978.

M. Robert, J. P. Hierons, M. Bowen, and . Harman, Formal methods and testing, an outcome of the fortest network, revised selected papers, Lecture Notes in Computer Science, vol.4949, 2008.

F. Howar, B. Steffen, and M. Merten, From ZULU to RERS -Lessons Learned in the ZULU Challenge, pp.687-704, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00647740

T. Hardi-hungar, B. Margaria, and . Steffen, Test-Based Model Generation For Legacy Systems, ITC, pp.971-980, 2003.

O. Hardi-hungar, B. Niese, and . Steffen, Domain-Specific Optimization in Automata Learning, CAV, pp.315-327, 2003.
DOI : 10.1007/978-3-540-45069-6_31

H. Oscar, T. Ibarra, and . Jiang, Learning regular languages from counterexamples, J. Comput. Syst. Sci, vol.43, issue.25, pp.299-316, 1991.

N. Muhammad and . Irfan, State Machine Inference in Testing Context with Long Counterexamples, Third International Conference on Software Testing, Verification and Validation, ICST 2010, pp.508-511, 2010.

]. Jelinek, Statistical methods for speech recognition, 1997.

]. M. Kearns and U. V. Vazirani, An introduction to computational learning theory, 1994.

]. S. Keidar and Y. Rodeh, Searching for Counter-Examples Adaptively, 6th International Workshop on Formal Methods, 2003.

N. Kicillof, W. Grieskamp, N. Tillmann, and V. A. Braberman, Achieving both model and code coverage with automated gray-box testing, Proceedings of the 3rd international workshop on Advances in model-based testing , A-MOST '07, pp.1-11, 2007.
DOI : 10.1145/1291535.1291536

]. A. Korshunov, The degree of distinguishability of automata, Diskret. Analiz, pp.10-39, 1967.

]. K. Lang, B. A. Pearlmutter, and R. A. Price, Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm, Proc. 4th International Colloquium on Grammatical Inference - ICGI 98, pp.1-12, 1998.
DOI : 10.1007/BFb0054059

K. J. Lang, Faster Algorithms for Finding Minimal Consistent DFAs, 1999.

]. K. Li, R. Groz, and M. Shahbaz, Integration Testing of Components Guided by Incremental State Machine Learning, Testing: Academia and Industry Conference -Practice And Research Techniques (TAIC PART 2006), pp.59-70, 2006.

]. Li, A Smart Structured Test Automation Language (SSTAL), 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp.471-474, 2012.
DOI : 10.1109/ICST.2012.128

C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem, Property preserving abstractions for the verification of concurrent systems, Formal Methods in System Design, pp.11-44, 1995.
DOI : 10.1007/BF01384313

]. D. Lorenzoli, L. Mariani, and M. Pezzè, Automatic generation of software behavioral models, Proceedings of the 13th international conference on Software engineering , ICSE '08, pp.501-510, 2008.
DOI : 10.1145/1368088.1368157

M. Franco and . Luque, A Lazy L* Algorithm for Learning Regular Languages from Queries. ZULU workshop organised during ICGI, 2010.

O. Maler and A. Pnueli, On the Learnability of Infinitary Regular Sets, Information and Computation, vol.118, issue.2, pp.316-326, 1995.
DOI : 10.1006/inco.1995.1070

]. T. Margaria, O. Niese, H. Raffelt, and B. Steffen, Efficient test-based model generation for legacy reactive systems. High-Level Design, Validation, and Test Workshop, IEEE International, vol.0, issue.59, pp.95-100, 0118.

B. Tiziana-margaria, M. Steffen, and . Reitenspieß, Service-Oriented Design: The jABC Approach, Service Oriented Computing, 2005.

. Meinke, F. Meinke, and . Niu, A Learning-Based Approach to Unit Testing of Numerical Software, ICTSS, pp.221-235, 2010.
DOI : 10.1007/978-3-642-16573-3_16
URL : https://hal.archives-ouvertes.fr/hal-01055250

. Meinke, F. Meinke, and . Niu, Learning-Based Testing for Reactive Systems Using Term Rewriting Technology, ICTSS, pp.97-114, 2011.
DOI : 10.1007/978-3-642-24580-0_8

M. and M. A. Sindhu, Incremental Learning- Based Testing for Reactive Systems, TAP, pp.134-151, 2011.

B. Maik-merten and . Steffen, Falk Howar and Tiziana Margaria. Next Generation LearnLib, TACAS, pp.220-223, 2011.

]. R. Milner, A calculus of communicating systems, 1982.
DOI : 10.1007/3-540-10235-3

M. Tom and . Mitchell, Machine learning, 1997.

. Moller-]-faron, P. Moller, and . Stevens, Edinburgh Concurrency Workbench User Manual (Version 7.1) Available from http

F. Edward and . Moore, Gedanken Experiments on Sequential Machines, Automata Studies, pp.129-153, 1956.

H. Muccini, A. Polini, F. Ricci, and A. Bertolino, Monitoring Architectural Properties in Dynamic Component-Based Systems, CBSE, pp.124-139, 2007.
DOI : 10.1007/978-3-540-73551-9_9

J. Glenford, C. Myers, and . Sandler, The art of software testing, 2004.

]. O. Niese, T. Margaria, A. Hagerer, B. Steffen, G. Brune et al., Automated regression testing of CTI-systems, IEEE European Test Workshop, 2001., pp.51-51, 2001.
DOI : 10.1109/ETW.2001.946662

]. A. Oliveira and J. Silva, Efficient search techniques for the inference of minimum size finite automata, Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207), pp.81-89, 1998.
DOI : 10.1109/SPIRE.1998.712986

]. J. Oncina and P. Garcia, Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, pp.49-61, 1992.

L. David, A. Parnas, S. John-van-schouwen, and . Kwan, Evaluation of safety-critical software, Commun. ACM, vol.33, issue.6, pp.636-648, 1990.

]. C. Pasareanu, D. Giannakopoulou, M. G. Bobaru, J. M. Cobleigh, and H. Barringer, Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning, Formal Methods in System Design, vol.103, issue.2, pp.175-205, 2008.
DOI : 10.1007/s10703-008-0049-6

M. Jorge, A. L. Pena, and . Oliveira, A new algorithm for the reduction of incompletely specified finite state machines, ICCAD, pp.482-489, 1998.

]. M. Pradel, P. Bichsel, and T. R. Gross, A framework for the evaluation of specification miners based on finite state machines, 2010 IEEE International Conference on Software Maintenance, pp.1-10, 2010.
DOI : 10.1109/ICSM.2010.5609576

]. H. Raffelt, B. Steffen, and T. Berg, LearnLib, Proceedings of the 10th international workshop on Formal methods for industrial critical systems , FMICS '05, pp.62-71, 2005.
DOI : 10.1145/1081180.1081189
URL : https://hal.archives-ouvertes.fr/inria-00459959

]. H. Raffelt and B. Steffen, LearnLib, Proceedings of the 10th international workshop on Formal methods for industrial critical systems , FMICS '05, pp.377-380, 2006.
DOI : 10.1145/1081180.1081189
URL : https://hal.archives-ouvertes.fr/inria-00459959

H. Raffelt, T. Margaria, B. Steffen, and M. Merten, Hybrid test of web applications with webtest, Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications, TAV-WEB '08, pp.1-7, 2008.
DOI : 10.1145/1390832.1390833

H. Raffelt, M. Merten, B. Steffen, and T. Margaria, Dynamic testing via automata learning, International Journal on Software Tools for Technology Transfer, vol.17, issue.6, pp.307-324, 2009.
DOI : 10.1007/s10009-009-0120-7
URL : https://hal.archives-ouvertes.fr/inria-00459956

]. M. Ramanathan, A. Grama, and S. Jagannathan, Static specification inference using predicate mining, ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp.123-134, 2007.
DOI : 10.1145/1273442.1250749

L. Ronald, R. E. Rivest, and . Schapire, Inference of Finite Automata Using Homing Sequences, Machine Learning: From Theory to Applications, pp.51-73, 1993.

K. Shahbaz, R. Li, and . Groz, Learning and Integration of Parameterized Components Through Testing, TestCom/FATES, pp.319-334, 2007.
DOI : 10.1007/978-3-540-73066-8_22

M. Shahbaz and R. Groz, Inferring Mealy Machines, FM, pp.207-222, 2009.
DOI : 10.1007/978-3-642-05089-3_14
URL : https://hal.archives-ouvertes.fr/hal-00953587

K. C. Shahbaz, R. Shashidhar, and . Eschbach, Iterative refinement of specification for component based embedded systems, Proceedings of the 2011 International Symposium on Software Testing and Analysis, ISSTA '11, pp.276-286, 2011.
DOI : 10.1145/2001420.2001454

]. S. Shoham, E. Yahav, S. J. Fink, and M. Pistoia, Static specification mining using automata-based abstractions, ACM/SIGSOFT International Symposium on Software Testing and Analysis, pp.174-184, 2007.
DOI : 10.1145/1273463.1273487
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.9497

]. Shu and D. Lee, Testing Security Properties of Protocol Implementations - a Machine Learning Based Approach, 27th International Conference on Distributed Computing Systems (ICDCS '07), pp.25-26, 2007.
DOI : 10.1109/ICDCS.2007.147

]. D. Sidhu and T. Leung, Formal methods for protocol testing: a detailed study, IEEE Transactions on Software Engineering, vol.15, issue.4, pp.413-426, 1989.
DOI : 10.1109/32.16602

M. Bradford-starkie, D. Van-zaanen, and . Estival, The Tenjinno Machine Translation Competition, ICGI, pp.214-226, 2006.

]. Steffen, T. Margaria, R. Nagel, S. Jörges, and C. Kubczak, Model-Driven Development with the jABC, Haifa Verification Conference, pp.92-108, 2006.
DOI : 10.1007/978-3-540-70889-6_7

]. Steffen, F. Howar, and M. Merten, Introduction to Active Automata Learning from a Practical Perspective, SFM, pp.256-296, 2011.
DOI : 10.1007/978-3-642-21455-4_8
URL : https://hal.archives-ouvertes.fr/hal-00647729

]. B. Trakhtenbrot and Y. M. Barzdin, Finite Automata, Behaviour and Synthesis, pp.40-106, 1973.

M. Utting and B. Legeard, Practical model-based testing -a tools approach, 2007.

]. M. Vasilevskii, Failure diagnosis of automata, Cybernetics, vol.9, issue.4, pp.653-665, 0118.
DOI : 10.1007/BF01068590

]. N. Walkinshaw, K. Bogdanov, S. Ali, and M. Holcombe, Automated discovery of state transitions and their functions in source code, Software Testing, Verification and Reliability, vol.18, issue.2, pp.99-121, 2008.
DOI : 10.1002/stvr.380

]. N. Walkinshaw, K. Bogdanov, C. Damas, B. Lambeau, and P. Dupont, A framework for the competitive evaluation of model inference techniques, Proceedings of the First International Workshop on Model Inference In Testing, MIIT '10, pp.1-9, 2010.
DOI : 10.1145/1868044.1868045

K. Neil-walkinshaw, J. Bogdanov, J. Derrick, and . Paris, Increasing Functional Coverage by Inductive Testing: A Case Study, ICTSS, pp.126-141, 2010.
DOI : 10.1007/978-3-642-16573-3_10

]. A. Wasylkowski, A. Zeller, and C. Lindig, Detecting object usage anomalies, Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering , ESEC-FSE '07, pp.35-44, 2007.
DOI : 10.1145/1287624.1287632
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.4721

]. T. Xie-2004, D. Xie, and . Notkin, Mutually Enhancing Test Generation and Specification Inference, Formal Approaches to Software Testing, Third International Workshop on Formal Approaches to Testing of Software, FATES 2003, pp.60-69, 2004.
DOI : 10.1007/978-3-540-24617-6_5

]. T. Yokomori, Learning non-deterministic finite automata from queries and counterexamples, Machine Intelligence 13, pp.169-189, 1994.