H. Garavel and F. Lang, NTIF: A General Symbolic Model for Communicating Sequential Processes with Data, Proceedings of FORTE'02 (Houston), 2002.
DOI : 10.1007/3-540-36135-9_18
URL : https://hal.archives-ouvertes.fr/inria-00071919

A. Arnold, Finite transition systems. Semantics of communicating sytems, 1994.

T. Barros and E. Madelaine, Formalisation and proofs of the chilean electronic invoices system, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00087210

R. Boulifa and E. Madelaine, Model Generation for Distributed Java Programs, Workshop on scientiFic engIneering of Distributed Java applIcations, 2003.
DOI : 10.1007/978-3-540-24639-8_13

J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, S. Laubach et al., Bandera, Proceedings of the 22nd international conference on Software engineering , ICSE '00, 2000.
DOI : 10.1145/337180.337234

R. Cleaveland and J. Riely, Testing-based abstractions for value-passing systems, International Conference on Concurrency Theory, pp.417-432, 1994.
DOI : 10.1007/978-3-540-48654-1_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.7439

R. Milner, Communication and Concurrency, 1989.

A. Lakas, Les Transformations Lotomaton : une contribution à la pré-implémentation des systèmes Lotos, 1996.

H. Lin, Symbolic transition graph with assignment, CONCUR '96, 1996.
DOI : 10.1007/3-540-61604-7_47

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, Information and Computation, vol.100, 1992.

A. Bouali, A. Ressouche, V. Roy, and R. De-simone, The fc2tools set, Computer Aided Verification (CAV'94), 1994.

D. Caromel, W. Klauser, and J. Vayssière, Towards seamless computing and metacomputing in Java, Concurrency: Practice and Experience, vol.10, issue.11-13, pp.1043-1061, 1998.
DOI : 10.1002/(SICI)1096-9128(199809/11)10:11/13<1043::AID-CPE413>3.0.CO;2-6