Approximate mean value analysis based on Markov chain aggregation by composition
DOI10.1016/J.LAA.2004.02.021zbMath1048.65008OpenAlexW2068431097MaRDI QIDQ1434435
Dorina C. Petriu, C. Murray Woodside
Publication date: 4 August 2004
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2004.02.021
Markov chainsNumerical examplesQueueing systemAggregation by compositionCompositional modelingMean value analysisPerformance modelsSoftware performance
Computational methods in Markov chains (60J22) Queueing theory (aspects of probability theory) (60K25) Numerical analysis or methods applied to Markov chains (65C40) Complexity and performance of numerical algorithms (65Y20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interactive Markov chains. And the quest for quantified quality
- The numerical solution of stochastic automata networks
- Throughput calculation for basic stochastic rendezvous networks
- The stochastic rendezvous network model for performance of synchronous client-server-like distributed software
- Compositional performance modelling with the TIPPtool
- Effectiveness of early replies in client–server systems
- A Priority Queuing System with Server-Walking Time
This page was built for publication: Approximate mean value analysis based on Markov chain aggregation by composition