Lightweight Verification of Markov Decision Processes with Rewards - Inria - Institut national de recherche en sciences et technologies du numérique
Rapport (Rapport De Recherche) Année : 2014

Lightweight Verification of Markov Decision Processes with Rewards

Résumé

Markov decision processes are useful models of concurrency optimisation problems, but are often intractable for exhaustive verification methods. Recent work has introduced lightweight approximative techniques that sample directly from scheduler space, bringing the prospect of scalable alternatives to standard numerical algorithms. The focus so far has been on optimising the probability of a property, but many problems require quantitative analysis of rewards. In this work we therefore present lightweight verification algorithms to optimise the rewards of Markov decision processes. We provide the statistical confidence bounds that this necessitates and demonstrate our approach on standard case studies.
Fichier principal
Vignette du fichier
LegaySedwardsTraonouez.pdf (199.1 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01088684 , version 1 (28-11-2014)

Identifiants

  • HAL Id : hal-01088684 , version 1

Citer

Axel Legay, Sean Sedwards, Louis-Marie Traonouez. Lightweight Verification of Markov Decision Processes with Rewards. [Research Report] INRIA Rennes - Bretagne Atlantique. 2014. ⟨hal-01088684⟩
261 Consultations
57 Téléchargements

Partager

More