On The Relations Between Bcmp Queueing Networks And Product Form Solution Stochastic Petri Nets
10TH INTERNATIONAL WORKSHOP ON PETRI NETS AND PERFORMANCE MODELS, PROCEEDINGS(2003)
摘要
In this paper we show that multi-class BCMP queueing networks can be represented by means of Product Form Solution Stochastic Petri Nets (PF-SPNs). Since the first time PF-SPNs were proposed, one of their main drawbacks concerned the fact that there was no clear relation between PF-SPNs and PF-QNs, in particular the well-known multi-class BCMP-QNs. It is important to note that the existence of the product form solution is not a property of the formalism, but of the underlying Markovian process. Hence, the fact that PF-SPNs (and also PF-GSPNs) cannot directly represent BCMP-QNs is one of the weaknesses of the SPN product-form results. The results presented in this paper overcome this weakness. In particular, we show that starting from a detailed GSPN representation of each of the BCMP station types, it is possible to derive equivalent compact PF-SPN representations for each station type.
更多查看译文
关键词
stochastic processes,linear systems,computer science,steady state,stochastic petri net,concurrent computing,petri nets
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要