F. Baader and T. Nipkow, Term Rewriting and all That, 1998.

G. Balbo, Introduction to Stochastic Petri Nets, Lecture Notes in Computer Science, p.84, 2001.
DOI : 10.1007/3-540-44667-2_3

G. Barthe, H. Cirstea, C. Kirchner, and L. Liquori, Pure Patterns Type Systems, Principles of Programming Languages -POPL2003, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099463

O. Bournez and F. Garnier, Proving Positive Almost-Sure Termination, Lecture Notes in Computer Science, vol.3467, pp.323-337, 2005.
DOI : 10.1007/978-3-540-32033-3_24
URL : https://hal.archives-ouvertes.fr/inria-00000522

O. Bournez and F. Garnier, Proving Positive Almost Sure Termination Under Strategies, 2006.
DOI : 10.1007/11805618_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6684

O. Bournez and C. Kirchner, Probabilistic Rewrite Strategies. Applications to ELAN, Rewriting Techniques and Applications, pp.252-266, 2002.
DOI : 10.1007/3-540-45610-4_18
URL : https://hal.archives-ouvertes.fr/inria-00100883

O. Bournez and C. Kirchner, Probabilistic Rewrite Strategies. Applications to ELAN, 13th International Conference on Rewriting Techniques and Applications -RTA'2002, pp.252-266, 2002.
DOI : 10.1007/3-540-45610-4_18
URL : https://hal.archives-ouvertes.fr/inria-00100883

H. Cirstea and C. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001.
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532

L. De-alfaro, Formal Verification of Probabilistic Systems, 1997.

M. Duflot, L. Fribourg, T. Hérault, R. Lassaigne, F. Magniette et al., Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC, Proceedings of the 4th International Workshop on Automated Verification of Critical Systems, pp.195-214, 2005.
DOI : 10.1016/j.entcs.2005.04.012

T. Frühwirth, A. D. Pierro, and H. Wiklicky, Toward probabilistic constraint handling rules, Proceedings of the third Workshop on Rule- Based Constraint Reasoning and Programming (RCoRP'01) Under the hospice of the International Conferences in Constraint Programming and Logic Programming, 2001.

H. Hansson, Time and Probability in Formal Design of Distributed Systems. Series in Real-Time Safety Critical Systems, 1994.

J. W. Klop, Term rewriting systems, Handbook of Logic in Computer Science, pp.1-117, 1992.

M. Z. Kwiatkowska, G. Norman, and J. Sproston, Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol, PAPM-PROBMIV, pp.169-187, 2002.
DOI : 10.1007/3-540-45605-8_11

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, vol.96, issue.1, pp.73-155, 1992.
DOI : 10.1016/0304-3975(92)90182-F

K. Kumar-nirman, J. Sen, G. Meseguer, and . Agha, A Rewriting Based Model for Probabilistic Distributed Object Systems, Proceedings of 6th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS'03), pp.32-46, 2003.
DOI : 10.1007/3-540-45657-0_17

M. L. Puternam, Markov Decision Processes -Discrete Stochastic Dynamic Programming Wiley series in probability and mathematical statistics, 1994.

H. William, J. F. Sanders, and . Meyer, Stochastic activity networks: Formal definitions and concepts, Lecture Notes in Computer Science, p.315, 2001.

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