Skip to Main content Skip to Navigation
Conference papers

Model Checking Lossy Channels Systems Is Probably Decidable.

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Thursday, October 15, 2009 - 11:09:06 AM
Last modification on : Monday, November 29, 2021 - 7:46:02 PM


  • HAL Id : inria-00424339, version 1



Nathalie Bertrand, Philippe Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable.. 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Apr 2003, Warsaw, Poland. pp.120-135. ⟨inria-00424339⟩



Record views