%0 Conference Proceedings
%F BerSch-avis2004
%A Bertrand, N.
%A Schnoebelen, Ph.
%T Verifying Nondeterministic Channel Systems With Probabilistic Message Losses
%B {P}roceedings of the 3rd {I}nternational {W}orkshop on {A}utomated {V}erification of {I}nfinite-{S}tate {S}ystems ({AVIS}'04)
%E Bharadwaj, Ramesh
%C Barcelona, Spain
%X Lossy channel systems (LCS's) are systems of finite state automata that communicate via unreliable unbounded fifo channels. In order to circumvent the undecidability of model checking for nondeterministic LCS's, probabilistic models have been introduced, where it can be decided whether a linear-time property holds almost surely. However, such fully probabilistic systems are not a faithful model of nondeterministic protocols. We study a hybrid model for LCS's where losses of messages are seen as faults occurring with some given probability, and where the internal behavior of the system remains nondeterministic. Thus the semantics is in terms of infinite-state reactive Markov chains (equivalently, Markovian decision processes). A similar model was introduced in the second part of our FOSSACS'03 article: we continue this work and give a complete picture of the decidability of qualitative model checking for MSO-definable properties and some relevant subcases
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-avis04.pdf
%8 April
%D 2004