]. L. Pino, F. Bonchi, and F. Valencia, Efficient Computation of Program Equivalence for Confluent Concurrent Constraint Programming (Extended Abstract), Informal) Proceedings of the 5th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2013)

L. Pino, F. Bonchi, and F. Valencia, Efficient algorithms for program equivalence for confluent concurrent constraint programming, Science of Computer Programming, vol.111, 2015.
DOI : 10.1016/j.scico.2014.12.003
URL : https://hal.archives-ouvertes.fr/hal-01098502

L. Pino, F. Bonchi, and F. Valencia, A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice, Proceedings of the 11th International Colloquium on Theoretical Aspects of Computing, pp.351-368978, 2014.
DOI : 10.1007/978-3-319-10882-7_21
URL : https://hal.archives-ouvertes.fr/hal-01006382

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

L. Aceto, A. Ingolfsdottir, and J. Srba, The algorithmics of bisimilarity, Advanced Topics in Bisimulation and Coinduction, pp.100-172, 2011.
DOI : 10.1017/CBO9780511792588.004

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

F. Arbab and J. J. Rutten, A Coinductive Calculus of Component Connectors, 16th International Workshop on Recent Trends in Algebraic Development Techniques, 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, pp.138-152, 2011.
DOI : 10.1007/978-3-642-19805-2_10

A. Aristizábal, F. Bonchi, L. F. Pino, and F. Valencia, Reducing Weak to Strong Bisimilarity in CCP, 5th Interaction and Concurrency Experience, pp.2-16, 2012.
DOI : 10.4204/EPTCS.104.2

A. Aristizábal, F. Bonchi, F. D. Valencia, and L. F. Pino, 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

P. Baldan, A. Bracciali, and R. Bruni, A semantic framework for open processes, Theoretical Computer Science, vol.389, issue.3, pp.446-483, 2007.
DOI : 10.1016/j.tcs.2007.09.004

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, 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, 9th Asian Symposium on Programming Languages and Systems, 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.1073

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

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

R. Bruni, F. Gadducci, U. Montanari, and P. Sobocinski, Deriving Weak Bisimulation Congruences from Reduction Systems, 16th International Conference on Concurrency Theory (CON- CUR 2005), pp.293-307, 2005.
DOI : 10.1007/11539452_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.1509

R. Bruni, H. C. Melgratti, and U. Montanari, A Connector Algebra for P/T Nets Interactions, 22nd International Conference on Concurrency Theory, pp.312-326, 2011.
DOI : 10.1093/jigpal/6.2.349
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.6978

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

R. Cleaveland, J. Parrow, and B. Steffen, The concurrency workbench: a semantics-based tool for the verification of concurrent systems, ACM Transactions on Programming Languages and Systems, vol.15, issue.1, pp.36-72, 1993.
DOI : 10.1145/151646.151648

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.

]. 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
URL : http://doi.org/10.1016/s0304-3975(03)00361-x

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

J. Fernandez, An implementation of an efficient algorithm for bisimulation equivalence, Science of Computer Programming, vol.13, issue.2-3, pp.219-236, 1989.
DOI : 10.1016/0167-6423(90)90071-K

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.

G. Ferrari, S. Gnesi, U. Montanari, M. Pistore, and G. Ristori, Verifying mobile processes in the HAL environment, 10th International Conference on Computer Aided Verification, pp.511-515, 1998.
DOI : 10.1007/BFb0028772

W. Fokkink, J. Pang, and A. Wijs, Is timed branching bisimilarity a congruence indeed? Fundamenta Informaticae, pp.287-311, 2008.
DOI : 10.1007/11603009_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.9144

F. Gadducci and U. Montanari, The tile model, Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp.133-166, 2000.

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

J. Gutierrez, J. A. Pérez, C. Rueda, and F. D. Valencia, Timed Concurrent Constraint Programming for Analysing Biological Systems, Electronic Notes in Theoretical Computer Science, vol.171, issue.2, pp.117-137, 2007.
DOI : 10.1016/j.entcs.2007.05.012

