In: Proceedings of the 32nd Midwest Symposium on Circuits and Systems, 1989, Champaign, IL, USA, pages 153-156. Piscataway, NJ, USA: IEEE Service Center, 1990.
Abstract: Methods to compute tight bounds for steady-state token probabilities of a class of generalized stochastic Petri net (GSPN) models are presented. Such bounds also give a better estimate of the error produced when decompositions and aggregations are used to compute the various performance measures. A method to compute the best lower and upper bounds for conditional token probability of a class of GSPN subnets when only the subnet is considered is described. This technique is extended, and an algorithm to compute the bounds for error due to aggregation and decomposition at the GSPN level is outlined.
Keywords: steady-state token probability; generalized stochastic net; decomposition (into) subnet; aggregation (of) subnet; performance measure.
Back to the Petri Nets Bibliography