S. Abramsky and A. Jung, Domain theory, Handbook of Logic in Computer Science, pp.1-168, 1994.

R. M. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous picalculus, Proc. of CONCUR, pp.147-162, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073784

M. Bartoletti and R. Zunino, A Calculus of Contracting Processes, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.332-341, 2010.
DOI : 10.1109/LICS.2010.25

J. Bengtson, M. Johansson, J. Parrow, and B. Victor, Psi-calculi: Mobile Processes, Nominal Data, and Logic, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.39-48, 2009.
DOI : 10.1109/LICS.2009.20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4336

F. Bonchi, F. Gadducci, and G. V. Monreale, Reactive Systems, Barbed Semantics, and the Mobile Ambients, FOSSACS, pp.272-287, 2009.
DOI : 10.1007/978-3-540-71389-0_22

F. Bonchi, B. König, and U. Montanari, Saturated Semantics for Reactive Systems, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.69-80, 2006.
DOI : 10.1109/LICS.2006.46

M. G. Buscemi and U. Montanari, Open bisimulation for the concurrent constraint picalculus, ESOP, pp.254-268, 2008.

C. C. Chang, H. J. Chang, and H. J. Keisler, Model theory, 1973.

F. S. De-boer, A. D. Pierro, and C. Palamidessi, Nondeterminism and infinite computations in constraint programming, Theoretical Computer Science, vol.151, issue.1, pp.37-78, 1995.
DOI : 10.1016/0304-3975(95)00047-Z

H. Ehrig and B. König, Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting, FoSSaCS, pp.151-166, 2004.
DOI : 10.1007/978-3-540-24727-2_12

M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi, Confluence in concurrent constraint programming, Theoretical Computer Science, vol.183, issue.2, pp.281-315, 1997.
DOI : 10.1016/S0304-3975(97)00328-9

P. D. Gianantonio, F. Honsell, and M. Lenisa, Rpo, second-order contexts, and lambdacalculus, FoSSaCS, pp.334-349, 2008.

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.151, issue.2, pp.437-486, 1995.
DOI : 10.1016/0304-3975(95)00074-7

M. Johansson, J. Bengtson, J. Parrow, and B. Victor, Weak Equivalences in Psi-Calculi, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.322-331, 2010.
DOI : 10.1109/LICS.2010.30

M. Johansson, B. Victor, and J. Parrow, A Fully Abstract Symbolic Semantics for Psi-Calculi, Electronic Proceedings in Theoretical Computer Science, vol.18, 1002.
DOI : 10.4204/EPTCS.18.2

J. M. Henkin and A. Tarski, Cylindric Algebras (Part I), 1971.

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, In CON- CUR, pp.243-258, 2000.
DOI : 10.1007/3-540-44618-4_19

N. P. Mendler, P. Panangaden, P. J. Scott, and R. A. Seely, A logical view of concurrent constraint programming, Nord. J. Comput, vol.2, issue.2, pp.181-220, 1995.

R. Milner, Communicating and mobile systems: the ?-calculus, 1999.

R. Milner and D. Sangiorgi, Barbed bisimulation, ICALP, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

U. Montanari and V. Sassone, Dynamic congruence vs. progressing bisimulation for ccs, FI, vol.16, issue.1, pp.171-199, 1992.

C. Palamidessi, V. A. Saraswat, F. D. Valencia, and B. Victor, On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.59-68, 2006.
DOI : 10.1109/LICS.2006.39
URL : https://hal.archives-ouvertes.fr/inria-00201096

J. Rathke, V. Sassone, and P. Soboci´nskisoboci´nski, Semantic Barbs and Biorthogonality, Proceedings of FoSSaCS'07, pp.302-316, 2007.
DOI : 10.1007/978-3-540-71389-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.5896

J. Rathke and P. Sobocinski, Deconstructing behavioural theories of mobility, IFIP TCS, pp.507-520, 2008.
DOI : 10.1007/978-0-387-09680-3_34

V. A. Saraswat and M. C. Rinard, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, pp.232-245, 1990.
DOI : 10.1145/96709.96733

V. A. Saraswat, M. C. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.333-352, 1991.
DOI : 10.1145/99583.99627

V. Sassone and P. Sobocinski, Reactive Systems over Cospans, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.311-320, 2005.
DOI : 10.1109/LICS.2005.40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.4903

P. Sewell, From rewrite to bisimulation congruences, Proc. of CONCUR '98, pp.269-284, 1998.
DOI : 10.1007/BFb0055628

V. A. Saraswat, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1989.
DOI : 10.1145/96709.96733

A. Villanueva, Model Checking for the Concurrent Constraint Paradigm, 2003.