F. Baader and T. Nipkow, Term rewriting and all that, 1998.

G. Balbo, Introduction to Stochastic Petri Nets, Lecture Notes in Computer Science, vol.2090, pp.84-155, 2001.
DOI : 10.1007/3-540-44667-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.1476

O. Bournez and F. Garnier, Proving Positive Almost-Sure Termination, 16th International Conference on Rewriting Techniques and Applications (RTA'2005), p.323, 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, 17th International Conference on Rewriting Techniques and Applications (RTA'2006), pp.357-371, 2006.
DOI : 10.1007/11805618_27

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

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

O. Fissore, I. Gnaedig, and H. Kirchner, Termination of rewriting with local strategies, Selected papers of the 4th International Workshop on Strategies in Automated Deduction, 2001.

O. Fissore, I. Gnaedig, and H. Kirchner, CARIBOO : An induction based proof tool for termination with strategies, Proceedings of the 4th International Conference on Principles and Practice of Declarative Programming, pp.62-73, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00107557

O. Fissore, I. Gnaedig, and H. Kirchner, Outermost Ground Termination, Proceedings of the 4th International Workshop on Rewriting Logic and Its Applications, 2002.
DOI : 10.1016/S1571-0661(05)82535-6
URL : https://hal.archives-ouvertes.fr/inria-00099654

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.

I. Gnaedig and H. Kirchner, Termination of rewriting under strategies, ACM Transactions on Computational Logic, vol.10, issue.2, 2006.
DOI : 10.1145/1462179.1462182
URL : https://hal.archives-ouvertes.fr/inria-00182432

B. Gramlich, Abstract relations between restricted termination and confluence properties of rewrite systems, Fundamenta Informaticae, vol.24, pp.3-23, 1995.

B. Gramlich, On proving termination by innermost termination, Proceedings 7th Conference on Rewriting Techniques and Applications, pp.93-107, 1996.
DOI : 10.1007/3-540-61464-8_45

G. Grimmett, Probability Theory, 1993.

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

T. Hérault, R. Lassaigne, F. Magniette, and S. Peyronnet, Approximate Probabilistic Model Checking, Verification, Model Checking, and Abstract Interpretation, 5th International Conference Proceedings, volume 2937 of Lecture Notes in Computer Science, pp.73-84, 2004.
DOI : 10.1007/978-3-540-24622-0_8

M. and K. Rao, Some characteristics of strong normalization, Theoretical Computer Science, vol.239, pp.141-164, 2000.

M. Kwiatkowska, Model checking for probability and time: from theory to practice, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.351-360, 2003.
DOI : 10.1109/LICS.2003.1210075

M. Z. Kwiatkowska, G. Norman, D. Parker, T. Field, P. G. Harrison et al., PRISM: Probabilistic Symbolic Model Checker, Computer Performance Evaluation, Modelling Techniques and Tools 12th International Conference Proceedings, volume 2324 of Lecture Notes in Computer Science, 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

A. Middeldorp and E. Hamoen, Completeness results for basic narrowing, Applicable Algebra in Engineering, Communication and Computing, vol.7, issue.1, pp.213-253, 1994.
DOI : 10.1007/BF01190830

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

A. D. Pierro and H. Wiklicky, An operational semantics for probabilistic concurrent constraint programming, Proceedings of the 1998 International Conference on Computer Languages (Cat. No.98CB36225), pp.174-183, 1998.
DOI : 10.1109/ICCL.1998.674168

A. D. Pierro and H. Wiklicky, Probabilistic concurrent constraint programming: Towards a fully abstract model, 23rd International Symposium, MFCS'98 Proceedings, volume 1450 of Lecture Notes in Computer Science, pp.446-455, 1998.
DOI : 10.1007/BFb0055794

D. Pierro and W. , A Markov model for probabilistic concurrent constraint programming, 1998 Joint Conference on Declarative Programming, pp.15-28, 1998.

D. Pierro and W. , Concurrent constraint programming, Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '00, pp.127-138, 2000.
DOI : 10.1145/351268.351284

M. S. Hart, Concurrent Probabilistic Programs, Or: How to Schedule If You Must, SIAM Journal on Computing, vol.14, issue.4, pp.991-1012, 1985.
DOI : 10.1137/0214070

A. P. Hart and M. Sharir, Termination of Probabilistic Concurrent Program, ACM Transactions on Programming Languages and Systems, vol.5, issue.3, pp.356-380, 1983.
DOI : 10.1145/2166.357214

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