M. Abadi and L. Lamport, The existence of refinement mappings, Theor. Comput. Sci, vol.82, issue.2, pp.253-284, 1991.

J. Abrial, Modeling in Event-B: System and Software Engineering, 2010.

A. Athalye, CoqIOA: A formalization of IO automata in the Coq proof assistant, vol.1019, pp.1-53, 1995.

G. Babin, Y. Ait-ameur, and M. Pantel, Correct instantiation of a system reconfiguration pattern: a proof and refinement-based approach, Proceedings of HASE 2016, pp.31-38, 2016.

S. Basu, T. Bultan, and M. Ouederni, Deciding choreography realizability, Proceedings of POPL 2012, pp.191-202, 2012.

S. Benyagoub, M. Ouederni, and Y. Ait-ameur, Towards correct evolution of conversation protocols, Proceedings of VECOS 2016. CEUR Workshop Proceedings, vol.1689, pp.193-201, 2016.

S. Benyagoub, M. Ouederni, N. K. Singh, and Y. Ait-ameur, Correct-by-construction evolution of realisable conversation protocols, MEDI 2016, vol.9893, pp.260-273, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02353832

D. Brand and P. Zafiropulo, On communicating finite-state machines, J. ACM, vol.30, issue.2, pp.323-342, 1983.

T. Bultan, Modeling interactions of web software, Proceedings of IEEE WWV, pp.45-52, 2006.

M. Carbone, K. Honda, and N. Yoshida, Structured communication-centred programming for web services, ESOP 2007, vol.4421, pp.2-17, 2007.

E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement, CAV 2000, vol.1855, p.15, 2000.

G. Decker and M. Weske, Local enforceability in interaction petri nets, BPM 2007, vol.4714, pp.305-319

, , 2007.

Z. Farah, Y. Ait-ameur, M. Ouederni, and K. Tari, A correct-by-construction model for asynchronously communicating systems, Int. J. STTT, vol.19, pp.1-21, 2016.

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

J. Bendisposto, J. Clark, I. Dobrikov, P. Karner, S. Krings et al., Prob 2.0 tutorial, Proceedings of of 4th Rodin User and Developer Workshop, 2013.

R. Milner, Communication and Concurrency, 1989.

O. Müller, T. Nipkow, E. Brinksma, W. R. Cleaveland, K. G. Larsen et al., Combining model checking and deduction for I/Oautomata, TACAS 1995, vol.1019, pp.1-16, 1995.

, OMG: Business Process Model and Notation (BPMN) -Version, 2011.

Z. Qiu, X. Zhao, C. Cai, and H. Yang, Towards the theoretical foundation of choreography, Project RODIN: Rigorous open development environment for complex systems, 2004.

G. Salaün and T. Bultan, Realizability of choreographies using process algebra encodings, IFM 2009, vol.5423, pp.167-182, 2009.