A. A. Aristizabal, F. Bonchi, C. Palamidessi, L. Pino, and F. Valencia, Deriving labels and bisimilarity for concurrent constraint programming (extended version)

A. Aristizabal, F. Bonchi, C. Palamidessi, L. Pino, and F. D. Valencia, Deriving Labels and Bisimilarity for Concurrent Constraint Programming, FOSSACS, pp.138-152, 2011.
DOI : 10.1007/978-3-642-19805-2_10
URL : https://hal.archives-ouvertes.fr/hal-00546722

]. A. Abpv12a, F. Aristizabal, L. Bonchi, F. Pino, and . Valencia, Partition refinement for bisimilarity in ccp (extended version)

A. Aristizabal, 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
URL : https://hal.archives-ouvertes.fr/hal-00641408

A. Aristizabal, F. Bonchi, L. Pino, and F. D. Valencia, Reducing Weak to Strong Bisimilarity in CCP, ICE, EPTCS, 2012.
DOI : 10.4204/EPTCS.104.2
URL : https://hal.archives-ouvertes.fr/hal-00761611

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

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

A. Aristizabal, Bisimilarity in concurrent constraint programming, ICLP (Technical Communications), pp.236-240, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00546857

A. Aristizabal, Bisimilarity in concurrent constraint programming, 2nd Young Researchers Workshop on Concurrency Theory, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00546857

F. Bonchi, F. Gadducci, and G. Valentina-monreale, Reactive Systems, Barbed Semantics, and the Mobile Ambients, FOSSACS, pp.272-287, 2009.
DOI : 10.1007/978-3-540-71389-0_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.7784

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, 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

[. , G. Buscemi, and U. Montanari, Open bisimulation for the concurrent constraint pi-calculus, ESOP, pp.254-268, 2008.

[. Bonchi and U. Montanari, Minimization Algorithm for Symbolic Bisimilarity, ESOP, pp.267-284, 2009.
DOI : 10.1007/978-3-642-00590-9_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.3572

[. Bruni, H. C. Melgratti, and U. Montanari, A Connector Algebra for P/T Nets Interactions, Lecture Notes in Computer Science, vol.6, issue.2, pp.312-326, 2011.
DOI : 10.1093/jigpal/6.2.349

[. Bartoletti and R. Zunino, A calculus of contracting processes [cho08] choco Team. choco: an open source java constraint programming library, LICS, pp.332-341, 2008.

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms (3, 2009.

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

S. Frank, A. D. De-boer, C. Pierro, and . Palamidessi, Nondeterminism and infinite computations in constraint programming, Theor. Comput. Sci, vol.151, issue.1, pp.37-78, 1995.

[. 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

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

. L. Fgm-+-98-]-g, S. Ferrari, U. Gnesi, M. Montanari, G. Pistore et al., Verifying mobile processes in the hal environment, CAV, pp.511-515, 1998.

[. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi, Confluence and concurrent constraint programming, pp.140-154, 1994.
DOI : 10.1007/3-540-60043-4_76
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.2444

G. Team and . Gecode, Generic constraint development environment, 2006.

P. Di-gianantonio, F. Honsell, and M. Lenisa, RPO, Second-order Contexts, and Lambda-calculus, FoSSaCS, pp.334-349, 2008.
DOI : 10.2168/LMCS-5(3:6)2009

F. Gadducci and U. Montanari, The tile model, Proof, Language, and Interaction, pp.133-166, 2000.

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

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9756

[. 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

]. O. Jen06 and . Jensen, Mobile Processes in Bigraphs, 2006.

[. Jeong, Y. Kim, Y. Oh, and H. Kim, A faster parallel implementation of the kanellakis-smolka algorithm for bisimilarity checking, Proceedings of the International Computer Symposium, 1998.

[. Jacobs and J. Rutten, A tutorial on (co)algebras and (co)induction, EATCS Bulletin, vol.62, pp.62-222, 1997.

[. 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

[. Knight, C. Palamidessi, P. Panangaden, and F. D. Valencia, Spatial information distribution in constraintbased process calculi (extended version)

C. Paris, S. A. Kanellakis, and . Smolka, Ccs expressions, finite state processes, and three problems of equivalence, PODC, pp.228-240, 1983.

J. James, R. Leifer, and . Milner, Deriving bisimulation congruences for reactive systems, In CONCUR, pp.243-258, 2000.

[. 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

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

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

[. Montanari, M. Pistore, I. Lee, and S. Smolka, Checking bisimilarity for finitary ??-calculus, pp.42-56
DOI : 10.1007/3-540-60218-6_4

P. [. Mendler, P. J. Panangaden, R. A. Scott, and . Seely, A logical view of concurrent constraint programming

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. 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

M. Pistore and D. Sangiorgi, A partition refinement algorithm for the pi-calculus (extended abstract), CAV, pp.38-49, 1996.

[. 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

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

[. Palamidessi and F. D. Valencia, A temporal concurrent constraint programming calculus, CP, pp.302-316, 2001.

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

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

D. Sangiorgi, On the origins of bisimulation and coinduction

D. Sangiorgi, An introduction to Bisimulation and Coinduction, 2011.
DOI : 10.1017/CBO9780511777110

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

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

. Sobocinski, Representations of Petri Net Interactions, In proceedings CMCSâ 2012, pp.554-568, 2010.
DOI : 10.1007/978-3-642-15375-4_38

A. Vijay, M. C. Saraswat, and . Rinard, Concurrent constraint programming, POPL, pp.232-245, 1990.

D. Sangiorgi and J. Rutten, Advanced Topics in Bisimulation and Coinduction, 2012.
DOI : 10.1017/CBO9780511792588
URL : https://hal.archives-ouvertes.fr/hal-00907322

. A. Vijay, M. C. Saraswat, P. Rinard, and . Panangaden, Semantic foundations of concurrent constraint programming, POPL, pp.333-352, 1991.

[. 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

[. V. A89-]-v and . Saraswat, Concurrent Constraint Programming, 1989.

[. Victor and F. Moller, The mobility workbench -a tool for the pi-calculus, CAV, pp.428-440, 1994.

J. W. Wilkinson, Json spirit: A c++ json parser/generator implemented with boost spirit Available at: http://www, 2011.