{"title":"Superposed stochastic automata: a class of stochastic Petri nets amenable to parallel solution","authors":"S. Donatelli","doi":"10.1109/PNPM.1991.238782","DOIUrl":null,"url":null,"abstract":"B. Plateau (1985) introduced an efficient way for solving stochastic processes that are derived from the composition of stochastic automata by making extensive use of the Kronecker (tensor) algebra for matrices. The author applies that efficient solution to a class of stochastic Petri nets (SPN) that has been called superposed stochastic automata (SSA). The solution has been implemented both with sequential and parallel programs. SSA are a rather restricted subclass of SPN, but the extension to the general case doesn't appear to pose any theoretical problem.<<ETX>>","PeriodicalId":137470,"journal":{"name":"Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"49","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.238782","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 49
Abstract
B. Plateau (1985) introduced an efficient way for solving stochastic processes that are derived from the composition of stochastic automata by making extensive use of the Kronecker (tensor) algebra for matrices. The author applies that efficient solution to a class of stochastic Petri nets (SPN) that has been called superposed stochastic automata (SSA). The solution has been implemented both with sequential and parallel programs. SSA are a rather restricted subclass of SPN, but the extension to the general case doesn't appear to pose any theoretical problem.<>
B. Plateau(1985)通过广泛使用矩阵的Kronecker(张量)代数，引入了一种求解随机过程的有效方法，这些随机过程是由随机自动机组成的。作者将该有效解应用于一类随机Petri网(SPN)，即叠加随机自动机(SSA)。该方案已在顺序和并行程序中实现。SSA是SPN的一个相当有限的子类，但将其推广到一般情况下似乎没有任何理论问题
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
