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.
NPLCS’s are a new model for nondeterministic channel systems where unreliable communication is modeled by probabilistic message losses. We show that, for omega-regular linear-time properties and finite-memory schedulers, qualitative model-checking is decidable. The techniques extend smoothly to questions where fairness restrictions are imposed on the schedulers. The symbolic procedure underlying our decidability proofs has been implemented and used to study a simple protocol handling two-way transfers in an unreliable setting.
Nathalie Bertrand
nathalie.bertrand@irisa.fr
@InProceedings{BBS-forte06,
Author = {Baier, C. and Bertrand, N. and Schnoebelen, Ph.},
Title = {Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness},
BookTitle = {{P}roceedings of 26th {IFIP} {WG6.1} {I}nternational {C}onference on {F}ormal {T}echniques for {N}etworked and {D}istributed {S}ystems ({FORTE}'06)},
editor = {Najm, Elie and Pradat-Peyre, Jean-Francois and Vigui\' Donzeau-Gouge, Véronique},
Volume = {4229},
Pages = {212--227},
Series = {Lecture Notes in Computer Science},
Publisher = {Springer},
Address = {Paris, France},
Month = {September},
Year = {2006}
}
Get EndNote Reference (.ref)