HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Other publications

Termination in finite mean time of a CSMA/CA rule-based model

Olivier Bournez 1 Florent Garnier 1 Claude Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In a recent work, we introduced the notion of probabilistic rewrite system, and we proposed techniques to prove termination of such systems in finite mean time. In this paper, we model with probabilistic rewrite rules a WI-FI stations network running the CSMA/CA 802.11b protocol. Following this model and using the previously proposed framework, we prove that the protocol terminates in a finite mean time.
Document type :
Other publications
Complete list of metadata

Contributor : Florent Garnier Connect in order to contact the contributor
Submitted on : Monday, November 27, 2006 - 2:08:28 PM
Last modification on : Friday, May 13, 2022 - 10:18:05 PM


  • HAL Id : inria-00000774, version 1



Olivier Bournez, Florent Garnier, Claude Kirchner. Termination in finite mean time of a CSMA/CA rule-based model. 2006. ⟨inria-00000774⟩



Record views