A compositional approach to performance modelling
A compositional approach to performance modelling
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Fitting world-wide web request traces with the EM-algorithm
Performance Evaluation - Special issue: Internet performance and control of network systems
Optimal state-space lumping in Markov chains
Information Processing Letters
An Algorithm for Computing Minimal% Coxian Representations
INFORMS Journal on Computing
Comparative branching-time semantics for Markov chains
Information and Computation
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
A compositional semantics for dynamic fault trees in terms of interactive Markov chains
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Algorithms for Coxianization of Phase-Type Generators
INFORMS Journal on Computing
| Hi-index | 0.00 |
Acyclic phase-type distributions are phase-type distributions with triangular matrix representations. They constitute a versatile modelling tool, since they (1) can serve as approximations to any continuous distributions, and (2) exhibit special properties and characteristics, which usually result in some ease in analysis. The size of the matrix representation has a strong influence on computational efforts needed when analyzing these distributions. This representation, however, is not unique, and two representations of the same distribution can differ drastically in size. This paper proposes an effective procedure to aggregate the size of the matrix representation without altering the distribution.