. Ruleml, The Rule Markup Initiative

F. Aarts, B. Jonsson, and J. Uijen, Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction, Lecture Notes in Computer Science, vol.6435, pp.188-204, 2010.
DOI : 10.1007/978-3-642-16573-3_14
URL : https://hal.archives-ouvertes.fr/hal-00767416

F. Aarts, J. Schmaltz, and F. W. Vaandrager, Inference and Abstraction of the Biometric Passport, Margaria and Steffen [51], pp.673-686
DOI : 10.1007/978-3-540-78917-8_1

F. Aarts and F. 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

R. Alur, P. Cern´ycern´y, P. Madhusudan, and W. Nam, Synthesis of interface specifications for Java classes, POPL, pp.98-109, 2005.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

G. Ammons, R. Bodik, and J. Larus, Mining specifications, Proc. 29 th ACM Symp. on Principles of Programming Languages, pp.4-16, 2002.
DOI : 10.1145/565816.503275

D. Angluin, Learning regular sets from queries and counterexamples. Information and Computation, pp.87-106, 1987.

A. Bertolino, A. Calabròcalabr-`-calabrò, F. Lonetti, A. D. Marco, and A. Sabetta, Towards a Model-Driven Infrastructure for Runtime Monitoring, 2011.
DOI : 10.1007/s10270-006-0024-x
URL : https://hal.archives-ouvertes.fr/hal-00647363

C. Bartolini, A. Bertolino, E. Marchetti, and A. Polini, WS-TAXI: A WSDL-based Testing Tool for Web Services, 2009 International Conference on Software Testing Verification and Validation, 2009.
DOI : 10.1109/ICST.2009.28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.993

M. Benedikt, C. Ley, and G. Puppis, What you must remember when processing data words, Proc. 4th Alberto Mendelzon Int. Workshop on Foundations of Data Management Proceedings, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00717773

T. Berg, B. Jonsson, and H. Raffelt, Regular Inference for State Machines Using Domains with Equality Tests, Lecture Notes in Computer Science, vol.4961, pp.317-331, 2008.
DOI : 10.1007/978-3-540-78743-3_24

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

H. Björklundbj¨björklund and T. Schwentick, On notions of regularity for data languages, Theoretical Computer Science, vol.411, issue.4-5, pp.702-715, 2010.
DOI : 10.1016/j.tcs.2009.10.009

T. Bohlin, B. Jonsson, and S. Soleimanifard, Inferring Compact Models of Communication Protocol Entities, Margaria and Steffen [51], pp.658-672
DOI : 10.1007/BF01068590
URL : https://hal.archives-ouvertes.fr/hal-00767431

M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin, Two-Variable Logic on Words with Data, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2011.
DOI : 10.1109/LICS.2006.51
URL : https://hal.archives-ouvertes.fr/hal-00151749

M. Bojanczyk, B. Klin, and S. Lasota, Automata with Group Actions, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.355-364, 2011.
DOI : 10.1109/LICS.2011.48
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.1795

S. Cassel, F. Howar, B. Jonsson, M. Merten, and B. Steffen, A Succinct Canonical Register Automaton Model, ATVA, pp.366-380, 2011.
DOI : 10.1007/978-3-642-24372-1_26
URL : https://hal.archives-ouvertes.fr/hal-00647724

E. Clarke, O. Grumberg, and D. Peled, Model Checking, 1999.

D. Combe, C. De-la-higuera, J. Janodet, and M. Ponge, Zulu -Active learning from queries competition
DOI : 10.1007/978-3-642-14684-8_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.370.7333

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

M. D. Ernst, J. H. Perkins, P. J. Guo, S. Mccamant, C. Pacheco et al., The Daikon system for dynamic detection of likely invariants, Science of Computer Programming, vol.69, issue.1-3, pp.1-335, 2007.
DOI : 10.1016/j.scico.2007.01.015

N. Francez and M. Kaminski, An algebraic characterization of deterministic regular languages over infinite alphabets, Theoretical Computer Science, vol.306, issue.1-3, pp.155-175, 2003.
DOI : 10.1016/S0304-3975(03)00246-9

C. Ghezzi, A. Mocci, and M. Monga, Synthesizing Intentional Behavior Models by Graph Transformation, 2009.
DOI : 10.1109/icse.2009.5070542

E. M. 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

O. Grinchtein, B. Jonsson, and M. Leucker, Learning of event-recording automata, Theoretical Computer Science, vol.411, issue.47, pp.4029-4054, 2010.
DOI : 10.1016/j.tcs.2010.07.008
URL : https://hal.archives-ouvertes.fr/inria-00459696

O. Grumberg, O. Kupferman, and S. Sheinvald, Variable Automata over Infinite Alphabets, LATA, pp.561-572, 2010.
DOI : 10.1007/978-3-642-13089-2_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.7601

A. Hagerer, H. Hungar, O. Niese, and B. Steffen, Model Generation by Moderated Regular Extrapolation, Proc. FASE '02, 5 th Int. Conf. on Fundamental Approaches to Software Engineering, pp.80-95, 2002.
DOI : 10.1007/3-540-45923-5_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.1130

J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.
DOI : 10.1145/568438.568455

F. Howar, B. Steffen, B. Jonsson, and S. Cassel, Inferring Canonical Register Automata, VMCAI 2012
DOI : 10.1007/978-3-642-21455-4_9
URL : https://hal.archives-ouvertes.fr/hal-00664277

F. Howar, B. Steffen, and M. Merten, Automata Learning with Automated Alphabet Abstraction Refinement, Twelfth International Conference on Verification, Model Checking, and Abstract Interpretation, 2011.
DOI : 10.1007/978-3-642-05089-3_14
URL : https://hal.archives-ouvertes.fr/hal-00647711

A. Huima, Implementing Conformiq Qtronic, Proc. TestCom/FATES, pp.1-12, 2007.
DOI : 10.1007/978-3-540-73066-8_1

H. Hungar, T. Margaria, and B. Steffen, Test-based model generation for legacy systems, Test Conference Proceedings. ITC 2003. International, pp.971-980, 2003.

H. Hungar, O. Niese, and B. Steffen, Domain-Specific Optimization in Automata Learning, Proc. 15 th Int. Conf. on Computer Aided Verification, 2003.
DOI : 10.1007/978-3-540-45069-6_31

X. Jinyu, X. Xiaorong, W. Jingtao, and H. Yingduo, Framework of synchronous dynamic security monitoring system based on pmu, Power Tech Conference Proceedings, 2003.

B. Jonsson, Learning of Automata Models Extended with Data, SFM, pp.327-349, 2011.
DOI : 10.1007/978-3-642-21455-4_10
URL : https://hal.archives-ouvertes.fr/hal-00647576

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1016/0304-3975(94)90242-9

P. Kanellakis and S. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Information and Computation, vol.86, issue.1, pp.43-68, 1990.
DOI : 10.1016/0890-5401(90)90025-D

R. Lazic and D. Nowak, A Unifying Approach to Data-Independence, Proc. CONCUR 2000, 11 th Int. Conf. on Concurrency Theory, pp.581-595, 2000.
DOI : 10.1007/3-540-44618-4_41

D. Lo and S. Maoz, Scenario-based and value-based specification mining, Proceedings of the IEEE/ACM international conference on Automated software engineering, ASE '10, pp.387-396, 2010.
DOI : 10.1145/1858996.1859081

D. Lorenzoli, L. Mariani, M. Pezzèpezz, and . 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

O. Maler and A. Pnueli, On Recognizable Timed Languages, Proc. FOSSACS04, Conf. on Foundations of Software Science and Computation Structures, 2004.
DOI : 10.1007/978-3-540-24727-2_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.1108

L. Mariani, M. Pezzèpezz, and . Pezzè, Dynamic Detection of COTS Component Incompatibility, IEEE Software, vol.24, issue.5, pp.76-85, 2007.
DOI : 10.1109/MS.2007.138

M. Merten, B. Steffen, F. Howar, and T. Margaria, Next Generation LearnLib, TACAS 2011, pp.220-223, 2011.
DOI : 10.1007/978-3-540-70889-6_7
URL : https://hal.archives-ouvertes.fr/hal-00647749

M. Merten, B. Steffen, F. Howar, and T. Margaria, Next Generation LearnLib, TACAS, pp.220-223, 2011.
DOI : 10.1007/978-3-540-70889-6_7
URL : https://hal.archives-ouvertes.fr/hal-00647749

A. Nerode, Linear automaton transformations, Proceedings of the American Mathematical Society, vol.9, issue.4, pp.541-544, 1958.
DOI : 10.1090/S0002-9939-1958-0135681-9

. C. Oracle, . Jax-ws, and . Ri, Online; accessed 13, 2011.

R. Paige and R. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

C. Pautasso, O. Zimmermann, and F. Leymann, Restful web services vs. "big"' web services, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.805-814, 2008.
DOI : 10.1145/1367497.1367606

A. Petrenko, S. Boroday, and R. Groz, Confirming configurations in efsm testing, IEEE Transactions on Software Engineering, vol.30, issue.1, pp.29-42, 2004.
DOI : 10.1109/TSE.2004.1265734

M. Pradel and T. Gross, Automatic Generation of Object Usage Specifications from Large Method Traces, 2009 IEEE/ACM International Conference on Automated Software Engineering, pp.371-382, 2009.
DOI : 10.1109/ASE.2009.60

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, B. Steffen, T. Berg, and T. Margaria, LearnLib, Proceedings of the 10th international workshop on Formal methods for industrial critical systems , FMICS '05, pp.393-407, 2009.
DOI : 10.1145/1081180.1081189
URL : https://hal.archives-ouvertes.fr/inria-00459959

R. Rivest and R. Schapire, Inference of Finite Automata Using Homing Sequences, Information and Computation, vol.103, issue.2, pp.299-347, 1993.
DOI : 10.1006/inco.1993.1021

H. Sakamoto, Learning simple deterministic finite-memory automata, ALT '97: Proc. 8th International Conference on Algorithmic Learning Theory, pp.416-431, 1997.
DOI : 10.1007/3-540-63577-7_58

L. Segoufin, Automata and Logics for Words and Trees over an Infinite Alphabet, CSL: Proc. 20th Int. Workshop on Ccomputer Science Logic, pp.41-57, 2006.
DOI : 10.1007/11874683_3

M. Shahbaz, K. Li, and R. Groz, Learning Parameterized State Machine Model for Integration Testing, 31st Annual International Computer Software and Applications Conference, Vol. 2, (COMPSAC 2007), pp.755-760, 2007.
DOI : 10.1109/COMPSAC.2007.134

M. Shahbaz, K. C. Shashidhar, and R. 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

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

B. 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

J. Tretmans, Model-Based Testing and Some Steps towards Test-Based Modelling, In SFM Lecture Notes in Computer Science, vol.6659, pp.297-326, 2011.
DOI : 10.1007/978-3-642-21455-4_9

A. Wasylkowski and A. Zeller, Mining Operational Preconditions

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. Wilke, Specifying timed state sequences in powerful decidable logics and timed automata, Lecture Notes in Computer Science, vol.863, pp.694-715, 1994.
DOI : 10.1007/3-540-58468-4_191