基于广义随机高阶Petri网的复合马尔可夫链自动构造

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

J.A. Carasco

{"title":"基于广义随机高阶Petri网的复合马尔可夫链自动构造","authors":"J.A. Carasco","doi":"10.1109/PNPM.1989.68543","DOIUrl":null,"url":null,"abstract":"A new type of Petri nets called generalized stochastic high-level Petri nets (GSHLPNs), combining the quantities of GSPNs and SHLPNs, is presented. The automated construction of compound continuous-time Markov chains (CTMCs) from GSHLPNs is also considered. A formalism for the description of compound markings allowing a symbolic firing of the net to obtain a compound CTMC with correct state group is derived. The construction of the compound CTMC requires an algorithm to test the equivalence of compound markings. I tis shown that, in the general case and for bounded number of rotation groups, the problem is polynomially equivalent to graph isomorphism, a problem whose classification in the NP world is currently open.<<ETX>>","PeriodicalId":366060,"journal":{"name":"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89","volume":"224 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Automated construction of compound Markov chains from generalized stochastic high-level Petri nets\",\"authors\":\"J.A. Carasco\",\"doi\":\"10.1109/PNPM.1989.68543\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new type of Petri nets called generalized stochastic high-level Petri nets (GSHLPNs), combining the quantities of GSPNs and SHLPNs, is presented. The automated construction of compound continuous-time Markov chains (CTMCs) from GSHLPNs is also considered. A formalism for the description of compound markings allowing a symbolic firing of the net to obtain a compound CTMC with correct state group is derived. The construction of the compound CTMC requires an algorithm to test the equivalence of compound markings. I tis shown that, in the general case and for bounded number of rotation groups, the problem is polynomially equivalent to graph isomorphism, a problem whose classification in the NP world is currently open.<<ETX>>\",\"PeriodicalId\":366060,\"journal\":{\"name\":\"Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89\",\"volume\":\"224 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"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.68543\",\"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.68543","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

提出了一种将广义随机高阶Petri网和广义随机高阶Petri网的数量相结合的新型Petri网，称为GSHLPNs。本文还考虑了由gshlpn自动构造复合连续马尔可夫链(ctmc)的问题。给出了一种描述复合标记的形式，该形式允许网络的符号发射以获得具有正确状态群的复合CTMC。复合CTMC的构建需要一种算法来测试复合标记的等效性。这表明，在一般情况下，对于有限数量的旋转群，这个问题多项式地等价于图同构，这个问题在NP世界中的分类目前是开放的。

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

查看原文本刊更多论文

Automated construction of compound Markov chains from generalized stochastic high-level Petri nets

A new type of Petri nets called generalized stochastic high-level Petri nets (GSHLPNs), combining the quantities of GSPNs and SHLPNs, is presented. The automated construction of compound continuous-time Markov chains (CTMCs) from GSHLPNs is also considered. A formalism for the description of compound markings allowing a symbolic firing of the net to obtain a compound CTMC with correct state group is derived. The construction of the compound CTMC requires an algorithm to test the equivalence of compound markings. I tis shown that, in the general case and for bounded number of rotation groups, the problem is polynomially equivalent to graph isomorphism, a problem whose classification in the NP world is currently open.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量