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

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

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

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, 1920.
DOI : 10.1109/LICS.2009.20

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

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 (CON- CUR 2012), pp.317-332, 2012.
DOI : 10.1007/978-3-642-32940-1_23
URL : https://hal.archives-ouvertes.fr/hal-00761116

L. F. Pino, A. Aristizabal, F. Bonchi, and F. Valencia, Weak CCP bisimilarity with strong procedures, Science of Computer Programming, vol.100, 2014.
DOI : 10.1016/j.scico.2014.09.007
URL : https://hal.archives-ouvertes.fr/hal-00976768

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, pp.138-152, 2011.
DOI : 10.1007/978-3-642-19805-2_10

P. C. Kanellakis and S. A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, 2nd Annual ACM Symposium on Principles of Distributed Computing, pp.228-240, 1983.

J. Fernandez and L. Mounier, Verifying bisimulations On the Fly, 3rd International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, pp.95-110, 1990.

A. Bouali and R. De-simone, Symbolic bisimulation minimisation, 4th International Workshop Computer Aided Verification, pp.96-108, 1992.
DOI : 10.1007/3-540-56496-9_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5161

A. Dovier, C. Piazza, and A. Policriti, An efficient algorithm for computing bisimulation equivalence, Theoretical Computer Science, vol.311, issue.1-3, pp.221-256, 2004.
DOI : 10.1016/S0304-3975(03)00361-X

R. M. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous ??-calculus, 7th International Conference on Concurrency Theory, pp.147-162, 1996.
DOI : 10.1007/3-540-61604-7_53
URL : https://hal.archives-ouvertes.fr/inria-00073784

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

L. Aceto, A. Ingolfsdottir, and J. Srba, The algorithmics of bisimilarity Advanced Topics in Bisimulation and Coinduction, pp.100-172, 2011.

H. Garavel, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, Electronic Notes in Theoretical Computer Science, vol.209, pp.149-164, 2008.
DOI : 10.1016/j.entcs.2008.04.009
URL : https://hal.archives-ouvertes.fr/inria-00191141

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

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

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-7810, 1995.
DOI : 10.1016/0304-3975(95)00047-Z

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, pp.181-220, 1995.

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

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

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 and U. Montanari, Symbolic Semantics Revisited, 11th International Conference on Foundations of Software Science and Computational Structures, pp.395-412, 2008.
DOI : 10.1007/978-3-540-78499-9_28

M. Hennessy and H. Lin, Symbolic bisimulations, Theoretical Computer Science, vol.138, issue.2, pp.353-389, 1995.
DOI : 10.1016/0304-3975(94)00172-F
URL : http://doi.org/10.1016/0304-3975(94)00172-f

F. Bonchi and U. Montanari, Minimization Algorithm for Symbolic Bisimilarity, 18th European Symposium on Programming Languages and Systems, pp.267-284, 2009.
DOI : 10.1007/978-3-642-00590-9_20

M. Pistore and D. Sangiorgi, A partition refinement algorithm for the ?-calculus, Inf. Comput, vol.164, 2001.

R. Paige and R. E. Tarjan, Three Partition Refinement Algorithms, SIAM Journal on Computing, vol.16, issue.6, pp.973-989, 1987.
DOI : 10.1137/0216062

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

V. A. Saraswat, R. Jagadeesan, and V. Gupta, Foundations of timed concurrent constraint programming, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.71-80, 1994.
DOI : 10.1109/LICS.1994.316085

C. Olarte and F. D. Valencia, Universal concurrent constraint programing, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.145-150, 2008.
DOI : 10.1145/1363686.1363726
URL : https://hal.archives-ouvertes.fr/inria-00201497