Turning back time in Markovian process algebra
Turning back time in Markovian process algebra
复制标题
DOI：
10.1016/s0304-3975(02)00375-4
复制
发表时间：
2003-01-03
影响因子：
1.1
通讯作者：
Harrison, PG
中科院分区：
文献类型：
--
作者：
Harrison, PG
利用逆过程的性质构造了马尔可夫过程代数（MPA）的乘积形式解。MPA的组合性被直接利用，允许一个大类的分层结构的系统，以解决其在平衡状态的概率。本文包含新的结果，以及MPA本身的逆平稳马尔可夫过程，并包括一个机械化的证明MPA符号的杰克逊定理的产品形式的网络。几个例子来说明的方法。(C)2002 Elsevier Science B.V.保留所有权利。
Product-form solutions in Markovian process algebra (MPA) are constructed using properties of reversed processes. The compositionality of MPAs is directly exploited, allowing a large class of hierarchically constructed systems to be solved for their state probabilities at equilibrium. The paper contains new results on both reversed stationary Markov processes as well as MPA itself and includes a mechanisable proof in MPA notation of Jackson's theorem for product-form queueing networks. Several examples are used to illustrate the approach. (C) 2002 Elsevier Science B.V. All rights reserved.