%O Thesis 
%9 PhdThesis 
%F THESE-bertrand06
%A Bertrand, N.
%T Mod{è}les stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de v{é}rification automatique
%I Laboratoire Sp{é}cification et V{é}rification, ENS Cachan, France
%X 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 losses are probabilistic. More precisely, we introduce the models of Probabilistic LCS (PLCS), and Nondeterministic and Probabilistic LCS (NPLCS) 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 a decidability results with respect to verification of linear-time properties for both models. We also prove undecidability results to show the limits of these models. A prototype tool in OCaml implements the algorithms of this thesis. Despite the high complexity of the problems, this tool allows to prove liveness properties of commmunication protocols such as the Alternating Bit Protocol and Pachl's protocol
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-bertrand.pdf
%8 September
%D 2006