Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-23T13:52:05.514Z Has data issue: false hasContentIssue false
  • English
  • Français

On closed support T-Invariants and the traffic equations

Part of: Special processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Richard J. Boucherie  and
Matteo Sereno
Richard J. Boucherie*
Affiliation:
Universiteit van Amsterdam
Matteo Sereno*
Affiliation:
Università di Torino
*
∗Postal address: Department of Econometrics, Universiteit van Amsterdam, Roetersstraat 11, 1018 WB Amsterdam, The Netherlands. E-mail address: boucheri@butler.fee.uva.nl
∗∗Postal address: Dipartimento di Informatica, Università di Torino, Corso Svizzera 185, 10149 Torino, Italy.
Get access Rights & Permissions [Opens in a new window]

Abstract

The traffic equations are the basis for the exact analysis of product form queueing networks, and the approximate analysis of non-product form queueing networks. Conditions characterising the structure of the network that guarantees the existence of a solution for the traffic equations are therefore of great importance. This note shows that the new condition stating that each transition is covered by a minimal closed support T-invariant, is necessary and sufficient for the existence of a solution for the traffic equations for batch routing queueing networks and stochastic Petri nets.

Keywords

Traffic equationsclosed support T-invariantqueueing networkPetri net

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B22: Queues and service
Type
Research Papers
Information
Journal of Applied Probability , Volume 35 , Issue 2 , June 1998 , pp. 473 - 481
Copyright
Copyright © Applied Probability Trust 1998 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ajmone Marsan, M., Balbo, G., Bobbio, A., Chiola, G., Conte, G., and Cumani, A. (1989). The effect of execution policies on the semantics and analysis of stochastic Petri nets. IEEE Trans. Software Eng. 15, 832–846.CrossRefGoogle Scholar
Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G. (1975). Open, closed and mixed networks of queues with different classes of customers. J. ACM 22, 248–260.CrossRefGoogle Scholar
Boucherie, R.J., and Van Dijk, N.M. (1991). Product forms for queueing networks with state dependent multiple job transitions. Adv. Appl. Prob. 23, 152–187.Google Scholar
Donatelli, S., and Sereno, M. (1992). On the product form solution for stochastic Petri nets. In Proc. 13th International Conference on Application and Theory of Petri Nets, Sheffield, UK, pp. 154–172.CrossRefGoogle Scholar
Frosch, D., and Natarajan, K. (1992). Product form solutions for closed synchronized systems of stochastic sequential processes. In Proc. 1992 International Computer Symposium, Taichung, Taiwan, pp. 392–402.Google Scholar
Henderson, W., Lucic, D., and Taylor, P.G. (1989). A net level performance analysis of stochastic Petri nets. J. Austral. Math. Soc. Series B 31, 176–187.Google Scholar
Henderson, W., Pearce, C.E. M., Taylor, P.G., and Van Dijk, N.M. (1990). Closed queueing networks with batch services. Queueing Systems 6, 59–70.Google Scholar
Henderson, W., and Taylor, P.G. (1991). Some new results on queueing networks with batch movement. J. Appl. Prob. 28, 409–421.Google Scholar
Lazar, A.A., and Robertazzi, T.G. (1991). Markovian Petri net protocols with product form solution. Performance Evaluation 12, 67–77.CrossRefGoogle Scholar
Martinez, J., and Silva, M. (1982). A simple and fast algorithm to obtain all invariants of a generalized Petri net. In Application and theory of Petri nets – selected papers from the 1st and 2nd European Workshop on Application and Theory of Petri Nets, ed. Girault, C. and Resig, W. (Informatik–Fachberichte 52.) Springer-Verlag, pp. 301–310.Google Scholar
Memmi, G., and Roucairol, G. (1979). Linear algebra in net theory. In Net Theory and Applications, – Proc. Advanced Course on General Net Theory of Processes and Systems, Hamburg. (Lecture Notes in Computer Science 84,.) Pp. 213–223.Google Scholar
Molloy, M.K. (1982). Performance analysis using stochastic Petri nets. IEEE Trans. Computers 31, 913–917.CrossRefGoogle Scholar
Murata, T. (1989). Petri nets: properties, analysis and applications. In Proc. IEEE 77, 541–580.Google Scholar
Silva, M. (1985). Las Redes de Petri en la Automatica y la Informatica. Editorial AC, Madrid, Spain. (In Spanish.)Google Scholar