Symbolic Computation of Maximal Probabilistic Reachability

@inproceedings{Kwiatkowska2001SymbolicCO,
  title={Symbolic Computation of Maximal Probabilistic Reachability},
  author={Marta Z. Kwiatkowska and Gethin Norman and Jeremy Sproston},
  booktitle={CONCUR},
  year={2001}
}
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of the maximal probability of reaching a given set of states, and underlies decision procedures for the automatic verification of probabilistic systems. We extend the framework of symbolic transition systems, which equips an infinite-state system with an algebra of symbolic operators on its state space, with a symbolic… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
24 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

and L

  • A. Bianc
  • de Alfaro. Model checking of probabilistic and…
  • 1995
Highly Influential
5 Excerpts

Symbolic computation of maximal probabilistic reachability

  • M. Z. Kwiatkowska, G. Norman, J. Sproston
  • Technical Report CSR-01-5, School of Computer…
  • 2001
1 Excerpt

Uppaal2k

  • P. Pettersson, K. G. Larsen
  • Bulletin of the European Association for…
  • 2000
2 Excerpts

Similar Papers

Loading similar papers…