Efficient Probabilistic Model Checking of Systems with Ranged Probabilities - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Efficient Probabilistic Model Checking of Systems with Ranged Probabilities

Résumé

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.
Fichier principal
Vignette du fichier
rp12.pdf (238.1 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-01660909 , version 1 (12-12-2017)

Identifiants

Citer

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⟩
33 Consultations
48 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More