]. M. Abadi and L. Lamport, Composing specifications, ACM Transactions on Programming Languages and Systems, vol.15, issue.1, pp.73-132, 1993.
DOI : 10.1145/151646.151649
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1637

M. Abadi and L. Lamport, Conjoining specifications, ACM Transactions on Programming Languages and Systems, vol.17, issue.3, pp.507-534, 1995.
DOI : 10.1145/203095.201069

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

M. Autili, C. Chilton, P. Inverardi, M. Kwiatkowska, and M. Tivoli, Towards a Connector Algebra, Leveraging Applications of Formal Methods, Verification, and Validation, pp.278-292, 2010.
DOI : 10.1007/978-3-642-16561-0_28
URL : https://hal.archives-ouvertes.fr/inria-00512431

C. Baier and J. Katoen, Principles of Model Checking, 2008.

D. Berardi, D. Calvanese, G. De-giacomo, R. Hull, and M. Mecella, Automatic composition of transition-based semantic web services with messaging, Proceedings of the 31st international conference on Very large data bases, VLDB '05. VLDB Endowment, 2005.

F. Bergadano and S. Varricchio, Learning Behaviors of Automata from Multiplicity and Equivalence Queries, SIAM Journal on Computing, vol.25, issue.6, pp.1268-1280, 1996.
DOI : 10.1137/S009753979326091X

P. Bertoli, M. Pistore, and P. Traverso, Automated composition of Web services via planning in asynchronous domains, Artificial Intelligence, vol.174, issue.3-4, pp.316-361, 2010.
DOI : 10.1016/j.artint.2009.12.002

P. Bhaduri and S. Ramesh, Interface synthesis and protocol conversion, Formal Aspects of Computing, vol.32, issue.5, pp.205-224, 2008.
DOI : 10.1007/s00165-007-0045-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.9343

G. S. Blair, A. Bennaceur, N. Georgantas, P. Grace, V. Issarny et al., The Role of Ontologies in Emergent Middleware: Supporting Interoperability in Complex Distributed Systems, Middleware, pp.410-430, 2011.
DOI : 10.1007/978-3-642-25821-3_21
URL : https://hal.archives-ouvertes.fr/inria-00629059

V. Blondel and V. Canterini, Undecidable Problems for Probabilistic Automata of Fixed Dimension, Theory of Computing Systems, pp.231-245, 2001.
DOI : 10.1007/s00224-003-1061-2

B. Bollig, P. Habermehl, C. Kern, and M. Leucker, Angluin-style learning of NFA, Proc. IJCAI'09, pp.1004-1009, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00772636

S. D. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, pp.31560-599, 1984.
DOI : 10.1145/828.833

K. L. Calvert and S. S. Lam, Deriving a protocol converter: a top-down method, ACM SIGCOMM Computer Communication Review, vol.19, issue.4, pp.247-258, 1989.
DOI : 10.1145/75247.75271

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

S. Chaki and A. Gurfinkel, Automated assume-guarantee reasoning for omega-regular systems and specifications, Proc. NFM'10, pp.57-66, 2010.
DOI : 10.1007/s11334-011-0148-1

K. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, Algorithms for Omega-Regular Games with Imperfect Information, 2007.
DOI : 10.1007/11874683_19

