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 language | English |
---|---|
Title of host publication | 9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011 |
Pages | 151-160 |
Number of pages | 10 |
DOIs | |
Publication status | Published - 2011 |
Externally published | Yes |
Event | 9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011 - Cambridge, United Kingdom Duration: 11 Jul 2011 → 13 Jul 2011 Conference number: 9 |
Conference
Conference | 9th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2011 |
---|---|
Abbreviated title | MEMOCODE 2011 |
Country/Territory | United Kingdom |
City | Cambridge |
Period | 11/07/11 → 13/07/11 |