Up: Queueing Petri NetsA Formalism
Previous: Conclusions
References
- 1
- M. Ajmone-Marsan. Stochastic Petri Nets: an elementary introduction.
Advances in Petri Nets. G. Rozenberg (ed.), Lecture Notes in Computer Science 424,
1989, pp. 1-29.
- 2
- M. Ajmone-Marsan, G. Balbo, G. Conte.
A class of Generalized Stochastic Petri Nets for the performance evaluation
of multiprocessor systems.
ACM Transactions on Computer Systems, Vol. 2, No. 2, May 1984, pp. 93-122.
- 3
- M. Ajmone-Marsan, G. Balbo, G. Conte. Performance models of
multiprocessor systems. MIT Press, London, 1986.
- 4
- G. Balbo, S.C. Bruell, S. Ghanta.
Combining Queueing Networks and Generalized Stochastic Petri Nets
for the solution of complex models of system behaviour.
IEEE Transactions on Computers, Vol. 37, No. 10, Oct. 1988, pp. 1251-1268.
- 5
- F. Bause, H. Beilner. Eine Modellwelt zur Integration von Warteschlangen-
und Petri-Netz-Modellen. Proceedings of the 5. GI/ITG-Fachtagung "Messung, Modellierung
und Bewertung von Rechensystemen und Netzen", Braunschweig, 1989, pp. 190-204.
- 6
- F. Bause, H. Beilner. Analysis of a combined Queueing-Petri-Network
World.
Forschungsbericht Nr. 383 des Fachbereichs Informatik der Universität
Dortmund, 1991.
- 7
- F. Bause. Funktionale Analyse
zeitbehafteter Petri-Netze. DeutscherUniversitätsVerlag, Wiesbaden,
1992.
- 8
- F. Bause, P. Kemper. QPN-Tool USERS's GUIDE. LS Informatik 4,
Universität Dortmund, 1991.
- 9
- E. Best. Structure theory of Petri Nets: the free choice hiatus.
Petri Nets. Central Models and Their Properties.
Advances in Petri Nets. Proceedings of an Advanced Course,
Bad Honnef, Sept. 1986, Part I,
G. Rozenberg (ed.), Lecture Notes in Computer Science 254, 1986, pp. 168-205.
- 10
- C.-R. Chou.
Performance Evaluation of concurrent programs modeled by timed
PQ-net. 11th International Computer Software &Applications Conference
(COMPSAC), Tokio, Oct. 1987.
- 11
- K. Jensen.
Coloured Petri Nets; Basic Concepts, Analysis Methods and
Practical Use. Vol. 1, EATCS Monographs on Theoretical Computer Science,
Springer, 1992.
- 12
- P. Kemper, F. Bause.
An Efficient Polynomial-Time Algorithm to decide Liveness and Boundedness of
Free-Choice Nets. 13th International Conference on Application and
Theory of Petri Nets, Sheffield, 1992.
- 13
-
R. Lal, U.N. Bhat: Reduced systems in Markov chains and their
applications in queueing theory. Queueing Systems, No. 2, 1987,
pp. 147-172.
- 14
- J.L. Peterson.
Petri Net theory and the modeling of systems. Englewood
Cliffs, New Jersey, 1981.
- 15
- C.H. Sauer, E.A. MacNair, J.F. Kurose. The research queueing package:
past, present, and future. Proceedings of the National Computer Conference, AFIPS
Vol. 51,
1982, pp. 273-280.
- 16
- M. Vernon, J. Zahorjan, E.D. Lazowska.
A comparison of performance Petri
Nets and Queueing Network models. Proceedings on the International
Workshop on Modelling
Techniques and Performance Evaluation, Paris, 1987, pp. 191-202.
Up: Queueing Petri NetsA Formalism
Previous: Conclusions