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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Bertrand, N., & Schnoebelen, P. (2003). Model checking lossy channels systems is probably decidable. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2620, 120–135. https://doi.org/10.1007/3-540-36576-1_8
Mendeley helps you to discover research relevant for your work.