Combining queueing network and Generalized Stochastic Petri Net models for the analysis of some software blocking phenomena

Stochastic Petri nets: An elementary introduction

“…Finally, some researchers are studying the possibility of combining SPN with queues in order to obtain an integrated performance evaluation methodology that enjoys the nice properties of both approaches [48,49].…”

A net level performance analysis of stochastic Petri nets

“…Since the SPNs presented in this paper possess a closed norm solution it should be possible to extend Balbo et al's [1] work to cover a wider class of SPNs.…”

“…Balbo, Bruell and Chanta [1] have applied the knowledge of product form solutions to the analysis of SPNs, by replacing subnets which possess a product form solution with a single "equivalent server" transition, thereby reducing computational complexity. Since the SPNs presented in this paper possess a closed norm solution it should be possible to extend Balbo et al's [1] work to cover a wider class of SPNs.…”

Performability evaluation of gracefully degradable systems

“…They have presented approximate models for priority queueing schemes, software blocking phenomena, and other complex system behavior [2], [3], [4]. We follow a similar idea, but restrict ourselves to single-class queueing networks which do not possess a product-fonn solution.…”

“…This decomposition method introduces some error into the solution, only if there exists an interaction between a flow-equivalent transition and the complementary subnet of the compact GSPN. Such a case is given for instance when the firing rate of a flowequivalent transition is defined using the number of tokens in two or more places [2], [3]. If it is assumed that all tasks belong to a single class, the firing rate of the flowequivalent transition can be defined by using only the number of tokens of its single input place.…”