. Proof, from Lemma 10.2.2 instantiated to 2 x = [+] a , we obtain that {? | [+] a ? ? [?]} ? {¬? } is consistent. But this is impossible because, from the hypothesis (2) implies (1) Suppose that Now (AB2) guarantees that ?? a ? ? ?. In any normal modal logic we have that (2? ? 3) ? 3?. We use this with the previous formula and we obtain ([?] a ? ? ?? a ) ? ?. Note that ?? a ? ? because otherwise [?] a ? ? ? and, from the hypothesis we obtain that ? ? [?] -impossible. Now, if we prove that, Suppose that Now note that [?] a ? ? [? ] implies, using Lemma 10.2.2 instantiated with 2 x = [?] a , that {? | 10.2. Soundness and Completeness We now need to establish the analogous results for the starred modalities . In what follows

+. , ?. Iff-there-exists-?-?-?-?-such-that, ?. ?. , and ?. , [?] * ? ? ? iff for any ? ? ? ? such that ? ? ? * ?, ? ? ? ; 14.2. Games, Valid Positions and Strategies Definition 14.1.1 (Deterministically Labelled). A probabilistic process P is deterministically labelled if the following conditions hold: Bibliography [AG99] Martín Abadi and Andrew D. Gordon. A calculus for cryptographic protocols: The spi calculus, Inf. Comput, vol.3, issue.1481, pp.1-70, 1999.

]. S. Aj94a, R. Abramsky, and . Jagadeesan, Games and full completeness for multiplicative linear logic, J. Symbolic Logic, vol.59, issue.2, pp.543-574, 1994.

]. S. Aj94b, A. Abramsky, and . Jung, Domain theory, AJM00] S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, pp.409-470, 1994.

