Scalable Verification of Markov Decision Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Scalable Verification of Markov Decision Processes


Markov decision processes (MDP) are useful to model concurrent process optimisation problems, but verifying them with numerical methods is often intractable. Existing approximative approaches do not scale well and are limited to memoryless schedulers. Here we present the basis of scalable verification for MDPs, using an O(1) memory representation of history-dependent schedulers. We thus facilitate scalable learning techniques and the use of massively parallel verification.
Fichier principal
Vignette du fichier
LegaySedwardsTraonouez2014.pdf (213.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01088396 , version 1 (27-11-2014)


  • HAL Id : hal-01088396 , version 1


Axel Legay, Sean Sedwards, Louis-Marie Traonouez. Scalable Verification of Markov Decision Processes. 4th Workshop on Formal Methods in the Development of Software (FMDS 2014), Sep 2014, Grenoble, France. ⟨hal-01088396⟩
256 View
142 Download


Gmail Facebook X LinkedIn More