Algorithms for product-form stochastic Petri nets-A new approach

J. L. Coleman
{"title":"Algorithms for product-form stochastic Petri nets-A new approach","authors":"J. L. Coleman","doi":"10.1109/PNPM.1993.393430","DOIUrl":null,"url":null,"abstract":"A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1993.393430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
乘积型随机Petri网的算法——一种新方法
利用乘积型随机Petri网(sf - spn)中各利用率之间的一般关系,推导出一种计算归一化常数的方法。该方法将许多状态的贡献作为几何和收集在一起,通常提供了一种与初始标记大小无关的数值复杂性的递归算法。将该方法应用于一些简单的算例,得到了归一化常数的闭型解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of deterministic and stochastic Petri nets Conflict sets in colored Petri nets Decidability of the strict reachability problem for TPN's with rational and real durations Quantitative evaluation of discrete event systems: Models, performances and techniques A characterization of independence for competing Markov chains with applications to stochastic Petri nets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1