S. Knight, C. Palamidessi, P. Panangaden, and F. D. Valencia, Spatial and Epistemic Modalities in Constraint-Based Process Calculi, LNCS, vol.7454, pp.2012-317, 2012.
DOI : 10.1007/978-3-642-32940-1_23
URL : https://hal.archives-ouvertes.fr/hal-00761116

V. A. Saraswat, M. 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

F. S. Boer, A. Di-pierro, and C. Palamidessi, Nondeterminism and infinite computations in constraint programming, Theoretical Computer Science, pp.37-78, 1995.

F. Fages, P. Ruet, and S. Soliman, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, pp.14-41, 2001.
DOI : 10.1006/inco.2000.3002
URL : https://hal.archives-ouvertes.fr/hal-01431358

J. Réty, Distributed concurrent constraint programming, Fundamenta Informaticae, pp.323-346, 1998.

M. Nielsen, C. Palamidessi, and F. D. Valencia, Temporal concurrent constraint programming: Denotation, logic and applications, Nord. J. Comput, vol.9, issue.1, pp.145-188, 2002.
DOI : 10.1007/3-540-45711-9_17
URL : http://www.brics.dk/%7Efvalenci/journal-ntcc.ps.gz

S. Popkorn, First steps in modal logic, 1994.

M. Ryan and P. Schobbens, Counterfactuals and updates as inverse modalities, Journal of Logic, Language and Information, pp.123-146, 1997.

S. Haar, S. Perchy, C. Rueda, and F. D. Valencia, An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic, Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP '15, pp.2015-161, 2015.
DOI : 10.1007/978-3-642-29326-9_4
URL : https://hal.archives-ouvertes.fr/hal-01256984

I. Phillips and I. Ulidowski, A Logic with Reverse Modalities for History-preserving Bisimulations, Electronic Proceedings in Theoretical Computer Science, vol.255, issue.1, pp.104-118, 2011.
DOI : 10.1007/3-540-17906-2_31

R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi, Reasoning about knowledge, 1995.

A. Pnueli and Z. Manna, The temporal logic of reactive and concurrent systems, 1992.

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460
URL : https://www.scss.tcd.ie/Matthew.Hennessy/pubs/old/HMjacm85.pdf

J. Hintikka, Knowledge and belief, 1962.

S. Vickers, Topology via logic, 1996.

M. Guzman, S. Perchy, C. Rueda, and F. Valencia, Deriving Inverse Operators for Modal Logic, Theoretical Aspects of Computing ? ICTAC 2016 of Theoretical Aspects of Computing ? ICTAC 2016, pp.214-232, 2016.
DOI : 10.1145/99583.99627
URL : https://hal.archives-ouvertes.fr/hal-01328188

S. Haar, S. Perchy, C. Rueda, and F. Valencia, An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic, Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming, PPDP '15, pp.161-172, 2015.
DOI : 10.1007/978-3-642-29326-9_4
URL : https://hal.archives-ouvertes.fr/hal-01256984

M. Guzman, S. Haar, S. Perchy, C. Rueda, and F. D. Valencia, Belief, knowledge, lies and other utterances in an algebra for space and extrusion, Journal of Logical and Algebraic Methods in Programming, vol.86, issue.1, pp.107-133, 2017.
DOI : 10.1016/j.jlamp.2016.09.001
URL : https://hal.archives-ouvertes.fr/hal-01257113

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

A. Aristizábal, F. Bonchi, C. Palamidessi, L. Pino, D. Valencia et al., Deriving Labels and Bisimilarity for Concurrent Constraint Programming, Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2011, pp.138-152, 2011.
DOI : 10.1007/BFb0055628

S. Knight, The epistemic view of concurrency theory, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00940413

D. Macnab, Modal operators on Heyting algebras, Algebra Universalis, vol.9, issue.1, pp.5-29, 1981.
DOI : 10.1007/BF02483860

R. De-nicola and G. L. Ferrari, Observational logics and concurrency models, FSTTCS'90, pp.301-315, 1990.
DOI : 10.1007/3-540-53487-3_53

R. De-nicola, U. Montanari, and F. Vaandrager, Back and forth bisimulations, CONCUR '90, pp.152-165, 1990.
DOI : 10.1007/BFb0039058

R. De-nicola and F. Vaandrager, Three logics for branching bisimulation, Journal of the ACM, vol.42, issue.2, pp.458-487, 1995.
DOI : 10.1145/201019.201032

T. Blyth and M. Janowitz, Residuation Theory, International Series of Monographs in Pure and Applied Mathematics, vol.102, 1972.

F. Gadducci, F. Santini, L. F. Pino, and F. D. Valencia, A Labelled Semantics for Soft Concurrent Constraint Programming, International Conference on Coordination Languages and Models, pp.133-149, 2015.
DOI : 10.1007/978-3-319-19282-6_9
URL : https://hal.archives-ouvertes.fr/hal-01149227

C. Palamidessi, V. 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. Cacciagrano, F. Corradini, J. Aranda, and F. Valencia, Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus, 14th International Workshop on Expressiveness in Concurrency (EXPRESS'07), pp.58-71, 2007.
DOI : 10.1016/j.entcs.2007.11.006
URL : https://hal.archives-ouvertes.fr/inria-00201502