马尔可夫Petri网的吞吐量下界:转换技术

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91 Pub Date : 1991-12-02 DOI:10.1109/PNPM.1991.238788

J. Campos, Beatriz Sánchez, M. Suárez

{"title":"马尔可夫Petri网的吞吐量下界:转换技术","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":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"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\":\"44 1\",\"pages\":\"0\"},\"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}","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

摘要

研究了具有瞬时服务时间和指数分布服务时间的随机Petri网稳态吞吐量下界的计算。作者试图将随机Petri网理论与非定时Petri网和排队网络理论深入地联系起来。通过考虑网络结构的局部悲观变换规则、初始标记和随机解释，改进了马尔可夫网络的一般使用时间分布的结果。特别对活的、有界的自由选择网和活的标记图系统的情形得到了一些结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Throughput lower bounds for Markovian Petri nets: transformation techniques

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91

自引率

0.00%

发文量