Abstract
Petri nets are useful for modelling complex concurrent systems. While modelling using Petri nets focusses on local states and actions, the analysis methods are concerned with global states and their transitions. Unfortunately generation of the complete state space suffers from the well-known state space explosion problem. This paper presents a method to overcome the state-space explosion problem for a class of Generalised Stochastic Petri Nets (GSPNs). Large complex GSPN models are transformed into smaller, less complex ones with smaller state spaces than the original models. This transformation is called aggregation. The aim of aggregation is to reduce the state space while preserving the desired behaviour of the original model. In this paper we investigate the aggregation of GSPNs preserving time dependent behaviour by using recent [5,6] and newly developed transformation rules. These rules are used to merge several single timed transitions into one merged transition. The firing rate of the merged transition turns out to be dependent on the marking of the net. Beside the introduction of a new method for the aggregation of exponential transitions with fixed firing rates, new formulae to aggregate transitions with marking-dependent firing rates are presented. Successive aggregation becomes possible to transform very complex models into models in which either a closed-form computation of the stationary state distribution is available or which has a very small state space. A prototype implementation is used to demonstrate both the drastically reduced state space for suitable models and the general limits of the method.
This is a preview of subscription content, log in via an institution to check access.
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
Bolch, G., Greiner, S., de Meer, H., Trivedi, K.: Queueing Networks and Markov Chains. In: Modeling and Performance Evaluation with Computer Science Applications. John Wiley & Sons, Chichester (1998)
Boucherie, R.: A characterization of independence for competing Markov chains with applications to stochastic Petri nets. IEEE Transactions on Software Engineering 20(7), 536–544 (1994)
Curiel, M., Puigjaner, R.: Using load-dependent servers to reduce the complexity of large client-server simulation models. In: Dumke, R.R., Rautenstrauch, C., Schmietendorf, A., Scholz, A. (eds.) WOSP 2000 and GWPESD 2000. LNCS, vol. 2047, pp. 131–147. Springer, Heidelberg (2001)
Donatelli, S., Sereno, M.: On the product-form solution for stochastic Petri nets. In: Proc. 13th Int. Conf. on Application and Theory of Petri Nets, pp. 154–172 (1992)
Freiheit, J.: Matrizen- und zustandsraumreduzierende Verfahren zur Leistungsbewertung großer stochastischer Petrinetze. PhD thesis, TU Berlin (June 2002)
Freiheit, J., Heindl, A.: Novel formulae for GSPN aggregation. In: The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), Fort Worth, Texas, pp. 209–216 (2002)
Henderson, W., Lucic, D.: Exact results in the aggregation and disaggregation of stochastic Petri nets. In: Proc. 4th Int. Workshop on Petri Nets and Performance Models, Melbourne, Australia, pp. 166–175 (1991)
Jungnitz, H., Sánchez, B., Silva, M.: Response time approximation for the performance analysis of manufacturing systems modeled with stochastic marked graphs. In: Proc. Int. Conf. on Robotics and Automation, Nice, pp. 1000–1005 (1992)
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. John Wiley and Sons, Chichester (1995)
Murray Woodside, C., Li, Y.: Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In: Proc. 4th Int. Workshop on Petri Nets and Performance Models, Melbourne, Australia, pp. 64–73 (1991)
Natkin, S.: Les Reseaux de Petri Stochastiques et leur Application a L’evaluation des Systémes Informatiques. Dissertation, Conservatoire National des Arts et Metiers (CNAM), Paris (1980)
Pérez-Jiménez, C.J., Campos, J.: On state space decomposition for the numerical analysis of stochastic Petri nets. In: Proceedings of the 8th International Workshop on Petri Nets and Performance Models, Zaragoza, Spain, September 1999, pp. 32–41 (1999)
Reisig, W.: Petri nets. EATCS Monographs on Theoretical Computer Science 4 (1985)
Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press, Princeton (1994)
Symons, F.J.W.: Modeling and analysis of communication protocols using numerical Petri nets. Dissertation. University of Essex (1978)
Trivedi, K.S.: Probability and Statistics with Reliability, Queueing, and Computer Science Applications. Prentice-Hall, Inc., Englewood Cliffs (1982)
Zimmermann, A., Freiheit, J., German, R., Hommel, G.: Petri net modelling and performability evaluation with TimeNET 3.0. In: Proc. 11th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Chicago, USA, pp. 188–202 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freiheit, J., Billington, J. (2003). New Developments in Closed-Form Computation for GSPN Aggregation. In: Dong, J.S., Woodcock, J. (eds) Formal Methods and Software Engineering. ICFEM 2003. Lecture Notes in Computer Science, vol 2885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39893-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-39893-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20461-9
Online ISBN: 978-3-540-39893-6
eBook Packages: Springer Book Archive