Skip to Main content Skip to Navigation
Theses

Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones, et techniques de vérification automatique

Abstract : Asynchronous communication protocols are naturally seen as communicating finite automata over unbounded FIFO channels. In this thesis, we consider variants of LCS (Lossy Channel Systems) for which message tosses are probabilistic. More precisely, we introduce the models of Probabilistic LCS (PLCS), and Nondeterministic and Probabilistic LCS CNPLCS) whose semantics are respectively Markov chains and Markov decision processes. A general criterion on convergence of fixed points expressions in Well Structured Transition Systems allows to prove a number of decidability results with respect to verification of linear time properties for both models. We also prove undecidability results to show the limite of these models. A prototype tool in OCaml implements the algorithme of this thesis. Despite the high complexity of the problems, this tool allows to prove liveness properties of communication protocole such as the Alternating Bit Protocol and Pachl's protocol.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-00132080
Contributor : Ens Cachan Bibliothèque <>
Submitted on : Tuesday, February 20, 2007 - 11:23:15 AM
Last modification on : Monday, February 15, 2021 - 10:50:19 AM
Long-term archiving on: : Wednesday, April 7, 2010 - 2:50:57 AM

Identifiers

  • HAL Id : tel-00132080, version 1

Collections

Citation

Nathalie Bertrand. Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones, et techniques de vérification automatique. Génie logiciel [cs.SE]. École normale supérieure de Cachan - ENS Cachan, 2006. Français. ⟨tel-00132080⟩

Share

Metrics

Record views

250

Files downloads

268