M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

H. Hansson and B. Jonsson, A framework for reasoning about time and reliability, [1989] Proceedings. Real-Time Systems Symposium, pp.102-111, 1989.
DOI : 10.1109/REAL.1989.63561

W. Yi and K. G. Larsen, Testing Probabilistic and Nondeterministic Processes, Proceedings of the 12th IFIP International Symposium on Protocol Specification, Testing and Verification, pp.47-61, 1992.
DOI : 10.1016/B978-0-444-89874-6.50010-6

R. Segala, Modeling and verification of randomized distributed real-time systems, 1995.

R. Segala and N. Lynch, Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995.

H. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, [1990] Proceedings 11th Real-Time Systems Symposium, pp.278-287, 1990.
DOI : 10.1109/REAL.1990.128759

E. Bandini and R. Segala, Axiomatizations for Probabilistic Bisimulation, Proceedings of the 28th International Colloquium on Automata, Languages and Programming, pp.370-381, 2001.
DOI : 10.1007/3-540-48224-5_31

S. Andova, Probabilistic process algebra, 2002.

M. Mislove, J. Ouaknine, and J. Worrell, Axioms for Probability and Nondeterminism, Proc. of the 10th Int. Wksh. on Expressiveness in Concurrency (EXPRESS '03), pp.7-28, 2004.
DOI : 10.1016/j.entcs.2004.04.019

C. Palamidessi and O. M. Herescu, A Randomized Distributed Encoding of the ??-Calculus with Mixed Choice, Theoretical Computer Science, vol.335, issue.2-3, pp.373-404, 2005.
DOI : 10.1007/978-0-387-35608-2_44

Y. Deng, C. Palamidessi, and J. Pang, Compositional Reasoning for Probabilistic Finite-State Behaviors, Processes, Terms and Cycles: Steps on the Road to Infinity, pp.309-337, 2005.
DOI : 10.1007/11601548_17
URL : https://hal.archives-ouvertes.fr/hal-00159683

A. Sokolova and E. D. Vink, Probabilistic Automata: System Types, Parallel Composition and Comparison, Validation of Stochastic Systems: A Guide to Current Research, pp.1-43, 2004.
DOI : 10.1007/978-3-540-24611-4_1

B. Jonsson, K. G. Larsen, and W. Yi, Probabilistic extensions of process algebras, Handbook of Process Algebra, pp.685-710, 2001.

K. Chatzikokolakis and L. , Probabilistic and information-theoretic approaches to anonymity, 2007.
URL : https://hal.archives-ouvertes.fr/pastel-00003950

J. Aranda, C. D. Giusto, C. Palamidessi, and F. Valencia, Expressiveness of recursion, replication and scope mechanisms in process calculi, Postproceedings of the 5th International Symposium on Formal Methods for Components and Objects (FMCO'06)
URL : https://hal.archives-ouvertes.fr/inria-00239497

R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch et al., Task-Structured Probabilistic I/O Automata, 2006 8th International Workshop on Discrete Event Systems, 2006.
DOI : 10.1109/WODES.2006.1678432
URL : https://hal.archives-ouvertes.fr/inria-00080681

R. Canetti, L. Cheung, D. K. Kaynar, M. Liskov, N. A. Lynch et al., Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols, Proceedings of the 20th International Symposium in Distributed Computing (DISC '06), pp.238-253, 2006.
DOI : 10.1007/11864219_17

L. De-alfaro, T. A. Henzinger, and R. Jhala, Compositional Methods for Probabilistic Systems, Proceedings of the 12th International Conference on Concurrency Theory, 2001.
DOI : 10.1007/3-540-44685-0_24

G. Boudol and I. Castellani, A non-interleaving semantics for CCS based on proved transitions, Fundamenta Informaticae XI, pp.433-452, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00075636

C. Bodei, P. Degano, and C. Priami, Mobile processes with a distributed environment, Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96), pp.490-501, 1996.
DOI : 10.1007/3-540-61440-0_153

R. D. Nicola and M. C. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.1-2, pp.83-133, 1984.
DOI : 10.1016/0304-3975(84)90113-0

M. Abadi and A. D. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.1-70, 1999.
DOI : 10.1145/266420.266432

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

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

K. Chatzikokolakis, S. Knight, and P. Panangaden, Epistemic Strategies and Games on Concurrent Processes, SOFSEM, pp.153-166, 2009.
DOI : 10.1007/978-3-540-75336-0_18
URL : https://hal.archives-ouvertes.fr/inria-00637160

K. Chatzikokolakis, G. Norman, and D. Parker, Bisimulation for Demonic Schedulers, FOSSACS, pp.318-332, 2009.
DOI : 10.1007/3-540-61770-1_38