{"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}
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
