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

L. Bordeaux, G. Salaün, D. Berardi, and M. Mecella, When are Two Web Services Compatible?, Proc. of TES'04, vol.3324, pp.15-28, 2004.

P. Cerný, T. A. Henzinger, and A. Radhakrishna, Simulation Distances, Proc. of CONCUR'10, vol.6269, pp.253-268, 2010.

D. Champelovier, X. Clerc, H. Garavel, Y. Guerte, F. Lang et al., Reference Manual of the LNT to LOTOS Translator, INRIA/VASY and INRIA/CONVECS, 153 pages, 2018.

F. Durán, G. Salaün, and A. Krishna, Automated Composition, Analysis and Deployment of IoT Applications, Proc. of TOOLS 2019, vol.11771, pp.252-268, 2019.

H. Garavel, F. Lang, R. Mateescu, and W. Serwe, CADP 2011: A Toolbox for the Construction and Analysis of Distributed Processes, vol.15, pp.89-107, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00715056

P. C. Kanellakis and S. A. Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence, Inf. Comput, vol.86, issue.1, pp.43-68, 1990.

A. Krishna, M. L. Pallec, R. Mateescu, L. Noirie, and G. Salaün, IoT Composer: Composition and Deployment of IoT Applications, Proc. of ICSE'19, pp.19-22, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02146569

A. Krishna, M. L. Pallec, R. Mateescu, L. Noirie, and G. Salaün, Rigorous Design and Deployment of IoT Applications, Proc. of FormaliSE'19, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02146553

R. Mateescu and D. Thivolle, A Model Checking Language for Concurrent Value-Passing Systems, Proc. of FM'08, vol.5014, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00315312

S. Melnik, H. Garcia-molina, and E. Rahm, Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching, Proc. of ICDE'02, pp.117-128, 2002.

R. Milner, Communication and Concurrency, 1989.

S. Nejati, M. Sabetzadeh, M. Chechik, S. M. Easterbrook, and P. Zave, Matching and Merging of Statecharts Specifications, Proc. of ICSE'07, pp.54-64, 2007.

M. Ouederni, U. Fahrenberg, A. Legay, and G. Salaün, Compatibility Flooding: Measuring Interaction of Services Interfaces, Proc. of SAC'17, pp.1334-1340, 2017.

M. Ouederni, G. Salaün, and E. Pimentel, Quantifying Service Compatibility: A Step beyond the Boolean Approaches, Proc. of ICSOC'10, vol.6470, pp.619-626, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00538963

M. Ouederni, G. Salaün, and E. Pimentel, Measuring the Compatibility of Service Interaction Protocols, Proc. of SAC'11, pp.1560-1567, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00650529

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM J. Comput, vol.16, issue.6, pp.973-989, 1987.

D. Romero-hernández and D. De-frutos-escrig, Defining Distances for All Process Semantics, Proc. of FMOODS/FORTE'12, vol.7273, pp.169-185, 2012.

D. Romero-hernández and D. De-frutos-escrig, Coinductive Definition of Distances between Processes: Beyond Bisimulation Distances, Proc. of FORTE'14, vol.8461, pp.249-265, 2014.

G. D. Ruvo, G. Lettieri, D. Martino, A. Santone, and G. Vaglini, k-Bisimulation: A Bisimulation for Measuring the Dissimilarity Between Processes, Proc. of FACS'15, vol.9539, pp.181-198, 2015.

G. Salaün, L. Bordeaux, and M. Schaerf, Describing and Reasoning on Web Services using Process Algebra, Proc. of ICWS'04, pp.43-50, 2004.

O. Sokolsky, S. Kannan, and I. Lee, Simulation-Based Graph Similarity, Proc. of TACAS'06, vol.3920, pp.426-440, 2006.

N. Walkinshaw and K. Bogdanov, Automated Comparison of State-Based Software Models in Terms of Their Language and Structure, ACM Trans. Softw. Eng. Methodol, vol.22, issue.2, 2013.

Z. Xing, J. Sun, Y. Liu, and J. S. Dong, Differencing Labeled Transition Systems, Proc. of ICFEM'11, vol.6991, pp.537-552, 2011.