Model Checking Lossy Channels Systems Is Probably Decidable. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

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.
No file

Dates and versions

inria-00424339 , version 1 (15-10-2009)

Identifiers

  • HAL Id : inria-00424339 , version 1

Cite

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⟩
26 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More