马尔可夫Petri网的吞吐量上限:嵌入式子网和排队网络

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

J. Campos, M. Suárez

{"title":"马尔可夫Petri网的吞吐量上限:嵌入式子网和排队网络","authors":"J. Campos, M. Suárez","doi":"10.1109/PNPM.1991.238789","DOIUrl":null,"url":null,"abstract":"Addresses the computation of upper 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 network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.<<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":"8","resultStr":"{\"title\":\"Throughput upper bounds for Markovian Petri nets: embedded subnets and queueing networks\",\"authors\":\"J. Campos, M. Suárez\",\"doi\":\"10.1109/PNPM.1991.238789\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Addresses the computation of upper 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 network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.<<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\":\"8\",\"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.238789\",\"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.238789","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

研究了具有瞬时服务时间和指数分布服务时间的随机Petri网稳态吞吐量上界的计算。作者试图将随机Petri网理论与非定时Petri网和排队网络理论深入地联系起来。通过考虑最慢嵌入子网(由网络关联矩阵的左环数支持产生)，改进了马尔可夫网络情况下一般服务时间分布的先前结果。对于活网和有界自由选择网的情况所得到的结果是特别有趣的。对于这样的网络，由关联矩阵的左环子产生的子网可以看作是嵌入式产品形式的封闭单类排队网络，并且存在有效的算法来分析它们。

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

查看原文本刊更多论文

Throughput upper bounds for Markovian Petri nets: embedded subnets and queueing networks

Addresses the computation of upper 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 network theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering the slowest embedded subnet (generated by the support of left annullers of the incidence matrix of the net). The obtained results for the case of live and bounded free choice nets are of special interest. For such nets, the subnets generated by the left annullers of the incidence matrix can be seen as embedded product-form closed monoclass queueing networks, and efficient algorithms exist for their analysis.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量