N. Bertrand, Ph. Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Andrew D. Gordon (ed.), Lecture Notes in Computer Science, Volume 2620, Pages 120-135, Warsaw, Poland, April 2003.
Download paper:
Adobe portable document (pdf)
Copyright notice:
This 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.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
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 http://www.irisa.fr/prive/nbertran/
@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, Andrew D.},
Volume = {2620},
Pages = {120--135},
Series = {Lecture Notes in Computer Science},
Publisher = {Springer},
Address = {Warsaw, Poland},
Month = {April},
Year = {2003}
}
Get EndNote Reference (.ref)
|
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |