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

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

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

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-51510, 1007.
DOI : 10.1007/BFb0028772

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.

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

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

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

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

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

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

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

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

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

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

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

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

R. Bruni, F. Gadducci, U. Montanari, and P. Sobocinski, Deriving Weak Bisimulation Congruences from Reduction Systems, 16th International Conference on Concurrency Theory (CONCUR 2005), pp.293-30710, 1007.
DOI : 10.1007/11539452_24

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

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

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

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, 11th International Conference on Concurrency Theory, pp.243-258, 2000.
DOI : 10.1007/3-540-44618-4_19

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

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.

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

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

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