# The complexity of probabilistic verification

@article{Courcoubetis1995TheCO, title={The complexity of probabilistic verification}, author={Costas A. Courcoubetis and Mihalis Yannakakis}, journal={J. ACM}, year={1995}, volume={42}, pages={857-907} }

We determine the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic. For sequential programs, we present an algorithm that runs in time linear in the program and exponential in the specification, and also show that the problem is in PSPACE, matching the known lower bound. For concurrent programs, we show that the problem can be solved in time polynomial in the program and doubly…

## Figures from this paper

## 585 Citations

### Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems

- Computer ScienceElectron. Notes Theor. Comput. Sci.
- 1999

### Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata

- Computer ScienceCAI
- 2013

The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision process (MDP) and a…

### Model Checking Probabilistic Systems

- Computer Science
- 2009

This work presents the implementation of an efficient model checking tool for formulas of a formal probabilistic logic (EPPL) over non-reliable digital circuits, and considers factorizations of stochastic processes associated with the probability spaces generated by the systems.

### Model checking probabilistic pushdown automata

- Computer ScienceProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
- 2004

This work considers the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various Probabilistic logics and proves that both qualitative and quantitative model checking for pPDA is decidable.

### Model Checking of Recursive Probabilistic Systems

- Computer Science, MathematicsTOCL
- 2012

This article studies the problem of model checking an RMC against an ω-regular specification, given in terms of a Büchi automaton or a Linear Temporal Logic (LTL) formula, and establishes a number of strong upper bounds, as well as lower bounds, both for qualitative and quantitative problems.

### Verification of Probabilistic Recursive Sequential Programs

- Computer Science
- 2007

This work studies algorithmic verification of infinite-state probabilistic systems generated by probabilistic pushdown automata (pPDA). Probabilistic pushdown automata are obtained as a probabilistic…

### Automata-Theoretic Verification

- Computer Science
- 2011

The automata-theoretic approach to the satisfiability and model-checking problems for temporal logics reduces these problems to standard decision problems about automata, like nonemptiness, language containment, or membership (whether a given object is accepted by a given automaton).

### Two Variable vs. Linear Temporal Logic in Model Checking and Games

- Computer ScienceCONCUR
- 2011

This paper gives two logic-to-automata translations which can be used to give upper bounds for FO2 and UTL, and applies these to get new bounds for both nondeterministic systems and probabilistic systems, including Markov chains and Markov decision processes.

### Bounded Probabilistic Model Checking with the Muralpha Verifier

- Computer Science, MathematicsFMCAD
- 2004

An explicit verification algorithm for Probabilistic Systems defining discrete time/finite state Markov Chains and checks if Φ is satisfied in \({\cal M}\).

## References

SHOWING 1-10 OF 42 REFERENCES

### Automatic verification of probabilistic concurrent finite state programs

- Computer Science26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- 1985

An automata-theoretic approach is described, whereby probabilistic quantification over sets of computations is reduced to standard quantificationover individual computations, and a new determinization construction for ω-automata is used to improve the time complexity of the algorithm by two exponentials.

### Checking that finite state concurrent programs satisfy their linear specification

- Computer SciencePOPL
- 1985

An algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program and a formal proof in case the formula is valid over the program is presented.

### Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

- Computer SciencePOPL '83
- 1983

It is argued that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite state concurrent systems.

### The Complementation Problem for Büchi Automata with Appplications to Temporal Logic

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1987

### The complexity of propositional linear temporal logics

- Philosophy, MathematicsSTOC '82
- 1982

We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems are…

### Termination of Probabilistic Concurrent Program

- Computer Science, MathematicsTOPL
- 1983

In this model synchronization protocols that use randomization are in certain cases no more powerful than deterministic protocols and no fully symmetric randomized protocol can ensure mutual exclusion and freedom from lockout.

### Reasoning about infinite computation paths

- Computer Science24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- 1983

This work investigates extensions of temporal logic by finite automata on infinite words by investigating the addition of alternation and shows that it does not increase the complexity of the decision problem.

### Alternation

- Computer Science17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
- 1976

This work defines alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate, and shows that while n-state alternating finite automata accept only regular sets that can be accepted by 22n-O(logn) state deterministic automata, alternating pushdown automata acceptance all languages accepted by Turing machines in deterministic exponential time.