27 search results - page 1 / 6 » Compositionality for Markov Reward Chains with Fast Transiti... |
EPEW
2007
Springer
13 years 10 months ago
2007
Springer
A parallel composition is defined for Markov reward chains with fast transitions and for discontinuous Markov reward chains. In this setting, compositionality with respect to the r...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
DAGSTUHL
2006
13 years 8 months ago
2006
One of the main difficulties faced when analyzing Markov chains modelling evolutionary algorithms is that their cardinality grows quite fast. A reasonable way to deal with this iss...
FMCO
2009
Springer
13 years 4 months ago
2009
Springer
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...