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
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
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Quantitative analysis of probabilistic lossy channel systems
Information and Computation
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
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Performance Evaluation
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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) [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 + θ.