Algorithmic Verification of Recursive Probabilistic State Machines

@inproceedings{Etessami2005AlgorithmicVO,
  title={Algorithmic Verification of Recursive Probabilistic State Machines},
  author={Kousha Etessami and Mihalis Yannakakis},
  booktitle={TACAS},
  year={2005}
}
Recursive Markov Chains (RMCs) ([EY04]) are a natural abstract model of procedural probabilistic programs and related systems involving recursion and probability. They succinctly define a class of denumerable Markov chains that generalize multi-type branching (stochastic) processes. In this paper, we study the problem of model checking an RMC against a given ω-regular specification. Namely, given an RMC A and a Büchi automaton B, we wish to know the probability that an execution of A is… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

82 Citations

051015'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…