TAYLOR SERIES EXPANSIONS FOR POISSON-DRIVEN (max, plus )-LINEAR SYSTEMS

被引:0
作者
Baccelli, Francois [1 ]
Schmidt, Volker [2 ]
机构
[1] INRIA Sophia Valbonne, 2004 Route Lucioles,BP 93, F-06902 Sophia Antipolis, France
[2] Univ Ulm, Abt Stochast, D-89069 Ulm, Germany
关键词
Queueing networks; stochastic Petri nets; Poisson input; vectorial recurrence equation; stationary state variables; marked point processes; factorial moment measures; multinomial expansion;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We give a Taylor series expansion for the mean value of the canonical stationary state variables of open (max, +)-linear stochastic systems with Poisson input process. Probabilistic expressions are derived for coefficients of all orders, under certain integrability conditions. The coefficients in the series expansion are the expectations of polynomials, known in explicit form, of certain random variables defined from the data of the (max, +)linear system. These polynomials are of independent combinatorial interest: their monomials belong to a subset of those obtained in the multinomial expansion; they are also invariant under cyclic permutation and under translations along the main diagonal. The method for proving these results is based on two ingredients: (1) the (max, +)-linear representation of the stationary state variables as functionals of the input point process; (2) the series expansion representation of functionals of marked point processes and, in particular, of Poisson point processes. Several applications of these results are proposed in queueing theory and within the framework of stochastic Petri nets. It is well known that (max, +)-linear systems allow one to represent stochastic Petri nets belonging to the class of event graphs. This class contains various instances of queueing networks like acyclic or cyclic fork-join queueing networks, finite or infinite capacity tandem queueing networks with various types of blocking (manufacturing and communication), synchronized queueing networks and so on. It also contains some basic manufacturing models such as Kanban networks, Job-Shop systems and so forth. The applicability of this expansion method is discussed for several systems of this type. In the MID case (i.e., all service times are deterministic), the approach is quite practical, as all coefficients of the expansion are obtained in closed form. In the MIGI case, the computation of the coefficient of order k can be seen as that of joint distributions in a stochastic PERT graph of an order which is linear in k.
引用
收藏
页码:138 / 185
页数:48
相关论文
共 38 条
[1]  
Asmussen S, 2008, APPL PROBABILITY QUE, V51
[2]   ERGODIC-THEORY OF STOCHASTIC PETRI NETWORKS [J].
BACCELLI, F .
ANNALS OF PROBABILITY, 1992, 20 (01) :375-396
[3]   VIRTUAL CUSTOMERS IN SENSITIVITY AND LIGHT TRAFFIC ANALYSIS VIA CAMPBELL FORMULA FOR POINT-PROCESSES [J].
BACCELLI, F ;
BREMAUD, P .
ADVANCES IN APPLIED PROBABILITY, 1993, 25 (01) :221-234
[4]  
Baccelli F., 1994, Elements of Queueing Theory
[5]  
Baccelli F, 1992, SYNCHRONIZATION LINE
[6]  
Baccelli F., 1995, LARGE TANDEM QUEUEIN
[7]   AN APPLICATION OF GEGENBAUER POLYNOMIALS IN QUEUING THEORY [J].
BAVINCK, H ;
HOOGHIEMSTRA, G ;
DEWAARD, E .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1993, 49 (1-3) :1-10
[8]  
Blanc J. P. C., 1995, STOCH MODELS, V11, P471
[9]   THE POWER-SERIES ALGORITHM APPLIED TO THE SHORTEST-QUEUE MODEL [J].
BLANC, JPC .
OPERATIONS RESEARCH, 1992, 40 (01) :157-167
[10]   FACTORIAL MOMENT EXPANSION FOR STOCHASTIC-SYSTEMS [J].
BLASZCZYSZYN, B .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1995, 56 (02) :321-335