R. Alur, K. Etessami, and M. Yannakakis, Realizability and verification of MSC graphs, Theoretical Computer Science, vol.331, issue.1, pp.97-114, 2005.
DOI : 10.1016/j.tcs.2004.09.034

S. Basu, T. Bultan, and M. Ouederni, Deciding Choreography Realizability, Proc. of POPL'12, 2012.

T. Bultan and X. Fu, Specification of Realizable Service Conversations using Collaboration Diagrams, Service Oriented Computing and Applications, pp.27-39, 2008.

M. Carbone, K. Honda, and N. Yoshida, Structured Communication-Centred Programming for Web Services, Proc. of ESOP'07, 2007.
DOI : 10.1007/978-3-540-71316-6_2

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-Guided Abstraction Refinement, Proc. of CAV'00, 2000.

P. Crouzen and F. Lang, Smart Reduction, Proc. of FASE'11, 2011.
DOI : 10.1007/978-3-642-19811-3_9
URL : https://hal.archives-ouvertes.fr/inria-00572535

G. Decker and M. Weske, Local Enforceability in Interaction Petri Nets, Proc. of BPM'07, 2007.
DOI : 10.1007/978-3-540-75183-0_22

X. Fu, T. Bultan, and J. Su, Conversation protocols: a formalism for specification and verification of reactive electronic services, Theoretical Computer Science, vol.328, issue.1-2, pp.19-37, 2004.
DOI : 10.1016/j.tcs.2004.07.004

X. Fu, T. Bultan, and J. Su, Synchronizability of conversations among Web services, IEEE Transactions on Software Engineering, vol.31, issue.12, pp.311042-1055, 2005.
DOI : 10.1109/TSE.2005.141

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes, Proc. of TACAS'11, 2011.
DOI : 10.1007/BFb0054166
URL : https://hal.archives-ouvertes.fr/inria-00583776

H. Garavel and R. Mateescu, XTL: A Meta-Language and Tool for Temporal Logic Model-Checking, Proc. STTT'98, 1998.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

N. Lohmann and K. Wolf, Realizability Is Controllability, Proc. of WS-FM'09, 2010.
DOI : 10.1007/978-3-642-14458-5_7

R. Mateescu and D. Thivolle, A Model Checking Language for Concurrent Value-Passing Systems, Proc. of FM'08, 2008.
DOI : 10.1007/978-3-540-68237-0_12
URL : https://hal.archives-ouvertes.fr/inria-00315312

R. Milner, Communication and Concurrency. International Series in Computer Science, 1989.

P. Poizat and G. Salaün, Checking the realizability of BPMN 2.0 choreographies, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, 2012.
DOI : 10.1145/2245276.2232095
URL : https://hal.archives-ouvertes.fr/hal-00685393

Z. Qiu, X. Zhao, C. Cai, and H. Yang, Towards the theoretical foundation of choreography, Proceedings of the 16th international conference on World Wide Web , WWW '07, 2007.
DOI : 10.1145/1242572.1242704

G. Salaün and T. Bultan, Realizability of Choreographies using Process Algebra Encodings, Proc. of IFM'09, 2009.

Z. Stengel and T. Bultan, Analyzing singularity channel contracts, Proceedings of the eighteenth international symposium on Software testing and analysis, ISSTA '09, 2009.
DOI : 10.1145/1572272.1572275