广义随机Petri网消去消失标记的代价

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

A. Blakemore

{"title":"广义随机Petri网消去消失标记的代价","authors":"A. Blakemore","doi":"10.1109/PNPM.1989.68542","DOIUrl":null,"url":null,"abstract":"A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. An examination is made of the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net. The asymptotic complexity of a matrix-based algorithm is shown to grow quadratically with the number of tangible states. A simpler graph-based algorithm that executes much more rapidly on typical models is examined. Some alternatives to elimination are discussed.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"The cost of eliminating vanishing markings from generalized stochastic Petri nets\",\"authors\":\"A. Blakemore\",\"doi\":\"10.1109/PNPM.1989.68542\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. An examination is made of the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net. The asymptotic complexity of a matrix-based algorithm is shown to grow quadratically with the number of tangible states. A simpler graph-based algorithm that executes much more rapidly on typical models is examined. Some alternatives to elimination are discussed.<<ETX>>\",\"PeriodicalId\":366060,\"journal\":{\"name\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"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.68542\",\"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.68542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 25

摘要

通过研究可行标记的可达图，可以对广义随机Petri网进行分析。研究了广义随机Petri网求解过程中消失状态的消除问题。证明了基于矩阵的算法的渐近复杂度随有形状态的数量呈二次增长。研究了一种更简单的基于图的算法，该算法在典型模型上执行得更快。讨论了消除的一些替代方案。

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

查看原文本刊更多论文

The cost of eliminating vanishing markings from generalized stochastic Petri nets

A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. An examination is made of the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net. The asymptotic complexity of a matrix-based algorithm is shown to grow quadratically with the number of tangible states. A simpler graph-based algorithm that executes much more rapidly on typical models is examined. Some alternatives to elimination are discussed.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量