Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems

@article{Baier1999ComputingPB,
  title={Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems},
  author={Christel Baier and Marta Z. Kwiatkowska and Gethin Norman},
  journal={Electr. Notes Theor. Comput. Sci.},
  year={1999},
  volume={22},
  pages={29}
}
Probabilistic verification of concurrent probabilistic systems against linear time specifications is known to be expensive in terms of time and space: time is double exponential in the size of the formula and polynomial in the size of the state space, and space complexity is single exponential [24,7]. This paper proposes to compute for a linear time formula only a lower and upper bound on the probability measure of the set of paths satisfying it, instead of calculating the exact probability… CONTINUE READING