R. Haemmerlé, Abstract, Theory and Practice of Logic Programming, vol.1, issue.4-5, pp.469-485, 2011.
DOI : 10.1017/S1471068411000123

O. H. Jensen, Mobile Processes in Bigraphs, 2006.

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.

S. Knight, The Epistemic View of Concurrency Theory, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00940413

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

I. Lanese, J. A. Pérez, D. Sangiorgi, and A. Schmitt, On the expressiveness and decidability of higher-order process calculi, Information and Computation, vol.209, issue.2, pp.198-226, 2011.
DOI : 10.1016/j.ic.2010.10.001
URL : https://hal.archives-ouvertes.fr/inria-00494584

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, 11th International Conference on Concurrency Theory (CONCUR 2005), pp.243-258, 2000.
DOI : 10.1007/3-540-44618-4_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9271

J. J. Leifer and R. Milner, Transition systems, link graphs and Petri nets, Mathematical Structures in Computer Science, vol.16, issue.06, pp.989-1047, 2006.
DOI : 10.1017/S0960129506005664

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, volume 92 of Lecture Notes in Computer Science, 42] R. Milner. Communication and concurrency. PHI Series in computer science, 1980.

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.

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

C. Olarte, C. Rueda, and F. D. Valencia, Models and emerging trends of concurrent constraint programming, Constraints, vol.340, issue.3, pp.535-578, 2013.
DOI : 10.1007/s10601-013-9145-3
URL : https://hal.archives-ouvertes.fr/hal-00869192

C. Olarte and F. D. Valencia, The expressivity of universal timed CCP, Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '08, pp.8-19, 2008.
DOI : 10.1145/1389449.1389452
URL : https://hal.archives-ouvertes.fr/inria-00349353

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

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

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

D. M. Park, Concurrency and automata on infinite sequences, 5th GI-Conference on Theoretical Computer Science, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

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

L. F. Pino, F. Bonchi, and F. Valencia, Efficient algorithms for program equivalence for confluent concurrent constraint programming, Science of Computer Programming, vol.111, 2015.
DOI : 10.1016/j.scico.2014.12.003
URL : https://hal.archives-ouvertes.fr/hal-01098502

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

L. F. Pino, F. Bonchi, and F. D. Valencia, Efficient computation of program equivalence for confluent concurrent constraint programming (extended abstract ), Informal proceedings of the 5th Young Researchers Workshop on Concurrency Theory (YR-CONCUR 2013), 2013.

L. F. Pino, F. Bonchi, and F. D. Valencia, A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice, 11th International Colloquium on Theoretical Aspects of Computing59] C. Rueda and F. D. Valencia. On validity in modelization of musical problems by CCP. Soft Computing, pp.351-368641, 2004.
DOI : 10.1007/978-3-319-10882-7_21
URL : https://hal.archives-ouvertes.fr/hal-01006382

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

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

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

P. Sewell, From rewrite rules to bisimulation congruences, Theoretical Computer Science, vol.274, issue.1-2, pp.183-230, 2002.
DOI : 10.1016/S0304-3975(00)00309-1
URL : http://doi.org/10.1016/s0304-3975(00)00309-1

P. Sobocinski, Representations of Petri Net Interactions, 21th International Conference on Concurrency Theory, pp.554-568, 2010.
DOI : 10.1007/978-3-642-15375-4_38

P. Sobocinski, Relational Presheaves as Labelled Transition Systems, 11th International Workshop on Coalgebraic Methods in Computer Science, pp.40-50, 2012.
DOI : 10.1007/978-3-642-32784-1_3

B. Victor and F. Moller, The mobility workbench ??? A tool for the ??-Calculus, 6th International Conference on Computer Aided Verification, pp.428-440, 1994.
DOI : 10.1007/3-540-58179-0_73

B. Victor and J. Parrow, Concurrent constraints in the fusion calculus, 25th International Colloquium on Automata, Languages and Programming, pp.455-469, 1998.
DOI : 10.1007/BFb0055075