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
$31 $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 are presented for computing tight bounds for steady-state token probabilities of a class of generalized stochastic net (GSPN) models. Such bounds also give a better estimate of the error produced when decompositions and aggregations are used to compute the various performance measures. First a method is described to compute the best lower and upper bounds for conditional token probabilities of a class of GSPN when only the subsequent is considered. The authors show that such bounds can be improved if additional information about other subnets is available. They extend the technique and outline an algorithm to compute the bounds for error due to aggregation and decomposition at the GSPN level. An example is presented to illustrate the technique and algorithm

Published in:

Petri Nets and Performance Models, 1989. PNPM89., Proceedings of the Third International Workshop on

Date of Conference:

11-13 Dec 1989