S. Basu, T. Bultan, and M. Ouederni, Deciding Choreography Realizability, Proc. of POPL'12
DOI : 10.1145/2103656.2103680
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6722

H. Garavel, A Toolbox for the Construction and Analysis of Distributed Processes, Proc. of TACAS'11, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00189021

H. Foster, S. Uchitel, J. Magee, and J. Kramer, LTSA-WS, Proceeding of the 28th international conference on Software engineering , ICSE '06
DOI : 10.1145/1134285.1134408

M. Güdemann, G. Salaün, and M. Ouederni, Counterexample Guided Synthesis of Monitors for Realizability Enforcement, Proc. of ATVA'12
DOI : 10.1007/978-3-642-33386-6_20

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
DOI : 10.1145/2245276.2232095
URL : https://hal.archives-ouvertes.fr/hal-00685393

G. Salaün, T. Bultan, and N. Roohi, Realizability of Choreographies Using Process Algebra Encodings, IEEE T. Services Computing, vol.5, issue.3, p.2012