Performance analysis of stochastic timed Petri Nets using linear programming approach

被引：17

作者：

Liu, Z ^{[1
]}

机构：

[1] INRIA, Ctr Sophia Antipolis, F-06902 Sophia Antipolis, France

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1998年 / 24卷 / 11期

关键词：

stochastic timed Petri net; performance bound; throughput; mean token number; uniformization; linear programming;

D O I：

10.1109/32.730548

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Stochastic timed Petri nets are a useful tool in performance analysis of concurrent systems such as parallel computers, communication networks, and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are difficult to obtain for practical problems due to their sizes. In this paper, we provide a method to compute efficiently upper and lower bounds for the throughputs and mean token numbers for a large class of stochastic timed Petri nets. Our approach is based on uniformization technique and linear programming.

引用

页码：1014 / 1030

页数：17

共 54 条

[1]

Ajmone Marsan M., 1986, PERFORMANCE MODELS M

[2] QUEUING MODELS FOR SYSTEMS WITH SYNCHRONIZATION CONSTRAINTS [J].

BACCELLI, F ;

MAKOWSKI, AM .

PROCEEDINGS OF THE IEEE, 1989, 77 (01) :138-161

[3] Free-choice Petri nets - An algebraic approach [J].

Baccelli, F ;

Foss, S ;

Gaujal, B .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) :1751-1778

[4] COMPARISON PROPERTIES OF STOCHASTIC DECISION FREE PETRI NETS [J].

BACCELLI, F ;

LIU, Z .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (12) :1905-1920

[5] ERGODIC-THEORY OF STOCHASTIC PETRI NETWORKS [J].

BACCELLI, F .

ANNALS OF PROBABILITY, 1992, 20 (01) :375-396

[6]

BACCELLI F, 1992, LECT NOTES CONTR INF, V177, P1

[7]

Baccelli F., 1993, ACM Transactions on Modeling and Computer Simulation, V3, P20, DOI 10.1145/151527.151545

[8]

Baccelli F., 1992, Journal of Dynamical Discrete Event Systems, V1, P415

[9]

Baccelli F., 1994, Elements of Queueing Theory

[10]

BACCELLI F, 1994, PERFORMANCE EVALUATI

← 1 2 3 4 5 6 →