Handbook of theoretical computer science (vol. B)
The complexity of probabilistic verification
Journal of the ACM (JACM)
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)
Well-structured transition systems everywhere!
Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of probabilistic systems with faulty communication
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
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
Sliding Window Abstraction for Infinite Markov Chains
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| 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) 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 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 @w-automaton A, and a rational @q0. 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+@q. N. Bertrand, Ph. Schnoebelen, Model checking lossy channels systems is probably decidable, in: FOSSACS'03, Lecture Notes in Computer Science, vol. 2620, Springer, Berlin, 2003, pp. 120-135.] 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 @w-automaton A, and a rational @q0. 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+@q.