Handbook of theoretical computer science (vol. B)
Unreliable channels are easier to verify than perfect channels
Information and Computation
Undecidable verification problems for programs with unreliable channels
Information and Computation
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Simulating perfect channels with probabilistic lossy channels
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
A note on the attractor-property of infinite-state Markov chain
Information Processing Letters
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
Verification of probabilistic systems with faulty communication
Information and Computation
Simulating perfect channels with probabilistic lossy channels
Information and Computation
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
A note on the attractor-property of infinite-state Markov chains
Information Processing Letters
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Quantitative analysis of probabilistic lossy channel systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Stochastic games with lossy channels
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Computing the expected accumulated reward and gain for a subclass of infinite markov chains
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Stochastic parity games on lossy channel systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel systems (LCS) [AJ96b] have been proposed. In an LCS the communication channels are modelled as FIFO buffers which are unbounded, but also unreliable in the sense that they can nondeterministically lose messages. Recently, several attempts [BE99, ABIJ00] have been made to study probabilistic Lossy Channel Systems (PLCS) in which the probability of losing messages is taken into account. In this paper, we consider a variant of PLCS which is more realistic than those studied in [BE99, ABIJ00]. More precisely, we assume that during each step in the execution of the system, each message may be lost with a certain predefined probability. We show that for such systems the following model checking problem is decidable: to verify whether a given property definable by finite state ω-automata holds with probability one. We also consider other types of faulty behavior, such as corruption and duplication of messages, and insertion of new messages, and show that the decidability results extend to these models.