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)
Termination of Probabilistic Concurrent Program
ACM Transactions on Programming Languages and Systems (TOPLAS)
Measure and probability for concurrency theorists
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
On Verifying Fair Lossy Channel Systems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Undecidable Problems in Unreliable Computations
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Approximate Symbolic Model Checking of Continuous-Time Markov Chains
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Decidability of the termination problem for completely specified protocols
Distributed Computing
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
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
Simulating perfect channels with probabilistic lossy channels
Information and Computation
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
CSL model checking algorithms for QBDs
Theoretical Computer Science
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
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
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
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
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
Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems
Stochastic parity games on lossy channel systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
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.