Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Nathalie Bertrand
nathalie.bertrand@irisa.fr
@InProceedings{BerSch-fossacs2003,
Author = {Bertrand, N. and Schnoebelen, Ph.},
Title = {Model Checking Lossy Channels Systems Is Probably Decidable},
BookTitle = {{P}roceedings of the 6th {I}nternational {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation {S}tructures ({FoSSaCS}'03)},
editor = {Gordon, AndrewD.},
Volume = {2620},
Pages = {120--135},
Series = {Lecture Notes in Computer Science},
Publisher = {Springer},
Address = {Warsaw, Poland},
Month = {April},
Year = {2003}
}
Get EndNote Reference (.ref)