Skip to Main content Skip to Navigation

Terminaison en temps moyen fini de systèmes de règles probabilistes

Florent Garnier 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this thesis we define a new formalism that allows to model transition systems where transitions can be either probabilistic or non deterministic. We choose to extend the rewriting formalism because it allows to simply express non-deterministic behavior. Latter, we study the termination of such systems and we give some criteria that imply the termination within a finite mean number of rewrite steps. We also study the termination of such systems when the firing of probabilistic rules are controlled by strategies. In this document, we use our techniques to model the WIFI protocol and show that a pool of stations successfully emits all its messages within a finite mean time.
Document type :
Complete list of metadata

Cited literature [48 references]  Display  Hide  Download
Contributor : Florent Garnier <>
Submitted on : Monday, November 12, 2007 - 12:22:27 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM
Long-term archiving on: : Monday, April 12, 2010 - 1:55:49 AM


  • HAL Id : tel-01752898, version 2


Florent Garnier. Terminaison en temps moyen fini de systèmes de règles probabilistes. Modélisation et simulation. Institut National Polytechnique de Lorraine - INPL, 2007. Français. ⟨NNT : 2007INPL055N⟩. ⟨tel-01752898v2⟩



Record views


Files downloads