Abstract
Stochastic Petri Nets and their generalizations are powerful formalisms for the specification of stochastic processes. In their original definition they do not provide any specification for the token extraction order applied by a transition to its input places, however this aspect may be relevant if timed transitions are interpreted as servers and tokens as customers, so that the extraction order may be interpreted as a scheduling policy. In this paper we discuss how the token scheduling policies different from the Random Order one which is assumed by default, may be relevant for the computation of average performance indices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. J. Wiley, New York, NY, USA, 1995.
G. Balbo, M. Beccuti, M. De Pierro, and G. Franceschinis. First passage time computation in Tagged GSPN with queue places. Computer Journal, 2010. Accepted for publication.
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, 22(2): 248–260, 1975.
F. Bause and P.S. Kritzinger. Stochastic Petri Nets – An Introduction to the Theory. Friedr. Vieweg & Sohn Verlag, Braunschweig/Wiesbaden, Germany, Second Edition, 2002.
G Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed coloured nets for symmetric modelling applications. IEEE Trans. on Computers, 42(11): 1343–1360, November 1993.
E. Gelenbe and I. Mitrani. Analysis and Synthesis of Computer Systems. Academic Press, London, 1980.
L. Kleinrock. Queueing Systems. Volume 1 : Theory. J. Wiley, New York, NY, USA, 1975.
Samuel Kounev. Performance Modeling and Evaluation of Distributed Component-Based Systems Using Queueing Petri Nets. IEEE Trans. Softw. Eng., 32(7): 486–502, 2006.
M. K. Molloy. Performance analysis using Stochastic Petri Nets. IEEE Tr. on Computers, 31(9): 913–917, 1982.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balbo, G., Beccuti, M., De Pierro, M., Franceschinis, G. (2011). Stochastic Petri Nets Sensitivity to Token Scheduling Policies. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)