By Topic

Entropy analysis of generalized stochastic Petri net s-transitions

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)
Watson, J.F., III ; Dept. of Electr.-Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA ; Desrochers, A.A.

A density function can be formulated with the maximum entropy method (MEM) that achieves entropy while meeting various constraints. The following three constraints are considered in the present work: a specified mean a specified variance, and knowledge that the density is one-sided (i.e., positive domain). A 1D gradient search (i.e., a line search) for obtaining the maximum entropy density is presented. Entropy and performance analysis results on a manufacturing system example are presented to compare the s-transition and maximum entropy density functions (MEDFs). The similarity between MEDF transitions and s-transitions is shown

Published in:

Decision and Control, 1992., Proceedings of the 31st IEEE Conference on

Date of Conference: