Performance Bounds for Stochastic Timed Petri Nets

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 problems of practical sizes. In this paper, we provide a method to compute efficiently upper and lower bounds for the throughputs and mean token numbers in general Markovian timed Petri nets. Our approach is based on uniformization technique and linear programming.

[1]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[2]  Joel Moses,et al.  Algebraic simplification: a guide for the perplexed , 1971, CACM.

[3]  Manuel Silva Suárez,et al.  Embedded Product-Form Queueing Networks and the Improvement of Performance Bounds for Petri Net Systems , 1993, Perform. Evaluation.

[4]  Marco Ajmone Marsan,et al.  Generalized Stochastic Petri Nets: A Definition at the Net Level and Its Implications , 1993, IEEE Trans. Software Eng..

[5]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[6]  Kishor S. Trivedi,et al.  Extended Stochastic Petri Nets: Applications and Analysis , 1984, Performance.

[7]  P. Konstantopoulos,et al.  Estimates of cycle times in stochastic petri nets , 1992 .

[8]  Giovanni Chiola,et al.  Operational analysis of timed Petri nets and application to the computation of performance bounds , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[9]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[10]  François Baccelli,et al.  Parallel simulation of stochastic Petri nets using recurrence equations , 1993, TOMC.

[11]  Hisashi Kobayashi,et al.  Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms , 1975, IBM J. Res. Dev..

[12]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[13]  F. Baccelli,et al.  Stationary regime and stability of free-choice Petri nets , 1994 .

[14]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.

[15]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[16]  Marco Ajmone Marsan,et al.  The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets , 1989, IEEE Trans. Software Eng..

[17]  Richard J. Boucherie.  A Characterization of Independence for Competing Markov Chains with Applications to Stochastic Petri Nets , 1994, IEEE Trans. Software Eng..

[18]  F. Baccelli,et al.  Comparison properties of stochastic decision free Petri nets , 1992 .

[19]  Giovanni Chiola,et al.  Ergodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector , 1991, IEEE Trans. Software Eng..

[20]  Michael K. Molloy.  Performance Analysis Using Stochastic Petri Nets , 1982, IEEE Transactions on Computers.

[21]  François Baccelli,et al.  Recursive equations and basic properties of timed Petri nets , 1991 .

[22]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[23]  Manuel Silva Suárez,et al.  Throughput lower bounds for Markovian Petri nets: transformation techniques , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[24]  P. R. Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..

[25]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[26]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[27]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[28]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[29]  F. Baccelli.  Ergodic Theory of Stochastic Petri Networks , 1992 .

[30]  J. Tsitsiklis,et al.  Branching bandits and Klimov's problem: achievable region and side constraints , 1995, IEEE Trans. Autom. Control..

[31]  K. Mani Chandy,et al.  Computational algorithms for product form queueing networks , 1980 .

[32]  Manuel Silva,et al.  Properties and performance bounds for closed free choice synchronized monoclass queueing networks , 1991 .

[33]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.