Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems

Christel BaierChristel Baier, Marta Z. KwiatkowskaMarta Z. Kwiatkowska, Gethin NormanGethin Norman

DOI Link

Christel Baier, Marta Z. Kwiatkowska, Gethin Norman
Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems
Electron. Notes Theor. Comput. Sci., 22:29, 1999

Details
Bibtex

KurzfassungAbstract
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 (Vardi, 1985; Courcoubetis & Yannakakis, 1995). 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. This yields a coarser estimate, namely an interval of values in [0,1] which contains the actual probability, but the calculation is simpler and more efficient (time is single exponential and space complexity is linear), and could thus be useful as an initial check in a model checking tool.
Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science

@article{BKN1999,
  author  = {Christel Baier and Marta Z. Kwiatkowska and Gethin Norman},
  title   = {Computing Probability Bounds for Linear Time Formulas over
             Concurrent Probabilistic Systems},
  journal = {Electron. Notes Theor. Comput. Sci.},
  volume  = {22},
  year    = {1999},
  pages   = {29},
  doi     = {10.1016/S1571-0661(05)80595-X}
}