Stochastic ordering for Markov processes on partially ordered spaces
Mathematics of Operations Research
Bounding Availability of Repairable Systems
IEEE Transactions on Computers
Computing bounds on steady state availability of repairable computer systems
Journal of the ACM (JACM)
Bounding steady-state availability models with group repair and phase type repair distributions
IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Bound Computation of Dependability and Performance Measures
IEEE Transactions on Computers
An Algorithmic Approach to Stochastic Bounds
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Modeling Fiber Delay Loops in an All Optical Switch
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Stochastic bounds on partial ordering: application to memory overflows due to bursty arrivals
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
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
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Compositional approximate markov chain aggregation for PEPA models
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
Compositional approximate markov chain aggregation for PEPA models
EPEW'12 Proceedings of the 9th European conference on Computer Performance Engineering
| Hi-index | 0.00 |
We consider the strong stochastic ("st") ordering on Markov chains whose states are naturally endowed with a partial order and we present an algorithmic derivation of lumpable upper bounding matrix.The comparison of Markov chains relies on the monotonicity property even if it is only sufficient. When the model is not monotone, we must build a monotone upper bound. Quite often the natural partial order of the model makes the problem monotone with this order. However, if we use a total order consistent with the partial one the model is often not monotone anymore for the total order. Furthermore, the monotonicity property for total order adds a lot of constraints which are irrelevant and make the bound less accurate.Here we assume that the model is monotone for the natural partial order and we must build a matrix which is larger in the strong stochastic sense and easier to solve. We build a lumpable bound and we store the lumped version to be analyzed.Lumpable upper bounding matrices may also be useful when they are associated to a total order. We can derive a bound of the Markov chain with a two phase algorithm: first we derive a lumpable upper bound from the specifications, we store the lumped version and we make this lumped matrix monotone in a second phase.