Efficient probabilistic model checking of systems with ranged probabilities

  • Authors:
  • Khalil Ghorbal;Parasara Sridhar Duggirala;Vineet Kahlon;Franjo Ivančić;Aarti Gupta

  • Affiliations:
  • NEC Laboratories America, Inc.;NEC Laboratories America, Inc., USA,University of Illinois at Urbana Champaign;NEC Laboratories America, Inc.;NEC Laboratories America, Inc.;NEC Laboratories America, Inc.

  • Venue:
  • RP'12 Proceedings of the 6th international conference on Reachability Problems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.