Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-13T04:05:04.267Z Has data issue: false hasContentIssue false
  • English
  • Français

A net level performance analysis of stochastic Petri nets

Published online by Cambridge University Press:  17 February 2009

W. Henderson ,
D. Lucic  and
P. G. Taylor
W. Henderson
Affiliation:
Applied Mathematics Department, University of Adelaide, South Australia 5001.
D. Lucic
Affiliation:
Applied Mathematics Department, University of Adelaide, South Australia 5001.
P. G. Taylor
Affiliation:
Mathematics Department, University of Western Australia, Australia.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Stochastic Petri Nets are used extensively to find performance measures for communication protocols. This paper illustrates how equilibrium distributions for the markings of a wide class of nets can be found directly without the need to generate a large state space and then resort to equilibrium balance equations.

Type
Research Article
Information
The ANZIAM Journal , Volume 31 , Issue 2 , October 1989 , pp. 176 - 187
Copyright
Copyright © Australian Mathematical Society 1989

References

[1]Balbo, G., Bruell, S. and Ghanta, S., “Combining queueing network and generalized stochastic Petri net models for the analysis of some software blocking phenomena”, IEEE SE-12, No. 4 (1986) 561–576.Google Scholar
[2]Billington, J., “Protocol Engineering and Nets”, Proc. Workshop on Appl. and Theo. of Petri Nets, Zaragoza (1987) 137–156.Google Scholar
[3]Billington, J., Wheeler, G. and Wilbur-Han, M. C., “Protean: a high level Petri net tool for the specification and verification of communication protocols”, IEEE Trans. Soft. Eng. SE-14 (1988).CrossRefGoogle Scholar
[4]Buzen, J. P., “Computational algorithm for closed networks with exponential servers”, Comm. Assoc. Comput. Mach, 16 (1973) 527–531.Google Scholar
[5]Florin, G. and Natkin, S., “Evaluation based upon stochastic Petri nets of the maximum throughput of a full duplex protocol”, in Appl. and Theo. of Petri Nets, (eds: Girault, C. and Reisig, W.), Informatic-Fachberichte, 52 (1985) 280–288.CrossRefGoogle Scholar
[6]Henderson, W., Pearce, C. E. M., Taylor, P. G. and van Dijk, N. M., “Closed queueing networks and batch services”, submitted 1988.Google Scholar
[7]Henderson, W. and Taylor, P., “Open networks of queues with batch arrivals and batch services”, submitted 1988.Google Scholar
[8]Kelly, F., Reversibility and stochastic networks, (Wiley, London, 1979).Google Scholar
[9]Marson, M. A., Balbo, G. and Conti, G., “A class of generalised stochastic Petri nets for the performance evaluation of multiprocessor systems”, ACM Trans. Comp. Syst. 2 (1984) 93–122.CrossRefGoogle Scholar
[10]Marsan, M. A., Chiola, G. and Fumagalli, A., “An accurate performance model of CSMA/CD Bus LAN”, Euro. Workshop on Appl. and Theo. of Petri Nets 7 (1986).Google Scholar
[11]Peterson, J. L., Petri net theory and the modeling of systems (Prentice-Hall, 1981).Google Scholar
[12]Reiser, M., “Mean value analysis and convolutional method for queue dependent servers in closed queueing networks”, Perf. Eval. 1 (1981) 7–18.CrossRefGoogle Scholar
[13]Symons, F. J. W., “Introduction to numerical Petri nets, a general graphical model of concurrent processing systems”, Aust. Tele. Res. 14 (1980).Google Scholar