F. Aarts, B. Jonsson, and J. Uijen, Generating Models of Infinite-State Communication Protocols using Regular Inference with Abstraction, pp.188-204, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00767416

D. Angluin, Learning Regular Sets from Queries and Counterexamples, Information and Computation, pp.87-106, 1987.
DOI : 10.1016/0890-5401(87)90052-6

URL : http://doi.org/10.1016/0890-5401(87)90052-6

A. Bertolino, P. Inverardi, P. Pelliccione, and M. Tivoli, Automatic synthesis of behavior protocols for composable web-services, Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium, ESEC/FSE '09, pp.141-150, 2009.
DOI : 10.1145/1595696.1595719

URL : https://hal.archives-ouvertes.fr/inria-00415421

J. C. Corbett, M. B. Dwyer, J. Hatcliff, S. Laubach, C. S. Pasareanu et al., Bandera, Proceedings of the 22nd international conference on Software engineering , ICSE '00, pp.22-439, 2000.
DOI : 10.1145/337180.337234

F. C. Hennie, Fault-Detecting Experiments for Sequential Circuits, Proc. Fifth Annual Symp. On Circuit Theory and Logical Design, pp.95-110, 1965.

M. N. Irfan, C. Oriat, and R. Groz, Angluin Style Finite State Machine Inference with Nonoptimal Counterexamples, pp.11-19, 2010.
DOI : 10.1145/1868044.1868046

URL : https://hal.archives-ouvertes.fr/hal-00953394

G. V. Jourdan, H. Ural, and H. Yenigün, Reduced checking sequences using unreliable reset, Information Processing Letters, vol.115, issue.5, pp.532-535, 2015.
DOI : 10.1016/j.ipl.2015.01.002

D. Lee and M. Yannakakis, Principles and methods of testing finite state machines-a survey, The Proceedings of IEEE, pp.1090-1123, 1996.
DOI : 10.1109/5.533956

K. Meinke, CGE: a sequential learning algorithm for Mealy automata, ICGI'10, pp.148-162, 2010.
DOI : 10.1007/978-3-642-15488-1_13

P. F. Mihancea and M. Minea, JMODEX: Model extraction for verifying security properties of web applications, 2014 Software Evolution Week, IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE), pp.450-453, 2014.
DOI : 10.1109/CSMR-WCRE.2014.6747216

A. Petrenko, K. Li, R. Groz, K. Hossen, and C. Oriat, Inferring Approximated Models for Systems Engineering, 2014 IEEE 15th International Symposium on High-Assurance Systems Engineering, pp.249-253, 2014.
DOI : 10.1109/HASE.2014.46

URL : https://hal.archives-ouvertes.fr/hal-00976109

F. P. Porto, A. T. Endo, and A. Simao, Generation of Checking Sequences Using Identification Sets, In: ICFEM, vol.2013, pp.115-130, 2013.
DOI : 10.1007/978-3-642-41202-8_9

A. Rezaki and H. Ural, Construction of checking sequences based on characterization sets, Computer Communications, vol.18, issue.12, pp.911-920, 1995.
DOI : 10.1016/0140-3664(96)81589-1

R. L. Rivest and R. E. Schapire, Inference of finite automata using homing sequences, Machine Learning: From Theory to Applications, pp.51-73, 1993.

M. Shahbaz and R. Groz, Inferring Mealy Machines, FM 2009, pp.207-222, 2009.
DOI : 10.1007/978-3-642-05089-3_14

URL : https://hal.archives-ouvertes.fr/hal-00953587

B. Steffen, F. Howar, and M. Merten, Introduction to Active Automata Learning from a Practical Perspective, Proc. SFM, pp.256-296, 2011.
DOI : 10.1007/978-3-642-21455-4_8

URL : https://hal.archives-ouvertes.fr/hal-00647729

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