Abstract
In this paper we overview some recent results obtained by the authors and collaborators on the performance bounds analysis of some stochastic Petri net systems. The mathematical model can be seen either as a result of the addition of a particular random timing interpretation to an “autonomous” Petri net or as a generalization of classical queueing networks with the addendum of a general synchronization primitive. It constitutes an adequate tool for both the validation of logical properties and the evaluation of performance measures of concurrent and distributed systems.
Qualitative and quantitative understandings of Petri net models are stressed here making special emphasis on structural techniques for the analysis of logical and performance properties. Important aspects from the performance point of view, such as relative throughput of stations (transitions), and number of servers present at them, are related to Petri net concepts like P- or T-semiflows or liveness bounds of transitions. For the particularly interesting case of Markovian Petri net systems, some improvements of the bounds can be achieved. Marked graphs and free choice are net subclasses for which the obtained results have special quality, therefore an additional attention is focussed on them.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Ajmone Marsan. Stochastic Petri nets: An elementary introduction. In G. Rozenberg, editor, Advances in Petri Nets 1989, volume 424 of LNCS, pages 1–29. Springer-Verlag, Berlin, 1990.
M. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte, and A. Cumani. The effect of execution policies on the semantics and analysis of stochastic Petri nets. IEEE Transactions on Software Engineering, 15(7):832–846, July 1989.
M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2(2):93–122, May 1984.
M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Generalized stochastic Petri nets revisited: Random switches and priorities. In Proceedings of the International Workshop on Petri Nets and Performance Models, pages 44–53, Madison, WI, USA, August 1987. IEEE-Computer Society Press.
M. Ajmone Marsan, G. Balbo, G. Chiola, and S. Donatelli. On the product-form solution of a class of multiple-bus multiprocessor system models. Journal of Systems and Software, 6(1,2):117–124, May 1986.
F. Baskett, K. M. Chandy, R. R. Muntz, and F. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248–260, April 1975.
E. Best. Structure theory of Petri nets: The free choice hiatus. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets 1986 — Part I, volume 254 of LNCS, pages 168–205. Springer-Verlag, Berlin, 1987.
J. Campos. Performance Bounds for Synchronized Queueing Networks. PhD thesis, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, Spain, October 1990. Research Report GISI-RR-90-20.
J. Campos and J. M. Colom. A reachable throughput upper bound for live and safe free choice nets. In Proceedings of the Twelfth International Conference on Application and Theory of Petri Nets, pages 237–256, Gjern, Denmark, June 1991.
J. Campos, G. Chiola, J. M. Colom, and M. Silva. Tight polynomial bounds for steady-state performance of marked graphs. In Proceedings of the 3 rd International Workshop on Petri Nets and Performance Models, pages 200–209, Kyoto, Japan, December 1989. IEEE-Computer Society Press.
J. Campos, G. Chiola, J. M. Colom, and M. Silva. Properties and performance bounds for timed marked graphs. Research Report GISI-RR-90-17, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, Spain, July 1990. To appear in IEEE Transactions on Circuit and Systems.
J. Campos, J. M. Colom, and M. Silva. Performance evaluation of repetitive automated manufacturing systems. In Proceedings of the Rensselaer's Second International Conference on Computer Integrated Manufacturing, pages 74–81, Rensselaer Polytechnic Institute, Troy, NY, USA, May 1990. IEEE-Computer Society Press.
J. M. Colom, J. Campos, and M. Silva. On liveness analysis through linear algebraic techniques. In Proceedings of the Annual General Meeting of ESPRIT Basic Research Action 3148 Design Methods Based on Nets (DEMON), Paris, France, June 1990.
J. Campos, G. Chiola, and M. Silva. Ergodicity and throughput bounds of Petri nets with unique consistent firing count vector. IEEE Transactions on Software Engineering, 17(2):117–125, February 1991.
J. Campos, G. Chiola, and M. Silva. Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control, 36(12):1368–1382, December 1991.
J. Campos, J. M. Colom, and M. Silva. Improving throughput upper bounds for net based models. In Proceedings of the IMACS-IFAC SYMPOSIUM Modelling and Control of Technological Systems, pages 573–582, Lille, France, May 1991. To appear in the IMACS Transactions.
J. Campos and M. Silva. Steady-state performance evaluation of totally open systems of Markovian sequential processes. In M. Cosnard and C. Girault, editors, Decentralized Systems, pages 427–438. Elsevier Science Publishers B.V. (North-Holland), Amsterdam, The Netherlands, 1990.
J. M. Colom and M. Silva. Improving the linearly based characterization of P/T nets. In G. Rozenberg, editor, Advances in Petri Nets 1990, volume 483 of LNCS, pages 113–145. Springer-Verlag, Berlin, 1991.
J. Campos and M. Silva. Embedded queueing networks and the improvement of insensitive performance bounds for Markovian Petri net systems. Research Report GISI-RR-92-10, Departamento de Ingeniería Eléctricae Informática, Universidad de Zaragoza, Spain, February 1992.
J. Campos, B. Sánchez, and M. Silva. Throughput lower bounds for Markovian Petri nets: Transformation techniques. In Proceedings of the 4 rd International Workshop on Petri Nets and Performance Models, pages 322–331, Melbourne, Australia, December 1991. IEEE-Computer Society Press.
Y. Dallery, Z. Liu, and D. Towsley. Equivalence, reversibility and symmetry properties in fork/join queueing networks with blocking. Technical report, MASI 90-32, University Paris 6, 4 Place Jussieu, Paris, France, June 1990.
D. L. Eager and K. C. Sevcik. Performance bound hierarchies for queueing networks. ACM Transactions on Computer Systems, 1(2):99–115, May 1983.
J. Esparza and M. Silva. On the analysis and synthesis of free choice systems. In G. Rozenberg, editor, Advances in Petri Nets 1990, volume 483 of LNCS, pages 243–286. Springer-Verlag, Berlin, 1991.
J. Esparza. Structure Theory of Free Choice Nets. PhD thesis, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, Spain, June 1990. Research Report GISI-RR-90-03.
G. Florin, C. Fraize, and S. Natkin. Stochastic Petri nets: Properties, applications and tools. Microelectronics and Reliability, 31(4):669–698, 1991.
G. Florin and S. Natkin. Les réseaux de Petri stochastiques. Technique et Science Informatiques, 4(1):143–160, February 1985. In French.
W. J. Gordon and G. F. Newell. Closed queueing systems with exponential servers. Operations Research, 15:254–265, 1967.
M. H. T. Hack. Analysis of production schemata by Petri nets. M. S. Thesis, TR-94, M.I.T., Boston, USA, 1972.
L. Kleinrock. Queueing Systems Volume I: Theory. John Wiley & Sons, New York, NY, USA, 1975.
L. Kleinrock. Queueing Systems Volume II: Computer Applications. John Wiley & Sons, New York, NY, USA, 1976.
K. Lautenbach. Linear algebraic calculation of deadlocks and traps. In K. Voss, H. Genrich, and G. Rozenberg, editors, Concurrency and Nets, pages 315–336. Springer-Verlag, Berlin, 1987.
S. S. Lavenberg. A perspective on queueing models of computer performance. Performance Evaluation, 10:53–76, 1989.
J. D. C. Little. A proof of the queueing formula L=λW. Operations Research, 9:383–387, 1961.
E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik. Quantitative System Performance. Prentice-Hall, Inc., Englewood Cliffs, NJ, USA, 1984.
M. K. Molloy. Performance analysis using stochastic Petri nets. IEEE Transaction on Computers, 31(9):913–917, September 1982.
M.K. Molloy. Fast bounds for stochastic Petri nets. In Proceedings of the International Workshop on Timed Petri Nets, pages 244–249, Torino, Italy, July 1985. IEEE-Computer Society Press.
T. Murata. Petri nets: Properties, analysis, and applications. Proceedings of the IEEE, 77(4):541–580, April 1989.
G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd, editors. Optimization, volume 1 of Handbooks in Operations Research and Management Science. North-Holland, Amsterdam, The Netherlands, 1989.
J.L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, Englewood Cliffs, NJ, USA, 1981.
Proceedings of the International Workshop on Petri Nets and Performance Models, Madison, WI, USA, August 1987. IEEE-Computer Society Press.
Proceedings of the 3rdInternational Workshop on Petri Nets and Performance Models, Kyoto, Japan, December 1989. IEEE-Computer Society Press.
Proceedings of the 4rdInternational Workshop on Petri Nets and Performance Models, Melbourne, Australia, December 1991. IEEE-Computer Society Press.
C. Ramchandani. Analysis of Asynchronous Concurrent Systems by Petri Nets. PhD thesis, MIT, Cambridge, MA, USA, February 1974.
C. V. Ramamoorthy and G. S. Ho. Performance evaluation of asynchronous concurrent systems using Petri nets. IEEE Transactions on Software Engineering, 6(5):440–449, September 1980.
M. Reiser and S. S. Lavenberg. Mean value analysis of closed multichain queueing networks. Journal of the ACM, 27(2):313–322, April 1980.
S. M. Ross. Stochastic Processes. John Wiley & Sons, New York, NY, USA, 1983.
M. Silva and J. M. Colom. On the computation of structural synchronic invariants in P/T nets. In G. Rozenberg, editor, Advances in Petri Nets 1988, volume 340 of LNCS, pages 386–417. Springer-Verlag, Berlin, 1988.
J. Sifakis. Use of Petri nets for performance evaluation. Acta Cybernetica, 4(2):185–202, 1978.
M. Silva. Las Redes de Petri en la Automática y la Informática. Editorial AC, Madrid, 1985. In Spanish.
C. H. Sauer, E. A. MacNair, and J. F. Kurose. The research queueing package: past, present, and future. In Proceedings of the 1982 National Computer Conference. AFIPS, 1982.
J. G. Shanthikumar and D. D. Yao. The effect of increasing service rates in a closed queueing network. Journal of Applied Probability, 23:474–483, 1986.
Proceedings of the International Workshop on Timed Petri Nets, Torino, Italy, July 1985. IEEE-Computer Society Press.
M. Vernon, J. Zahorjan, and E. D. Lazowska. A comparison of performance Petri nets and queueing network models. In Proceedings of the 3 rd International Workshop on Modelling Techniques and Performance Evaluation, pages 181–192, Paris, France, March 1987. AFCET.
J. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Galler. Balanced job bound analysis of queueing networks. Communications of the ACM, 25(2):134–141, February 1982.
W. M. Zuberek. Timed Petri nets: Definitions, properties and applications. Microelectronics and Reliability, 31(4):627–644, 1991.
W. M. Zuberek and M. S. Zuberek. Transformations of timed Petri nets and performance analysis. In Proceedings of the Midwest Simposium on Circuits and Systems'90 (Special Session on Petri Net Models), pages 1–5, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campos, J., Silva, M. (1992). Structural techniques and performance bounds of stochastic Petri net models. In: Rozenberg, G. (eds) Advances in Petri Nets 1992. Lecture Notes in Computer Science, vol 609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55610-9_178
Download citation
DOI: https://doi.org/10.1007/3-540-55610-9_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55610-7
Online ISBN: 978-3-540-47258-2
eBook Packages: Springer Book Archive