Efficient probabilistic model checking of systems with ranged probabilities

Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić, Aarti Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationReachability Problems - 6th International Workshop, RP 2012, Proceedings
Pages107-120
Number of pages14
DOIs
StatePublished - Oct 1 2012
Externally publishedYes
Event6th International Workshop on Reachability Problems, RP 2012 - Bordeaux, France
Duration: Sep 17 2012Sep 19 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7550 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Workshop on Reachability Problems, RP 2012
CountryFrance
CityBordeaux
Period9/17/129/19/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient probabilistic model checking of systems with ranged probabilities'. Together they form a unique fingerprint.

  • Cite this

    Ghorbal, K., Duggirala, P. S., Kahlon, V., Ivančić, F., & Gupta, A. (2012). Efficient probabilistic model checking of systems with ranged probabilities. In Reachability Problems - 6th International Workshop, RP 2012, Proceedings (pp. 107-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7550 LNCS). https://doi.org/10.1007/978-3-642-33512-9_10