标记图稳态性能的紧多项式界

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89 Pub Date : 1989-12-11 DOI:10.1109/PNPM.1989.68553

J. Campos, G. Chiola, J. Colom, M. Suárez

{"title":"标记图稳态性能的紧多项式界","authors":"J. Campos, G. Chiola, J. Colom, M. Suárez","doi":"10.1109/PNPM.1989.68553","DOIUrl":null,"url":null,"abstract":"The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded marked graphs with time associated with transitions are considered. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":"{\"title\":\"Tight polynomial bounds for steady-state performance of marked graphs\",\"authors\":\"J. Campos, G. Chiola, J. Colom, M. Suárez\",\"doi\":\"10.1109/PNPM.1989.68553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded marked graphs with time associated with transitions are considered. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.<<ETX>>\",\"PeriodicalId\":366060,\"journal\":{\"name\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"29\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1989.68553\",\"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 Third International Workshop on Petri Nets and Performance Models, PNPM89","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1989.68553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 29

摘要

研究了定时和随机标记图稳态性能的上界和下界的计算问题。特别地，在底层Petri网的关联矩阵上定义线性规划问题，以计算与时间相关的活动和有界标记图的转换吞吐量的紧(即可达)边界。这些边界取决于初始标记和延迟的平均值，但不取决于概率分布(因此包括确定性和随机情况)。强调了Petri模型定性和定量分析的典型结果与技术之间的联系。

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

查看原文本刊更多论文

Tight polynomial bounds for steady-state performance of marked graphs

The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets to compute tight (i.e. reachable) bounds for the throughput of transitions for live and bounded marked graphs with time associated with transitions are considered. These bounds depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases). Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed.<>

求助全文

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

来源期刊

Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89

自引率

0.00%

发文量