Throughput lower bounds for Markovian Petri nets: transformation techniques

J. Campos, Beatriz Sánchez, M. Suárez
{"title":"Throughput lower bounds for Markovian Petri nets: transformation techniques","authors":"J. Campos, Beatriz Sánchez, M. Suárez","doi":"10.1109/PNPM.1991.238788","DOIUrl":null,"url":null,"abstract":"Addresses the computation of lower bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1991.238788","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

Addresses the computation of lower bounds for the steady-state throughput of stochastic Petri nets with immediate and exponentially distributed service times of transitions. The authors try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
马尔可夫Petri网的吞吐量下界:转换技术
研究了具有瞬时服务时间和指数分布服务时间的随机Petri网稳态吞吐量下界的计算。作者试图将随机Petri网理论与非定时Petri网和排队网络理论深入地联系起来。通过考虑网络结构的局部悲观变换规则、初始标记和随机解释,改进了马尔可夫网络的一般使用时间分布的结果。特别对活的、有界的自由选择网和活的标记图系统的情形得到了一些结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Estimating the mean cycle time for stochastic safe marked graphs A parallel algorithm for computing invariants of Petri net models Throughput lower bounds for Markovian Petri nets: transformation techniques On periodic schedules for deterministically timed Petri net systems Reliability modeling of the MARS system: a case study in the use of different tools and techniques
×
引用
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