Reachability analysis for incomplete networks of Markov decision processes

Ralf Wimmer*, Ernst Moritz Hahn, Holger Hermanns, Bernd Becker

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Assume we have a network of discrete-time Markov decision processes (MDPs) which synchronize via common actions. We investigate how to compute probability measures in case the structure of some of the component MDPs (so-called blackbox MDPs) is not known. We then extend this computation to work on networks of MDPs that share integer data variables of finite domain. We use a protocol which spreads information within a network as a case study to show the feasibility and effectiveness of our approach.

Original languageEnglish
Title of host publication9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011
Pages151-160
Number of pages10
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011 - Cambridge, United Kingdom
Duration: 11 Jul 201113 Jul 2011
Conference number: 9

Conference

Conference9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011
Abbreviated titleMEMOCODE 2011
CountryUnited Kingdom
CityCambridge
Period11/07/1113/07/11

Fingerprint

Dive into the research topics of 'Reachability analysis for incomplete networks of Markov decision processes'. Together they form a unique fingerprint.

Cite this