Queueing Analysis of Fault-Tolerant Computer Systems
IEEE Transactions on Software Engineering
Queueing analysis of fault-tolerant computer systems (extended abstract)
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
MRMSolve: Distribution Estimation of Large Markov Reward Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Evaluation of Reward Analysis Methods with MRMSolve 2.0
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Some Investigations Concerning the CTMC and the ODE Model Derived From Bio-PEPA
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric analysis of queuing networks
IBM Journal of Research and Development
A modified uniformization method for the solution of the chemical master equation
Computers & Mathematics with Applications
Simplification of a complex signal transduction model using invariants and flow equivalent servers
Theoretical Computer Science
A unified approach to the moments based distribution estimation – unbounded support
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Hi-index | 0.00 |
This paper considers Markov chains describing stochastic reaction networks. These Markov chains often have a huge state space which make their analysis unfeasible. We show that there exist cases when the original Markov chain can be transformed into a Markov reward model with a smaller state space and whose analysis gives information on the moments of the quantity of the involved species. We derive the necessary mathematics and provide numerical examples to illustrate the approach.