Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/MEMCOD.2011.5970522 | Formal Methods and Models for Codesign |
Keywords | Field | DocType |
Markov processes,peer-to-peer computing,protocols,reachability analysis,MDP,Markov decision processes,incomplete networks,integer data variables,probability measurement,reachability analysis | Markov process,Computer science,Markov model,Partially observable Markov decision process,Markov chain,Markov decision process,Theoretical computer science,Variable-order Markov model,Markov kernel,Markov renewal process | Conference |
ISBN | Citations | PageRank |
978-1-4577-0118-4 | 1 | 0.37 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralf Wimmer | 1 | 407 | 34.28 |
| Ernst Moritz Hahn | 2 | 368 | 23.99 |
| Holger Hermanns | 3 | 3418 | 229.22 |
| B. Becker | 4 | 191 | 21.44 |