By Topic

Acyclic Minimality by Construction---Almost

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pulungan, R. ; Jurusan Ilmu Komputer, Universitas Gadjah Mada, Yogyakarta, Indonesia ; Hermanns, H.

Acyclic phase-type distributions are phase-type distributions with triangular matrix representations. They constitute a versatile modelling tool in many circumstances. The size of their 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 explores an effective algorithm to reduce the size of the matrix representation without altering the distribution. This proceeds via a symbolic representation of the Laplace-Stieltjes transform of the phase-type distribution. The algorithm is of cubic complexity in the size of the given representation. We clarify the circumstances under which the algorithm returns a minimal representation, and discuss in how far it can keep representations minimal when they are constructed via any of three operations---convolution, minimum, and maximum. A case study modelling delay propagation in railway networks demonstrates the practicality of the approach.

Published in:

Quantitative Evaluation of Systems, 2009. QEST '09. Sixth International Conference on the

Date of Conference:

13-16 Sept. 2009