By Topic

On bounds for token probabilities in a class of generalized stochastic Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Islam, S.M.R. ; Dept. of Electr. & Comput. Eng., Clarkson Univ., Potsdam, NY, USA ; Ammar, H.H.

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. Such bounds can be improved when additional information about other subnets can be used. This technique is extended, and an algorithm to compute the bounds for error due to aggregation and decomposition at the GSPN level is outlined. An example is presented to illustrate the technique and algorithm

Published in:

Circuits and Systems, 1989., Proceedings of the 32nd Midwest Symposium on

Date of Conference:

14-16 Aug 1989