F. Arbab and J. J. Rutten, A Coinductive Calculus of Component Connectors, WADT, pp.34-55, 2002.
DOI : 10.2140/pjm.1955.5.285

A. Aristizábal, F. Bonchi, C. Palamidessi, L. Pino, and F. D. Valencia, Deriving Labels and Bisimilarity for Concurrent Constraint Programming, 14th International Conference on Foundations of Software Science and Computational Structures (FOS- SACS 2011), pp.138-152, 2011.
DOI : 10.1007/978-3-642-19805-2_10

A. Aristizábal, F. Bonchi, L. Pino, and F. D. Valencia, Partition refinement for bisimilarity in CCP, Proceedings of the 27th Annual ACM Symposium on Applied Computing, SAC '12, pp.88-93, 2012.
DOI : 10.1145/2245276.2245296

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

F. Bonchi, F. Gadducci, and G. V. Monreale, Reactive Systems, Barbed Semantics, and the Mobile Ambients, 12th International Conference on Foundations of Software Science and Computational Structures, pp.272-287, 2009.
DOI : 10.1007/978-3-540-71389-0_22

F. Bonchi, F. Gadducci, and G. V. Monreale, Towards a General Theory of Barbs, Contexts and Labels, Lecture Notes in Computer Science, vol.208, issue.10, pp.289-304, 2011.
DOI : 10.1007/978-3-540-31794-4_9
URL : https://hal.archives-ouvertes.fr/hal-00798068

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 Pi-Calculus, 17th European Symposium on Programming Languages and Systems, pp.254-268, 2008.
DOI : 10.1007/978-3-540-78739-6_20

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

R. and D. Nicola, Behavioral equivalences, Encyclopedia of Parallel Computing, pp.120-127, 2011.

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

W. Fokkink, J. Pang, and A. Wijs, Is timed branching bisimilarity a congruence indeed? Fundam, Inform, vol.87, issue.3-4, pp.287-311, 2008.

S. Knight, C. Palamidessi, P. Panangaden, and F. D. Valencia, Spatial and Epistemic Modalities in Constraint-Based Process Calculi, 23rd International Conference on Concurrency Theory, pp.317-332, 2012.
DOI : 10.1007/978-3-642-32940-1_23
URL : https://hal.archives-ouvertes.fr/hal-00761116

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, Lecture Notes in Computer Science, vol.1877, 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, Nordic Journal of Computing, vol.2, issue.2, pp.181-220, 1995.

R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

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

R. Milner and D. Sangiorgi, Barbed bisimulation, 19th International Colloquium on Automata, Languages and Programming, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

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

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

L. F. Pino, F. Bonchi, F. D. Valencia, I. /. Dga, L. et al., A behavioral congruence for concurrent constraint programming with nondeterministic choice (extended version), 2013.

L. F. Pino, F. Bonchi, and F. D. Valencia, Efficient computation of program equivalence for confluent concurrent constraint programming, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP '13, pp.263-274, 2013.
DOI : 10.1145/2505879.2505902
URL : https://hal.archives-ouvertes.fr/hal-00909394

D. Sangiorgi and D. Walker, The ?-Calculus -a theory of mobile processes, 2001.

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