{"title":"拟可聚随机良形网性能指标的计算界","authors":"G. Franceschinis, R. Muntz","doi":"10.1109/PNPM.1993.393455","DOIUrl":null,"url":null,"abstract":"The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are described. Two application examples are shown.<<ETX>>","PeriodicalId":404832,"journal":{"name":"Proceedings of 5th International Workshop on Petri Nets and Performance Models","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets\",\"authors\":\"G. Franceschinis, R. Muntz\",\"doi\":\"10.1109/PNPM.1993.393455\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are described. Two application examples are shown.<<ETX>>\",\"PeriodicalId\":404832,\"journal\":{\"name\":\"Proceedings of 5th International Workshop on Petri Nets and Performance Models\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"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.393455\",\"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.393455","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets
The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are described. Two application examples are shown.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
