?. Id, B. , ?. Id, and A. , ?(x) v y)

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

[. Abramsky, M. Dov, . Gabbay, S. Thomas, and . Maibaum, Handbook of logic in computer science): semantic structures, 1995.

S. Frank, A. D. Boer, C. Pierro, and . Palamidessi, Nondeterminism and infinite computations in constraint programming, Theoretical Computer Science, pp.37-78, 1995.

[. Blackburn, M. De-rijke, and Y. Venema, Modal logic, volume 53 of cambridge tracts in theoretical computer science, 2001.

[. Blackburn, Maarten De Rijke, and Yde Venema. Modal Logic, 2002.

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

[. Blackburn, F. Johan, F. Van-benthem, and . Wolter, Handbook of modal logic, International Conference on Computational Methods in Systems Biology, pp.257-278, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00580143

[. Caires and L. Cardelli, A Spatial Logic for Concurrency (Part II), Proceedings of the 13th International Conference of Concurrency Theory, CONCUR 2002, pp.209-225, 2002.
DOI : 10.1007/3-540-45694-5_15

[. Caires, L. Cardelli, and A. D. Gordon, A spatial logic for concurrency (part i) Information and Computation Mobile ambients, Proceedings of the First International Conference on Foundations of Software Science and Computation Structure, FoSSaCS'98, pp.194-235, 1998.

M. Edmund and . Clarke, Orna Grumberg, and Doron Peled. Model checking, 1999.

A. Chagrov and M. Zakharyaschev, Modal logic, 1997.

[. Denecke, M. Erné, L. Shelly, and . Wismath, Galois connections and applications, 2013.
DOI : 10.1007/978-1-4020-1898-5

A. Dehon, J. Giavitto, and F. Gruau, 06361 executive report?computing media languages for spaceoriented computation, Dagstuhl Seminar Proceedings

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

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

R. De, N. , and F. Vaandrager, Three logics for branching bisimulation, Journal of the ACM (JACM), vol.42, issue.2, pp.458-487, 1995.

A. Brian, . Davey, A. Hilary, and . Priestley, Introduction to lattices and order, 2002.

[. Fagin, Y. Joseph, Y. Halpern, M. Y. Moses, and . Vardi, Reasoning about knowledge, 1995.

L. Edmund and . Gettier, Is justified true belief knowledge? analysis, pp.121-123, 1963.

G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove et al., Continuous lattices and domains, 2003.
DOI : 10.1017/CBO9780511542725

S. Guzman, S. Haar, C. Perchy, . Rueda, D. Frank et al., 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

[. Goltz, R. Kuiper, and W. Penczek, Propositional temporal logics and equivalences, CONCUR'92, pp.222-236, 1992.
DOI : 10.1007/BFb0084794

[. Goldblatt, Mathematical modal logic: A view of its evolution, Journal of Applied Logic, vol.1, issue.5-6, pp.309-392, 2003.
DOI : 10.1016/S1570-8683(03)00008-9

[. Gadducci, F. Santini, F. Luis, . Pino, D. Frank et al., 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

[. Hintikka, Knowledge and belief, 1962.

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

[. 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.161-172, 2015.
DOI : 10.1007/978-3-642-29326-9_4

URL : https://hal.archives-ouvertes.fr/hal-01256984

Y. Joseph, . Halpern, A. Richard, and . Shore, Reasoning about common knowledge with infinitely many agents, Information and Computation, vol.191, issue.1, pp.1-40, 2004.

Y. Joseph, D. Halpern, E. Samet, and . Segev, Defining knowledge in terms of belief: The modal logic perspective. The Review of Symbolic Logic, pp.469-487, 2009.

[. Knight, C. Palamidessi, P. Panangaden, D. Frank, and . Valencia, Spatial and Epistemic Modalities in Constraint-Based Process Calculi, CONCUR 2012, pp.317-332, 2012.
DOI : 10.1007/978-3-642-32940-1_23

URL : https://hal.archives-ouvertes.fr/hal-00761116

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

L. Kenneth and . Mcmillan, Model checking, 2003.

[. Milner, A calculus of communicating systems, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner and D. Sangiorgi, Barbed bisimulation, Automata , Languages and Programming, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

J. C. , C. Mckinsey, and A. Tarski, The algebra of topology, Annals of mathematics, pp.141-191, 1944.

[. Olarte, C. Rueda, D. Frank, and . Valencia, Models and emerging trends of concurrent constraint programming, Constraints, vol.340, issue.3, pp.535-578, 2013.
DOI : 10.1016/j.tcs.2005.03.017

URL : https://hal.archives-ouvertes.fr/hal-00869192

[. Park, Concurrency and automata on infinite sequences. Theoretical computer science, pp.167-183, 1981.

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

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

N. Arthur and . Prior, Past, present and future, 1967.

V. Prakash-panangaden, . Saraswat, J. Philip, R. Scott, and . Seely, A hyperdoctrinal view of concurrent constraint programming, Workshop of Semantics: Foundations and Applications , REX, pp.457-476, 1993.
DOI : 10.1007/3-540-56596-5_44

I. Phillips and I. Ulidowski, A Logic with Reverse Modalities for History-preserving Bisimulations, EXPRESS'11, pp.104-118, 2011.
DOI : 10.1007/3-540-17906-2_31

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

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

S. Vickers, Topology via logic, 1996.