Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Probability
Information and Computation
Reasoning about infinite computations
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Unreliable channels are easier to verify than perfect channels
Information and Computation
Axiomatizing probabilistic processes: ACP with generative probabilities
Information and Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
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)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Distributed Algorithms
An Improved Search Strategy for Lossy Channel Systems
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Verification of Probabilistic Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Reasonong about Safety and Liveness Properties for Probabilistic Processes
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Algorithms for Verification of Equivalences for Probabilistic Processes
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Probabilistic temporal logics for finite and bounded models
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
"Almost always" and "sometime definitely" are not enough: Probabilistic quanifiers and probabilistic model-checking
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Decidability of the termination problem for completely specified protocols
Distributed Computing
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Verifying temporal properties of finite-state probabilistic programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Model checking lossy vector addition systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
Branching-time model-checking of probabilistic pushdown automata
Journal of Computer and System Sciences
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |
Lossy channel systems (LCSs) are models for communicating systems where the subprocesses are linked via unbounded FIFO channels which might lose messages. Link protocols, such as the Alternating Bit Protocol and HDLC can be modelled with these systems. The decidability of several verification problems of LCSs has been investigated by Abdulla & Jonsson [AJ93, AJ94], e.g. they have shown that the reachability problem for LCSs is decidable while LTL model checking is not. In this paper, we consider probabilistic LCSs (which are LCSs where the transitions are augmented with appropriate probabilities) as introduced by [IN97] and show that the question of whether or not a linear time property holds with probability 1 is decidable. More precisely, we show how LTL\X model checking for (certain types of) probabilistic LCSs can be reduced to a reachability problem in a (non-probabilistic) LCS where the latter can be solved with the methods of [AJ93].