%0 Conference Proceedings
%F BerSch-fossacs2003
%A Bertrand, N.
%A Schnoebelen, Ph.
%T Model Checking Lossy Channels Systems Is Probably Decidable
%B {P}roceedings of the 6th {I}nternational {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation {S}tructures ({FoSSaCS}'03)
%E Gordon, Andrew D.
%V 2620
%P 120-135
%S Lecture Notes in Computer Science
%I Springer
%C Warsaw, Poland
%X Lossy channel systems (LCS's) are systems of finite state automata that communicate via unreliable unbounded fifo channels. We propose a new probabilistic model for these systems, where losses of messages are seen as faults occurring with some given probability, and where the internal behavior of the system remains nondeterministic, giving rise to a reactive Markov chains semantics. We then investigate the verification of linear-time properties on this new model
%U http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BerSch-fossacs2003.pdf
%8 April
%D 2003