[. Blackburn, Maarten de Rijke, and Yde Venema. Modal Logic. Number 53 in Cambridge Tracts in Theoretical Computer Science, 2001.

[. 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, 2009.
DOI : 10.1109/LICS.2009.20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4336

[. , G. Buscemi, and U. Montanari, Cc-pi: A constraint-based language for specifying service level agreements, ESOP, pp.18-32, 2007.

[. Bibliography, R. Berry, D. N. Milner, and . Turner, A semantics for ml concurrency primitives, Proceedings Of The 19th Annual ACM Symposium On Principles Of Programming Languages, pp.119-129, 1992.

[. Bhargava and C. Palamidessi, Probabilistic Anonymity, Proc. of CONCUR, pp.171-185, 2005.
DOI : 10.1007/11539452_16
URL : https://hal.archives-ouvertes.fr/inria-00201101

[. Caires and L. Cardelli, A spatial logic for concurrency (part i) Information and Computation, pp.194-235, 2003.

[. Chadha, S. Delaune, and S. Kremer, Epistemic Logic for the Applied Pi Calculus, Proceedings of IFIP International Conference on Formal Techniques for Distributed Systems, pp.182-197, 2009.
DOI : 10.1016/j.entcs.2006.08.026

[. Cardelli and A. D. Gordon, Mobile ambients, Theoretical Computer Science, vol.240, issue.1, pp.177-213, 2000.
DOI : 10.1016/S0304-3975(99)00231-5
URL : http://doi.org/10.1016/s0304-3975(99)00231-5

[. Chatzikokolakis, S. Knight, C. Palamidessi, and P. Panangaden, Epistemic strategies and games on concurrent processes, ACM Trans. Comput. Log, vol.13, issue.4, pp.28-2012
DOI : 10.1007/978-3-540-95891-8_17
URL : https://hal.archives-ouvertes.fr/inria-00637160

[. Chatzikokolakis and C. Palamidessi, Making Random Choices Invisible to the Scheduler, International Conference on Concurrency Theory, CONCUR, pp.42-58694, 2007.
DOI : 10.1007/978-3-540-74407-8_4
URL : https://hal.archives-ouvertes.fr/inria-00424860

[. Chatzikokolakis, C. Palamidessi, and P. Panangaden, Anonymity protocols as noisy channels, Information and Computation, vol.206, issue.2-4, pp.378-401, 2008.
DOI : 10.1016/j.ic.2007.07.003
URL : https://hal.archives-ouvertes.fr/inria-00349225

]. Den74, . Jackb, and . Dennis, First version of a data flow procedure language, Programming Symposium, pp.362-376

V. Danos and R. Harmer, The Anatomy of Innocence, Lecture Notes in Computer Science, vol.2142, pp.188-202, 2001.
DOI : 10.1007/3-540-44802-0_14

M. [. Deschesne, S. Mousavi, and . Orzan, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning: LPAR'07 Lecture Notes in Computer Science, pp.226-241, 2007.
DOI : 10.1007/978-3-540-75560-9_18

[. 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. [. Fagin, Y. Halpern, M. Y. Moses, and . Vardi, Reasoning About Knowledge, 1995.

[. Bibliography, R. Fischer, and . Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, 1979.

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

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

]. J. Hin62 and . Hintikka, Knowledge and Belief, 1962.

[. Hennessy and R. Milner, On observing nondeterminism and concurrency, Lecture Notes in Computer Science, vol.85, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

Y. [. Halpern and . Moses, Knowledge and common knowledge in a distributed environment, Proceedings of the Third A.C.M. Symposium on Principles of Distributed Computing, pp.50-61, 1984.

R. [. Hennessy and . Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-162, 1985.
DOI : 10.1145/2455.2460

Y. [. Halpern and . Moses, Knowledge and common knowledge in a distributed environment, Journal of the ACM, vol.37, issue.3, pp.549-587, 1990.
DOI : 10.1145/79147.79161

J. Y. Halpern, Y. Moses, and M. R. Tuttle, A knowledge-based analysis of zero knowledge, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.132-147, 1988.
DOI : 10.1145/62212.62224

C. [. Hyland and . Ong, On full abstraction for pcf: I. models, observables and the full abstraction problem, ii. dialogue games and innocent strategies, iii. a fully abstract and universal game model. Information and Computation, pp.285-408, 2000.

D. Hughes and V. Shmatikov, Information hiding, anonymity and privacy: a modular approach, Journal of Computer Security, vol.12, issue.1, pp.3-36, 2004.
DOI : 10.3233/JCS-2004-12102

Y. Joseph, M. R. Halpern, and . Tuttle, Knowledge, probability and adversaries, Proceedings Of The Eighth Annual ACM Symposium On Principles of Distributed Computing, pp.103-118, 1989.

P. Johnstone, Sketches of an Elephant: A Topos Theory Compendium I,II. Number 43,44 in Oxford Logic Guides, 2002.

[. Knight, R. Mardare, and P. Panangaden, Combining Epistemic Logic and Hennessy-Milner Logic, Logic and Program Semantics, pp.219-243, 2012.
DOI : 10.1007/978-3-642-29485-3_14
URL : https://hal.archives-ouvertes.fr/hal-00760967

[. Krasucki, G. Ndjatou, and R. Parikh, Probabilistic knowledge and probabilistic common knowledge, ISMIS 90, pp.1-8, 1990.

[. Bibliography, C. Knight, P. Palamidessi, F. D. Panangaden, and . Valencia, Spatial and epistemic modalities in constraint-based process calculi, Lecture Notes in Computer Science, vol.7454, pp.317-332, 2012.

]. S. Kri63 and . Kripke, Semantical analysis of modal logic, Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, pp.67-96, 1963.

[. Lynch, Distributed Algorithms, 1996.

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

L. S. Moss, Coalgebraic logic, Annals of Pure and Applied Logic, vol.96, issue.1-3, pp.277-317, 1999.
DOI : 10.1016/S0168-0072(98)00042-6
URL : http://doi.org/10.1016/s0168-0072(98)00042-6

P. [. Mendler, P. J. Panangaden, R. A. Scott, and . Seely, A logical view of concurrent constraint programming, Nordic Journal of Computing, vol.2, pp.182-221, 1995.

J. [. Milner, D. Parrow, and . Walker, A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.1-77, 1992.
DOI : 10.1016/0890-5401(92)90009-5

A. [. Mckinsey and . Tarski, The Algebra of Topology, The Annals of Mathematics, vol.45, issue.1, 1944.
DOI : 10.2307/1969080

[. Mohalik and I. Walukiewicz, Distributed Games, Paritosh Pandya and Jaikumar Radhakrishnan FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, pp.338-351, 2003.
DOI : 10.1007/978-3-540-24597-1_29

. [. Bibliography, S. Neiger, and . Toueg, Substituting for real time and common knowledge in asynchronous distributed systems, Proceedings of the Sixth A.C.M. Symposium on Principles of Distributed Computing, pp.281-293, 1987.

G. Neiger and M. R. Tuttle, Common knowledge and consistent simultaneous coordination, Proceedings of the Fourth International Workshop on Distributed Algorithms, pp.334-352, 1990.
DOI : 10.1007/3-540-54099-7_23

C. Adam and P. , Fundamentals of a theory of asynchronous information flow, Proc. of IFIP Congress 62, pp.386-390, 1963.

]. A. Pnu77 and . Pnueli, The temporal logic of programs, The Eighteenth Annual IEEE Symposium on Foundations of Computer Science, pp.46-57, 1977.

S. Popkorn, First Steps in Modal Logic, 1994.

]. V. Pra76 and . Pratt, Semantical considerations on floyd-hoare logic, Proceedings of the Seventeenth Annual IEEE Symposium on Computer Science, pp.109-121, 1976.

E. Pacuit and S. Simon, Reasoning with protocols under imperfect information. The Review of Symbolic Logic, pp.412-444, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00644259

V. [. Panangaden, P. J. Saraswat, R. A. Scott, and . Seely, A hyperdoctrinal view of concurrent constraint programming
DOI : 10.1007/3-540-56596-5_44

K. E. Taylor, Concurrent common knowledge, Semantics: Foundations and Applications; Proceedings of REX Workshop, number 666 in Lecture Notes In Computer Science Proceedings of the Seventh Annual ACM Symposium on Principles f Distributed Computing, pp.457-476, 1988.

J. Réty, Distributed concurrent constraint programming, Fundam. Inform, 1998.

A. Vijay and . Saraswat, Concurrent Constraint Programming Languages, 1989.

A. Vijay and . Saraswat, Concurrent constraint programming ACM Doctoral dissertation awards, 1993.

]. D. Sco82 and . Scott, Domains for denotational semantics, Ninth International Colloquium On Automata Languages And Programming, 1982.

C. Shannon, A Mathematical Theory of Communication, Bell System Technical Journal, vol.27, issue.3, pp.379-423623, 1948.
DOI : 10.1002/j.1538-7305.1948.tb01338.x

R. [. Saraswat, V. Jagadeesan, and . 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

R. [. Saraswat, P. Jagadeesan, M. Panangaden, and . Rinard, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, pp.385-427, 1991.
DOI : 10.1145/99583.99627

. A. Bibliography-[-srp91-]-v, M. Saraswat, P. Rinard, and . Panangaden, Semantic foundations of concurrent constraint programming, Proceedings of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991.

S. Schneider and A. Sidiropoulos, CSP and anonymity, Proc. of ESORICS, pp.198-218, 1996.
DOI : 10.1007/3-540-61770-1_38

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

A. M. Turing, Computability and ??-definability, The Journal of Symbolic Logic, vol.42, issue.04, pp.153-163, 1937.
DOI : 10.2307/2371045

. Hans-van-ditmarsch, B. Wiebe-van-der-hoek, and . Kooi, Dynamic Epistemic Logic. Number 337 in Synthese Library, 2008.

]. G. Wright, An essay in modal logic. Studies in logic and the foundations of mathemathics, 1951.