J. K. Muppala and K. S. Trivedi. GSPN Models: Transient Analysis and Applications. In preparation. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
SPNP: Stochastic Petri Net Package - Ciardo, Muppala, Trivedi (1989) (91 citations) Self-citation (Muppala Trivedi) (Correct)
....states of the DTMC according to the holding times: i = Since h i is zero for i 2 V, the value obtained for the steady state probability of the vanishing markings is zero, as it should be. 3. 2 Transient Analysis Transient analysis implemented in SPNP is based on the ELIMINATION method [33]. The underlying CTMC is obtained from the reachability graph by eliminating the vanishing markings. This elimination process is similar to that used in steady state analysis. Several solution methods for transient analysis of CTMCs exist. GSPNs often correspond to CTMCs with large state spaces ....
....and all the other states have an initial probability of zero. However, if the initial marking is a vanishing marking, the set of tangible markings reachable from the initial marking through immediate transitions rings must be determined; each marking in this set has a non zero initial probability [33]. SPNP automatically recognizes a vanishing initial marking and computes the initial distribution during the elimination step of the analysis. 13 3.3 Expected accumulated reward until absorption If the GSPN has absorbing markings, the expected accumulated reward until absorption can be computed ....
J. K. Muppala and K. S. Trivedi. GSPN Models: Transient Analysis and Applications. In preparation.
SPNP: Stochastic Petri Net Package - Ciardo, Muppala, Trivedi (1989) (91 citations) Self-citation (Muppala Trivedi) (Correct)
.... i = p i h i X k2V[T p k h k = p i h i X k2T p k h k Since h i is zero for i 2 V, the value obtained for the steady state probability of the vanishing markings is zero, as it should be. 3. 2 Transient Analysis Transient analysis implemented in SPNP is based on the ELIMINATION method [33]. The underlying CTMC is obtained from the reachability graph by eliminating the vanishing markings. This elimination process is similar to that used in steady state analysis. Several solution methods for transient analysis of CTMCs exist. GSPNs often correspond to CTMCs with large state spaces ....
....all the other states have an initial probability of zero. However, if the initial marking is a vanishing marking, the set of tangible markings reachable from the initial marking through immediate transitions firings must be determined; each marking in this set has a non zero initial probability [33]. SPNP automatically recognizes a vanishing initial marking and computes the initial distribution during the elimination step of the analysis. 3.3 Expected accumulated reward until absorption If the GSPN has absorbing markings, the expected accumulated reward until absorption can be computed ....
J. K. Muppala and K. S. Trivedi. GSPN Models: Transient Analysis and Applications. In preparation.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC