A. Aldini, Probabilistic Information Flow in a Process Algebra, the Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), pp.152-168, 2001.
DOI : 10.1007/3-540-44685-0_11

C. Baier, B. Engelen, and M. E. Majster-cederbaum, Deciding Bisimilarity and Similarity for Probabilistic Processes, Journal of Computer and System Sciences, vol.60, issue.1, pp.187-231, 2000.
DOI : 10.1006/jcss.1999.1683
URL : http://doi.org/10.1006/jcss.1999.1683

M. Bhargava and C. Palamidessi, Probabilistic Anonymity, the Proceedings of 16th International Conference on Concurrency Theory (CONCUR'05), pp.171-185, 2005.
DOI : 10.1007/11539452_16
URL : https://hal.archives-ouvertes.fr/inria-00201101

M. Boreale and R. D. Nicola, A symbolic semantics for the ?-calculus. Information and Computation, pp.34-52, 1996.

A. Bossi, R. Focardi, C. Piazza, and S. Rossi, Bisimulation and Unwinding for Verifying Possibilistic Security Properties, the Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'03), pp.223-237, 2003.
DOI : 10.1007/3-540-36384-X_19

S. Cattani and R. Segala, Decision Algorithms for Probabilistic Bisimulation*, the Proceedings of the 13th International Conference on Concurrency Theory (CONCUR'02), pp.371-385, 2002.
DOI : 10.1007/3-540-45694-5_25

K. Chatzikokolakis and C. Palamidessi, A framework to analyze probabilistic protocols and its application to the partial secrets exchange, the Proceedings of International Symposium on Trustworthy Global Computing (TGC'05), 2005.

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

T. Chothia, S. Orzan, J. Pang, and M. T. Dashti, A framework for automatically checking anonymity with mcrl, the Proceedings of the 2nd Symposium on Trustworthy Global Computing (TGC'06), 2006.

Y. Deng, T. Chothia, C. Palamidessi, and J. Pang, Metrics for Action-labelled Quantitative Transition Systems, Electronic Notes in Theoretical Computer Science, vol.153, issue.2, pp.79-96, 2006.
DOI : 10.1016/j.entcs.2005.10.033
URL : https://hal.archives-ouvertes.fr/hal-00159689

Y. Deng and C. Palamidessi, Axiomatizations for probabilistic finite-state behaviors, the Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures (FOS- SACS'05), pp.110-124, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00159682

R. J. Glabbeek, S. A. Smolka, and B. Steffen, Reactive, generative, and stratified models of probabilistic processes, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.59-80, 1995.
DOI : 10.1109/LICS.1990.113740

M. Hennessy and H. Lin, Symbolic bisimulations, Theoretical Computer Science, vol.138, issue.2, pp.353-389, 1995.
DOI : 10.1016/0304-3975(94)00172-F

O. M. Herescu and C. Palamidessi, Probabilistic Asynchronous ??-Calculus, the Proceedings of 3rd International Conference on Foundations of Software Science and Computation Structures (FOSSACS'00), pp.146-160, 2000.
DOI : 10.1007/3-540-46432-8_10

R. Lanotte, A. Maggiolo-schettini, and A. Troina, Weak bisimulation for probabilistic timed automata and applications to security, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings., p.34, 2003.
DOI : 10.1109/SEFM.2003.1236205

H. Lin, Symbolic bisimulation and proof systems for the ?-calculus, 1994.

H. Lin, Unique fixpoint induction for mobile processes, the Proceedings of 6th International Conference on Concurrency Theory (CONCUR'95), pp.88-102, 1995.
DOI : 10.1007/3-540-60218-6_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.4067

H. Lin, Computing bisimulations for finite-control ??-calculus, Journal of Computer Science and Technology, vol.126, issue.1, pp.1-9, 2000.
DOI : 10.1007/BF02951922

H. Lin, Complete inference systems for weak bisimulation equivalences in the ?-calculus. Information and Computation, pp.1-29, 2003.

R. Milner, Communicating and Mobile Systems: the ?-Calculus, 1999.

A. Philippou, I. Lee, and O. Sokolsky, Weak Bisimulation for Probabilistic Systems, the Proceedings of the 11th International Conference on Concurrency Theory (CONCUR'00), pp.334-349, 2000.
DOI : 10.1007/3-540-44618-4_25

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995.
DOI : 10.1007/bfb0015027
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430

A. Sokolova and E. P. De-vink, Probabilistic Automata: System Types, Parallel Composition and Comparison, Validation of Stochastic Systems, pp.1-43, 2004.
DOI : 10.1007/978-3-540-24611-4_1