We study the introduction of transitions with Phase-type distribution firing time in (bounded) generalized stochastic Petri nets. Such transitions produce large increases of both space and time complexity for the computation of the steady state probabilities of the underlying Markov chain. We propose a new approach to limit this phenomenon while keeping full stochastic semantics of previous works. The method is based on a structural decomposition of the net. We establish conditions under which this decomposition leads to a tensor expression of the generator of the chain. The tensor expression is used to solve the chain with an iterative method.
CITATION STYLE
Haddad, S., Moreaux, P., & Chiola, G. (1997). Efficient handling of phase-type distributions in generalized stochastic petri nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1248, pp. 175–194). Springer Verlag. https://doi.org/10.1007/3-540-63139-9_36
Mendeley helps you to discover research relevant for your work.