Skip to Main content Skip to Navigation
Reports

Lightweight Verification of Markov Decision Processes with Rewards

Axel Legay 1 Sean Sedwards 1 Louis-Marie Traonouez 1
1 ESTASYS - Efficient STAtistical methods in SYstems of systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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.
Document type :
Reports
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01088684
Contributor : Sean Sedwards <>
Submitted on : Friday, November 28, 2014 - 2:02:31 PM
Last modification on : Tuesday, March 23, 2021 - 9:54:02 AM
Long-term archiving on: : Friday, April 14, 2017 - 11:09:07 PM

File

LegaySedwardsTraonouez.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01088684, version 1

Citation

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

Share

Metrics

Record views

476

Files downloads

120