This Article 
 Bibliographic References 
 Add to: 
Embedded Processes in Stochastic Petri Nets
February 1991 (vol. 17 no. 2)
pp. 108-116

Embedded discrete time processes are used to study a class of SPNs (stochastic Petri nets) which have a closed-form equilibrium distribution. These SPNs have probabilistic output bags, colored tokens, and alternating periods of arbitrarily distributing enabling and firing times (periods of time between transitions becoming enabled and absorption of tokens and between transitions absorbing tokens and depositing them in output places, respectively). In addition, an aggregation procedure is proposed which, in certain nets, not only reduces a complex SPN to a much simpler skeleton SPN but also obtains results for the skeleton SPN with are exact marginal distributions for the original SPN.

[1] G. Balbo, S. Bruell, and S. Ghanta, "Combining queueing network and generalized stochastic Petri net models for the analysis of some software blocking phenomena,"IEEE Trans. Software Eng., vol. SE-12, no. 4, pp. 561-576, 1986.
[2] G. Balbo, S. Bruell, and S. Ghanta, "Combining queueing networks and generalized stochastic Petri nets for the solution of complex models of system behavior,"IEEE Trans. Comput., vol. 37, no. 10, pp. 1251-1268, 1988.
[3] F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, "Open, closed, and mixed networks of queues with different classes of customers,"J. ACM, vol. 22, no. 2, pp. 248-260, 1975.
[4] J. Billington, G. Wheeler, and M. C. Wilbur-Han, "Protean: A high level Petri net tool for the specification and verification of communication protocols,"IEEE Trans. Software Eng., vol. 14, pp. 301-316, 1988.
[5] J. P. Buzen, "Computational algorithms for closed queueing networks with exponential servers,"Commun. ACM, vol. 16, no. 9, Sept. 1973.
[6] K. M. Chandy, J. H. Howard, and D. F. Towsley, "Product form and local balance in queueing networks,"J. ACM, vol. 24, pp. 250-263, 1977.
[7] K. M. Chandy and A. J. Martin, "A characterization of product form queueing networks,"J. ACM, vol. 30, pp. 286-299, 1983.
[8] J. Day, W. Henderson, and P.G. Taylor, "Performance analysis of stochastic Petri nets using PROTEAN," inProc. 4th Australian Teletraffic Seminar, Bond Univ., Dec. 1989.
[9] G. Florin and S. Natkin, "Evaluation based upon stochastic Petri nets of the maximum throughput of a full duplex protocol," inApplications and Theory of Petri Nets(Informatic-Fachberichte, vol. 52), C. Girault and W. Reisig, Eds., 1985, pp. 280-288.
[10] P. J. Haas and G. S. Shedler, "Stochastic Petri nets with timed and immediate transitions,"Commun. Stat. Stochastic Models, vol. 5, DO. 563-600, 1989.
[11] W. Henderson, "Performance analysis: When do we give up on product form solutions?" inProc. ITC Spec. Sem., Adelaide, Australia, Sept. 1989.
[12] W. Henderson, D. Lucic, and P. G. Taylor, "A net level performance analysis of stochastic Petri nets,"J. Aust. Math. Soc. (Special Issue on Telecommunications), series B, vol. 31, pp. 176-187, 1989.
[13] W. Henderson, C. E. M. Pearce, P. G. Taylor, and N. M. Van Dijk, "Closed queueing networks and batch services,"Queueing Syst., vol. 6, pp. 59-70, 1990.
[14] W. Henderson and P. G. Taylor, "Open networks of queues with batch arrivals and batch services,"Queueing Syst., vol. 6, pp. 71-88, 1990.
[15] A. Hordijk and N. M. Van Dijk, "Networks of queues," inProc. Int. Seminar Modelling and Performance Evaluation Methodology, INRIA, vol. 1, pp. 79-135.
[16] J. Jackson, "Networks of waiting lines,"Oper. Res., vol. 5, pp. 518-521, 1957.
[17] J. Jackson, "Jobshop-like queueing systems,"Management Sci., vol. 10, pp. 131-142, 1963.
[18] F. Kelly,Reversibility and Stochastic Networks. London: Wiley, 1979.
[19] F. Kelly, "Networks of queues,"Adv. Appl. Prob., vol. 8, pp. 416-432, 1976.
[20] A. A. Lazar and T. G. Robertazzi, "The lattice structure of a bus oriented multiprocessor model," inProc. 25th Allerton Conf. Communication, 1987.
[21] M. Ajmone Marsan, G. Balbo, and G. Conte, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems,"ACM Trans. Comput. Syst., vol. 2, pp. 93-122, May 1984.
[22] J. L. Peterson,Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
[23] R. R. Razouk and C. V. Phelps, "Performance analysis using timed Petri nets,"Int. Conf. Parallel Processing, 1984, pp. 126-128.
[24] M. Reiser and S. Lavenberg, "Mean value analysis of closed multichain queueing networks,"J. ACM, vol. 27, no. 2, Apr. 1980.
[25] R. Serfozo, "Markovian network processes with system-dependent transition rates," 1988, preprint.
[26] J. Walrand, "A discrete-time queueing network,"J. Appl. Prob., vol. 20, pp. 903-909, 1983.
[27] D. L. Woo, C. V. Phelps, and R. D. Sidwell, "Timed Petri nets probability semantics," inProc. Seventh European Workshop Application and Theory of Petri Nets, Oxford, England, 1986.

Index Terms:
embedded discrete time processes; stochastic Petri nets; closed-form equilibrium distribution; probabilistic output bags; colored tokens; arbitrarily distributing enabling; firing times; aggregation procedure; performance evaluation; Petri nets; stochastic processes
W. Henderson, P.G. Taylor, "Embedded Processes in Stochastic Petri Nets," IEEE Transactions on Software Engineering, vol. 17, no. 2, pp. 108-116, Feb. 1991, doi:10.1109/32.67592
Usage of this product signifies your acceptance of the Terms of Use.