一种计算确定性和随机Petri网模型稳态解的改进数值算法

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91 Pub Date : 1991-12-02 DOI:10.1109/PNPM.1991.238803

C. Lindemann

{"title":"一种计算确定性和随机Petri网模型稳态解的改进数值算法","authors":"C. Lindemann","doi":"10.1109/PNPM.1991.238803","DOIUrl":null,"url":null,"abstract":"Introduces an algorithm for calculating steady-state solutions of DSPN models. The described method employs the randomization technique enhanced by a stable calculation of Poisson probabilities. A complete re-design and re-implementation of the appropriate components implemented in the version 1.4 of the software package GreatSPN has lead to significant savings in both computation time and memory space. These benefits are illustrated by DSPN models taken from the literature. The author considers DSPN models for an E/sub r//D/1/K queueing system and a fault-tolerant clocking system. These examples show that the model solutions are calculated with significantly less computational effort and a better error control by the algorithm described than by the method implemented in the version 1.4 of the software package GreatSPN.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":"{\"title\":\"An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models\",\"authors\":\"C. Lindemann\",\"doi\":\"10.1109/PNPM.1991.238803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Introduces an algorithm for calculating steady-state solutions of DSPN models. The described method employs the randomization technique enhanced by a stable calculation of Poisson probabilities. A complete re-design and re-implementation of the appropriate components implemented in the version 1.4 of the software package GreatSPN has lead to significant savings in both computation time and memory space. These benefits are illustrated by DSPN models taken from the literature. The author considers DSPN models for an E/sub r//D/1/K queueing system and a fault-tolerant clocking system. These examples show that the model solutions are calculated with significantly less computational effort and a better error control by the algorithm described than by the method implemented in the version 1.4 of the software package GreatSPN.<<ETX>>\",\"PeriodicalId\":137470,\"journal\":{\"name\":\"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"95\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PNPM.1991.238803\",\"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 Fourth International Workshop on Petri Nets and Performance Models PNPM91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PNPM.1991.238803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 95

摘要

介绍了一种计算DSPN模型稳态解的算法。所描述的方法采用稳定的泊松概率计算增强的随机化技术。在软件包GreatSPN的1.4版本中完全重新设计和重新实现了适当的组件，从而大大节省了计算时间和内存空间。从文献中提取的DSPN模型说明了这些好处。本文研究了E/sub / r//D/1/K排队系统和容错时钟系统的DSPN模型。这些实例表明，与GreatSPN.>软件包1.4版中实现的方法相比，所描述的算法计算模型解的计算量大大减少，并且具有更好的误差控制

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

查看原文本刊更多论文

An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models

Introduces an algorithm for calculating steady-state solutions of DSPN models. The described method employs the randomization technique enhanced by a stable calculation of Poisson probabilities. A complete re-design and re-implementation of the appropriate components implemented in the version 1.4 of the software package GreatSPN has lead to significant savings in both computation time and memory space. These benefits are illustrated by DSPN models taken from the literature. The author considers DSPN models for an E/sub r//D/1/K queueing system and a fault-tolerant clocking system. These examples show that the model solutions are calculated with significantly less computational effort and a better error control by the algorithm described than by the method implemented in the version 1.4 of the software package GreatSPN.<>

求助全文

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

来源期刊

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91

自引率

0.00%

发文量