Efficient Probabilistic Model Checking of Systems with Ranged Probabilities

Khalil Ghorbal (1) , Parasara Sridhar Duggirala (1) , Vineet Kahlon (1) , Franjo Ivancic (1) , Aarti Gupta (1)

1 NEC Laboratories America [Princeton]

We introduce a new technique to model check reachability properties on Interval Discrete-Time Markov Chains (IDTMC). We compute a sound over- approximation of the probabilities of satisfying a given property where the accuracy is characterized in terms of error bounds. We leverage affine arithmetic to propagate the first-order error terms. Higher-order error terms are bounded using interval arithmetic.

Domains: Formal Languages and Automata Theory [cs.FL]; Symbolic Computation [cs.SC]

Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivancic, Aarti Gupta. Efficient Probabilistic Model Checking of Systems with Ranged Probabilities. RP 2012 - Reachability Problems - 6th International Workshop, Sep 2012, Bordeaux, France. pp.107--120, ⟨10.1007/978-3-642-33512-9_10⟩. ⟨hal-01660909⟩