Verifying the long-run behavior of probabilistic system models in the presence of uncertainty

Verifying that a stochastic system is in a certain state when it has reached equilibrium has important applications. For instance, the probabilistic verification of the long-run behavior of a safety-critical system enables assessors to check whether it accepts a human abort-command at any time with a probability that is sufficiently high. The stochastic system is represented as probabilistic model, a long-run property is asserted and a probabilistic verifier checks the model against the property. However, existing probabilistic verifiers do not account for the imprecision of the probabilistic parameters in the model. Due to uncertainty, the probability of any state transition may be subject to small perturbations which can have direct consequences for the veracity of the verification result. In reality, the safety-critical system may accept the abort-command with an insufficient probability. In this paper, we introduce the first probabilistic verification technique that accounts for uncertainty on the verification of long-run properties of a stochastic system. We present a mathematical framework for the asymptotic analysis of the stationary distribution of a discrete-time Markov chain, making no assumptions about the distribution of the perturbations. Concretely, our novel technique computes upper and lower bounds on the long-run probability, given a certain degree of uncertainty about the stochastic system.

[1]  C. D. Meyer,et al.  Comparison of perturbation bounds for the stationary distribution of a Markov chain , 2001 .

[2]  Andrea Maggiolo-Schettini,et al.  Parametric probabilistic transition systems for system design and analysis , 2007, Formal Aspects of Computing.

[3]  Ning Wang,et al.  XRay: A Function Call Tracing System , 2016 .

[4]  C. D. Meyer,et al.  Markov chain sensitivity measured by mean first passage times , 2000 .

[5]  E. Altman,et al.  Perturbation analysis for denumerable Markov chains with application to queueing models , 2004, Advances in Applied Probability.

[6]  Marta Z. Kwiatkowska,et al.  Probabilistic model checking in practice: case studies with PRISM , 2005, PERV.

[7]  David S. Rosenblum,et al.  Asymptotic Bounds for Quantitative Verification of Perturbed Probabilistic Systems , 2013, ICFEM.

[8]  Nicolas Privault,et al.  Understanding Markov Chains: Examples and Applications , 2013 .

[9]  Kannan Srinivasan,et al.  Modeling Online Browsing and Path Analysis Using Clickstream Data , 2004 .

[10]  David S. Rosenblum,et al.  Probabilistic model checking of perturbed MDPs with applications to cloud computing , 2017, ESEC/SIGSOFT FSE.

[11]  David S. Rosenblum,et al.  Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters , 2016 .

[12]  Bryan L. Shader,et al.  Applications of Paz's inequality to perturbation bounds for Markov chains , 1998 .

[13]  David S. Rosenblum,et al.  ProEva: Runtime Proactive Performance Evaluation Based on Continuous-Time Markov Chains , 2017, 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE).

[14]  P. Schweitzer Perturbation theory and finite Markov chains , 1968 .

[15]  Lijun Zhang,et al.  Probabilistic Reachability for Parametric Markov Models , 2009, SPIN.

[16]  Nicolas Coste Towards Performance Prediction of Compositional Models in GALS Designs. (Vers la prédiction de performance de modèles compositionnels dans les architectures GALS) , 2010 .

[17]  David S. Rosenblum,et al.  Perturbation analysis of stochastic systems with empirical distribution parameters , 2014, ICSE.

[18]  Padhraic Smyth,et al.  Visualization of navigation patterns on a Web site using model-based clustering , 2000, KDD '00.

[19]  L. V. D. Heyden,et al.  Perturbation bounds for the stationary probabilities of a finite Markov chain , 1984 .

[20]  E. Seneta,et al.  Perturbation of the stationary distribution measured by ergodicity coefficients , 1988, Advances in Applied Probability.