A heuristic procedure for compact Markov representation of PH distributions

Authors

  • Illes Horvath MTA-BME Information Systems Research Group
  • Miklos Telek Budapest University of Technology and Economics image/svg+xml

DOI:

https://doi.org/10.4108/icst.valuetools.2014.258174

Keywords:

ph distribution, minimal representation, feedback erlang block, unicyclic block

Abstract

The minimal Markovian representation of PH distributions is an open research problem, which was actively investigated during the last two decades. We present a numerical method for finding small Markovian representation of PH distributions and investigate the general quality of the method by comparing the size of the obtained representation with the size of the representation obtained by alternative methods. Our numerical method intends to find a small Markovian representation. We report examples when the obtained representation is larger than the minimal Markovian representation.

Downloads

Download data is not yet available.
<br data-mce-bogus="1"> <br data-mce-bogus="1">

Downloads

Published

19-02-2015

How to Cite

[1]
I. . Horvath and M. . Telek, “A heuristic procedure for compact Markov representation of PH distributions”, EAI Endorsed Trans IoT, vol. 1, no. 4, p. e2, Feb. 2015.

Issue

Vol. 1 No. 4 (2015): EAI Endorsed Transactions on Internet of Things

Section

Research article

License

Copyright (c) 2015 EAI Endorsed Transactions on Internet of Things

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License.

This is an open-access article distributed under the terms of the Creative Commons Attribution CC BY 3.0 license, which permits unlimited use, distribution, and reproduction in any medium so long as the original work is properly cited.