Cart (Loading....) | Create Account
Close category search window
 

Performance evaluation of non-Markovian stochastic event graphs

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

1 Author(s)
Cubaud, P.H. ; CEDRIC, Conservatoire Nat. des Arts et Metiers, Paris, France

The computation of transitions firing rates of a stochastic event graph is equivalent to the computation of the completion time of some PERT network. We describe a low polynomial complexity algorithm that provides bounds and approximation of any firing rate using properties of integral orderings among random variables. We test the algorithm on some examples and discuss its use for the computation of the network cycle time

Published in:

Petri Nets and Performance Models, 1995., Proceedings of the Sixth International Workshop on

Date of Conference:

3-6 Oct 1995

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.