{"title":"乘积型随机Petri网的算法——一种新方法","authors":"J. L. Coleman","doi":"10.1109/PNPM.1993.393430","DOIUrl":null,"url":null,"abstract":"A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Algorithms for product-form stochastic Petri nets-A new approach\",\"authors\":\"J. L. Coleman\",\"doi\":\"10.1109/PNPM.1993.393430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<<ETX>>\",\"PeriodicalId\":404832,\"journal\":{\"name\":\"Proceedings of 5th International Workshop on Petri Nets and Performance Models\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 5th International Workshop on Petri Nets and Performance Models\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1993.393430\",\"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 5th International Workshop on Petri Nets and Performance Models","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1993.393430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithms for product-form stochastic Petri nets-A new approach
A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