T. Chen, C. Chilton, B. Jonsson, and M. Kwiatkowska, A Compositional Specification Theory for Component Behaviours, Proc. 21st European Symposium on Programming (ESOP'12), 2012.
DOI : 10.1007/978-3-642-28869-2_8
URL : https://hal.archives-ouvertes.fr/hal-00665599

J. Cobleigh, D. Giannakopoulou, and C. Pasareanu, Learning Assumptions for Compositional Verification, Proc. TACAS'03, 2003.
DOI : 10.1007/3-540-36577-X_24

P. Collette, Application of the composition principle to unity-like specifications, TAPSOFT '93: Theory and Practice of Software Development, pp.230-242, 1993.
DOI : 10.1007/3-540-56610-4_67

C. Deliverable and D. , Dynamic connector synthesis: revised prototype implementation. FET IP CONNECT EU project, FP7 grant agreement number 231167

C. Deliverable and D. , 3: Deployment of learning techniques, FET IP CONNECT EU project

L. De-alfaro, Formal Verification of Probabilistic Systems, 1997.

L. De-alfaro, Game Models for Open Systems, Theory and Practice, pp.192-193, 2004.
DOI : 10.1007/978-3-540-39910-0_12

L. De-alfaro and T. A. Henzinger, Interface automata, ACM SIGSOFT Software Engineering Notes, vol.26, issue.5, pp.109-120, 2001.
DOI : 10.1145/503271.503226

L. De-alfaro and T. A. Henzinger, Interface-Based Design, Engineering Theories of Software Intensive Systems, pp.83-104, 2005.
DOI : 10.1007/1-4020-3532-2_3

F. Denis and Y. Esposito, Learning Classes of Probabilistic Automata, COLT, 2004.
DOI : 10.1007/978-3-540-27819-1_9

L. Doyen, T. A. Henzinger, B. Jobstmann, and T. Petrov, Interface theories with component reuse, Proceedings of the 7th ACM international conference on Embedded software, EMSOFT '08, pp.79-88, 2008.
DOI : 10.1145/1450058.1450070
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.2600

L. Doyen, T. A. Henzinger, and J. Raskin, EQUIVALENCE OF LABELED MARKOV CHAINS, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.549-563, 2008.
DOI : 10.1142/S0129054108005814

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.1-4, 1991.
DOI : 10.1109/SFCS.1991.185392

K. Etessami, M. Kwiatkowska, M. Vardi, and M. Yannakakis, Multi-objective model checking of Markov decision processes, LMCS, vol.4, issue.4, pp.1-21, 2008.

A. Farzan, Y. Chen, E. Clarke, Y. Tsay, and B. Wang, Extending??Automated??Compositional??Verification to the Full Class of Omega-Regular Languages, Proc. TACAS'08, pp.2-17, 2008.
DOI : 10.1007/978-3-540-78800-3_2

L. Feng, T. Han, M. Kwiatkowska, and D. Parker, Learning-Based Compositional Verification for Synchronous Probabilistic Systems, Proc. 9th International Symposium on Automated Technology for Verification and Analysis (ATVA'11), pp.511-521, 2011.
DOI : 10.1007/978-3-642-24372-1_40
URL : https://hal.archives-ouvertes.fr/hal-00647061

L. Feng, T. Han, M. Kwiatkowska, and D. Parker, Learning-Based Compositional Verification for Synchronous Probabilistic Systems, 2011.
DOI : 10.1007/978-3-642-24372-1_40
URL : https://hal.archives-ouvertes.fr/hal-00647061

L. Feng, M. Kwiatkowska, and D. Parker, Compositional Verification of Probabilistic Systems Using Learning, 2010 Seventh International Conference on the Quantitative Evaluation of Systems, pp.133-142, 2010.
DOI : 10.1109/QEST.2010.24
URL : https://hal.archives-ouvertes.fr/inria-00531203

L. Feng, M. Kwiatkowska, and D. Parker, Automated Learning of Probabilistic Assumptions for Compositional Reasoning, Proc. 14th International Conference on Fundamental Approaches to Software Engineering (FASE'11), pp.2-17, 2011.
DOI : 10.1007/978-3-642-19811-3_2
URL : https://hal.archives-ouvertes.fr/hal-00647067

E. Grädelgr¨grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, Lecture Notes in Computer Science, 2001.

N. Guermouche, O. Perrin, and C. Ringeissen, A Mediator Based Approach For Services Composition, 2008 Sixth International Conference on Software Engineering Research, Management and Applications, 2008.
DOI : 10.1109/SERA.2008.43
URL : https://hal.archives-ouvertes.fr/inria-00275221

Y. Gurevich and L. Harrington, Trees, automata, and games, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.60-65, 1982.
DOI : 10.1145/800070.802177

T. Han, J. Katoen, and B. Damman, Counterexample generation in probabilistic model checking, IEEE Trans. Software Eng, vol.35, issue.2, pp.241-257, 2009.

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

R. Hull, M. Benedikt, V. Christophides, and J. Su, E-services, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, 2003.
DOI : 10.1145/773153.773154

B. Jonsson, Compositional specification and verification of distributed systems, ACM Transactions on Programming Languages and Systems, vol.16, issue.2, pp.259-303, 1994.
DOI : 10.1145/174662.174665

B. Jonsson and Y. Tsay, Assumption/guarantee specifications in linear-time temporal logic, An extended abstract appeared earlier in TAPSOFT '95, pp.47-72, 1996.
DOI : 10.1016/0304-3975(96)00069-2

M. B. Josephs, Receptive process theory, Acta Informatica, vol.1, issue.1, pp.17-31, 1992.
DOI : 10.1007/BF01178564

M. B. Josephs and H. K. Kapoor, Controllable delay-insensitive processes, Fundam. Inf, vol.78, issue.1, pp.101-130, 2007.

M. Kwiatkowska, G. Norman, D. Parker, and H. Qu, Assume-Guarantee Verification for Probabilistic Systems, Proc. TACAS'10, 2010.
DOI : 10.1007/978-3-642-12002-2_3
URL : https://hal.archives-ouvertes.fr/inria-00458058

K. G. Larsen, U. Nyman, and A. Wasowski, Modal I/O Automata for Interface and Product Line Theories, LNCS, vol.4421, pp.64-79, 2007.
DOI : 10.1007/978-3-540-71316-6_6

G. L. ¨-uttgen and W. Vogler, Conjunction on processes: Full abstraction via ready-tree semantics

. Theor, . Comput, G. L. Sci, W. ¨-uttgen, and . Vogler, Ready simulation for concurrency: It's logical! Inf, Comput, vol.373, issue.2087, pp.19-40845, 2007.

N. A. Lynch and M. R. Tuttle, An introduction to input/output automata, CWI Quarterly, vol.2, issue.3, pp.219-246, 1989.

A. Marconi, M. Pistore, and P. Traverso, Implicit vs. Explicit Data-Flow Requirements in Web Service Composition Goals, Service-Oriented Computing ICSOC 2006, 2006.
DOI : 10.1007/11948148_40

F. Martinelli, Analysis of security protocols as open systems, Theoretical Computer Science, vol.290, issue.1, pp.1057-1106, 2003.
DOI : 10.1016/S0304-3975(02)00596-0

F. Neven, T. Schwentick, and V. Vianu, Finite state machines for strings over infinite alphabets, ACM Transactions on Computational Logic, vol.5, issue.3, pp.403-435, 2004.
DOI : 10.1145/1013560.1013562
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.3039

R. D. Nicola and R. Segala, A process algebraic view of input/output automata, Theoretical Computer Science, vol.138, issue.2, pp.391-423, 1995.
DOI : 10.1016/0304-3975(95)92307-J

C. Pasareanu, D. Giannakopoulou, M. Bobaru, J. Cobleigh, and H. Barringer, Learning to divide and conquer: Applying the L* algorithm to automate assume-guarantee reasoning. Formal Methods in System Design, pp.175-205, 2008.

M. Pistore, A. Marconi, P. Bertoli, and P. Traverso, Automated composition of web services by planning at the knowledge level, Proceedings of IJCAI'05, the Nineteenth International Joint Conference on Artificial Intelligence, 2005.

M. Rabin, Probabilistic automata, Information and Control, vol.6, issue.3, pp.230-245, 1963.
DOI : 10.1016/S0019-9958(63)90290-0
URL : http://doi.org/10.1016/s0019-9958(63)90290-0

J. Raclet, Residual for Component Specifications, Electronic Notes in Theoretical Computer Science, vol.215, pp.93-110, 2008.
DOI : 10.1016/j.entcs.2008.06.023
URL : https://hal.archives-ouvertes.fr/inria-00141898

J. Raclet, E. Badouel, A. Benveniste, B. Caillaud, A. Legay et al., Modal interfaces, Proceedings of the seventh ACM international conference on Embedded software, EMSOFT '09, pp.87-96, 2009.
DOI : 10.1145/1629335.1629348
URL : https://hal.archives-ouvertes.fr/inria-00555742

J. Raclet, E. Badouel, A. Benveniste, B. Caillaud, A. Legay et al., A modal interface theory for component-based design, Fundam. Inform, vol.108, issue.1, pp.119-149, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00554283

J. Raclet, E. Badouel, A. Benveniste, B. Caillaud, and R. Passerone, Why Are Modalities Good for Interface Theories?, 2009 Ninth International Conference on Application of Concurrency to System Design, pp.119-127, 2009.
DOI : 10.1109/ACSD.2009.22
URL : https://hal.archives-ouvertes.fr/inria-00375098

R. Segala, Modelling and Verification of Randomized Distributed Real Time Systems, 1995.

W. Thomas, Languages, Automata, and Logic, 1997.
DOI : 10.1007/978-3-642-59126-6_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.8502

J. Tretmans, Model-Based Testing and Some Steps towards Test-Based Modelling, LNCS, vol.6659, pp.297-326, 2011.
DOI : 10.1007/978-3-642-21455-4_9

W. Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing, vol.21, issue.2, pp.216-227, 1992.
DOI : 10.1137/0221017

W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, vol.200, issue.1-2, 1998.
DOI : 10.1016/S0304-3975(98)00009-7