TY - CHAP

T1 - Quantitative analysis of probabilistic lossy channel systems

AU - Rabinovich, Alexander

PY - 2003

Y1 - 2003

N2 - 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) [3] 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 [5,1,4,6] have been made to study Probabilistic Lossy Channel Systems (PLCS) in which the probability of losing messages is taken into account and the following qualitative model checking problem is investigated: to verify whether a given property holds with probability one. Here we consider a more challenging problem, namely to calculate the probability by which a certain property is satisfied. Our main result is an algorithm for the following Quantitative model checking problem: Instance: A PLCS, its state s, a finite state ω-automaton A, and a rational θ > 0. Task: Find a rational r such that the probability of the set of computations that start at s and are accepted by A is between r and r + θ.

AB - 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) [3] 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 [5,1,4,6] have been made to study Probabilistic Lossy Channel Systems (PLCS) in which the probability of losing messages is taken into account and the following qualitative model checking problem is investigated: to verify whether a given property holds with probability one. Here we consider a more challenging problem, namely to calculate the probability by which a certain property is satisfied. Our main result is an algorithm for the following Quantitative model checking problem: Instance: A PLCS, its state s, a finite state ω-automaton A, and a rational θ > 0. Task: Find a rational r such that the probability of the set of computations that start at s and are accepted by A is between r and r + θ.

UR - http://www.scopus.com/inward/record.url?scp=21144458576&partnerID=8YFLogxK

U2 - 10.1007/3-540-45061-0_78

DO - 10.1007/3-540-45061-0_78

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:21144458576

SN - 3540404937

SN - 9783540404934

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1008

EP - 1021

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Baeten, Jos C. M.

A2 - Lenstra, Jan Karel

A2 - Parrow, Joachim

A2 - Woeginger, Gerhard J.

PB - Springer Verlag

ER -