R. 1. Alur and T. A. Henzinger, Reactive modules. Formal Methods in System Design, pp.7-48, 1999.
DOI : 10.1109/lics.1996.561320

C. Baier, B. Haverkort, H. Hermanns, and J. Katoen, Model Checking Continuous-Time Markov Chains by Transient Analysis, Proceedings of the 12th Conference on Computer Aided Verification, pp.358-372, 2000.
DOI : 10.1007/10722167_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.208

C. Baier and M. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distributed Computing, vol.11, issue.3, pp.125-155, 1998.
DOI : 10.1007/s004460050046

M. Bhargava and C. Palamidessi, Probabilistic anonymity INRIA Futurs and LIX Submitted for publication, 2005.

A. Bianco and L. De-alfaro, Model checking of probabilistic and nondeterministic systems, Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, pp.499-513, 1995.
DOI : 10.1007/3-540-60692-0_70

D. Chaum, The dining cryptographers problem: Unconditional sender and recipient untraceability, Journal of Cryptology, vol.1, issue.1, pp.65-75, 1988.
DOI : 10.1007/BF00206326

Y. Joseph, K. R. Halpern, and . Neill, Anonymity and information hiding in multiagent systems, Proc. of the 16th IEEE Computer Security Foundations Workshop, pp.75-88, 2003.

H. Hansson and B. Jonsson, A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.512-535, 1994.
DOI : 10.1007/BF01211866

M. Z. Kwiatkowska, G. Norman, and D. Parker, PRISM: Probabilistic Symbolic Model Checker, Proceedings of the 12th Conference on Computer Performance Evaluation, Modelling Techniques and Tools, pp.200-204, 2002.
DOI : 10.1007/3-540-46029-2_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.2142

K. Michael, A. D. Reiter, and . Rubin, Crowds: anonymity for Web transactions, ACM Transactions on Information and System Security, vol.1, issue.1, pp.66-92, 1998.

Y. Peter, S. Ryan, and . Schneider, Modelling and Analysis of Security Protocols, 2001.

S. Schneider and A. Sidiropoulos, CSP and anonymity, Proc. of the European Symposium on Research in Computer Security (ESORICS), pp.198-218, 1996.
DOI : 10.1007/3-540-61770-1_38

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes An extended abstract, Proceedings of CONCUR '94, pp.250-273, 1995.

P. F. Syverson, D. M. Goldschlag, and M. G. Reed, Anonymous connections and onion routing, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097), pp.44-54, 1997.
DOI : 10.1109/SECPRI.1997.601314
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.3883