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://www.utdallas.edu/~htj041000/phd/Introduction_to_SPN.pdf

P. Borovansk´yborovansk´y, C. Kirchner, H. Kirchner, P. Moreau, and C. Ringeissen, An Overview of ELAN, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, vol.15, pp.55-70, 1998.

O. Bournez and F. Garnier, Proving positive almost sure termination, Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'2005), 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, Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA'2006), vol.4098, pp.357-371, 2006.
DOI : 10.1007/11805618_27

O. Bournez, F. Garnier, and C. Kirchner, Stratégies de réécriture probabilistes dans ELAN 4. HAL-INRIA Open Archive Number inria-00104091, 2004.

O. Bournez and C. Kirchner, Probabilistic rewrite strategies: Applications to ELAN, Proceedings of the 13th International Conference on Rewriting Techniques and Applications, vol.2378, pp.252-266, 2002.
DOI : 10.1007/3-540-45610-4_18

URL : https://hal.archives-ouvertes.fr/inria-00100883

M. Brand, A. Deursen, J. Heering, H. Jong, M. Jonge et al., The ASF+SDF MetaEnvironment: a Component-Based Language Development Environment, Compiler Construction (CC '01), vol.2027, pp.365-370, 2001.

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., The Maude 2.0 system, Proceedings of the 14th International Conference on Rewriting Techniques and Applications, vol.2706, pp.76-87, 2003.

, Ieee csma/ca 802.11 working group home page

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

N. Dershowitz and D. A. Plaisted, Rewriting, Handbook of Automated Reasoning, vol.I, pp.535-610
URL : https://hal.archives-ouvertes.fr/hal-01853836

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, vol.58, pp.155-188, 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, vol.71, pp.188-207, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100755

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, 2001.

K. Futatsugi and A. Nakagawa, An overview of the Cafe specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks, Proceedings of the 1st IEEE International Conference on Formal Engineering Methods, vol.170, 1997.

F. Garnier, Terminaison en temps moyen fini de systèmes de r` egles probabilistes, 2007.

I. Gnaedig, Extended version. HAL-INRIA Open Archive Number inria00147450, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00101079

I. Gnaedig and H. Kirchner, Termination of rewriting under strategies: a generic approach, Submitted. Also as HAL-INRIA Open Archive Number inria-00113156, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00113156

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, vol.1103, pp.93-107, 1996.

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, Proceedings of the 5th International Conference on Verification, Model Checking, and Abstract Interpretation, vol.2937, pp.73-84, 2004.

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

J. B. , Well-quasi ordering, the tree theorem and Vazsonyi's conjecture. Transactions of the, vol.95, pp.210-225, 1960.

N. Kumar, K. Sen, J. Meseguer, and G. Agha, A rewriting based model for probabilistic distributed object systems, Proceedings of the 6th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems, vol.2884, pp.32-46, 2003.

M. Kwiatkowska, Model checking for probability and time: From theory to practice, Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, pp.351-360, 2003.

M. Z. Kwiatkowska, G. Norman, and D. Parker, PRISM: Probabilistic symbolic model checker, Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools, vol.2324, pp.200-204, 2002.

A. Middeldorp and E. Hamoen, Completeness results for basic narrowing, Communication and Computation, vol.5, issue.3 & 4, pp.213-253, 1994.

P. Moreau, C. Ringeissen, and M. Vittek, A Pattern Matching Compiler for Multiple Target Languages, Proceedings of the 12th Conference on Compiler Construction, vol.2622, pp.61-76, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099427

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

A. D. Pierro and H. Wiklicky, A Markov model for probabilistic concurrent constraint programming, Proceedings of the 1998 Joint Conference on Declarative Programming, pp.15-28, 1998.

A. D. Pierro and H. Wiklicky, An operational semantics for probabilistic concurrent constraint programming, Proceedings of the 1998 International Conference on Computer Languages, pp.174-183, 1998.

A. D. Pierro and H. Wiklicky, Probabilistic concurrent constraint programming: Towards a fully abstract model, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, vol.1450, pp.446-455, 1998.

A. D. Pierro and H. Wiklicky, Concurrent constraint programming: Towards probabilistic abstract interpretation, Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp.127-138, 2000.

W. H. Sanders and J. F. Meyer, Stochastic activity networks: formal definitions and concepts, pp.315-343, 2002.

M. S. Sergiu and . Hart, Concurent probabilistic programs, or how to schedule if you must, SIAM Journal of Computing, vol.14, issue.4, pp.991-1012, 1985.

A. P. Hart and M. Sharir, Termination of probabilistic concurent programs, ACM Transaction on Programming Languages and System, vol.5, issue.3, pp.356-380, 1983.

T. , Term Rewriting Systems. Number 55 in Cambridge Tracts in Theoretical Computer Science, 2003.

M. Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, Proceedings of the 26th Annual Symposium on Fundations of Computer Science, pp.327-338, 1985.

E. Visser, Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description for Stratego 0.5, Proceedings of the 12th International Conference on Rewriting Techniques and Applications, vol.2051, pp.357-361, 2001.