摘要
本文提出一种随机Ｐｅｔｒｉ网（ＳＰＮ）的资源共享系统的模型，并给出了模型分解和子模型选代近似求解的两种方法：标识概率交换和平均标志个数交换．例子显示了这两种方法的有效性和相对误差．本文还证明了上述两种方法在固定点迭代求解中，固定点解的存在．本文的复杂模型近似性能求解方法可以应用到很多复杂系统的性能分析中．
This paper describes a stochastic Petri net (SPN) model of systems withshared resources. Base on the transition predicates, the SPN model can be refinedand easily decomposed into near independent submodels. The exchange methods ofmarking probabilities and average number of tokens are applied to fixed point iteration. Examples in this paper show that these methods are efficient and exact forperformance analysis. In iteration of two methods, it is proved that a fixed pointexists. The approximate performance analysis technology of this paper can be applied to performance models of some complex systems.
出处
《计算机学报》
EI
CSCD
北大核心
1997年第10期865-871,共7页
Chinese Journal of Computers
基金
国家自然科学基金
关键词
资源共享系统
近似性能分析
PETRI网
Systems with shared resources
approximate performance analysis
fixed point iteration
model decomposition
stochastic Petri nets.
