.png){kind=icon}
.png){kind=icon}
Return
Approximate mean value analysis for stochastic marked graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/32.541436.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An iterative technique for the computation of approximate performance indices of a class of stochastic Petri nets models is presented. The proposed technique is derived from the mean value analysis algorithm for product form solution stochastic Petri nets. in this paper, we apply the approximation technique to stochastic marked graphs; In principle, the proposed technique can be used for other stochastic Petri net subclasses in the paper, some of these possible applications are presented. Several examples are presented in order to validate the approximate results.
Keywords:
stochastic Petri nets
marked graphs
computational algorithms
approximate mean value analysis algorithm
approximation techniques
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.6
Papers:
2.8K
Citations:
1.1W
Organization
No organization information available