Abstract
In the area of the numerical analysis of stochastic Petri Nets we present an algorithm which enables the reduction of storage requirements for generator matrices of the underlying Markov chain. We show that neither the generator matrix nor “parts” of them need be generated and stored. The solvable model class contains the superposed stochastic automatas defined by Donatelli [2] as a special case. The state spaces of the underlying Markov chains in the examples range from about 107 up to 108 states with up to 109 matrix entries and we show that for such models a solution is possible. Further, this algorithm can be easily integrated in tools which contain iterative numerical solution techniques.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Buchholz, P. Hierarchies in colored GSPNs. Application and Theory of Petri Nets, Springer LNCS 691, 1993, pp. 106–125.
Donatelli, S. Superposed Stochastic Automata: A class of Stochastic Petri nets amenable to parallel solution. Proc. of the Fourth Intern. Workshop on Petri Nets and Performance Models (PNPM91), Melbourne (Australia), 1991, pp. 54–63.
Donatelli, S. Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Performance Evaluation, North-Holland, 1993, Vol.18, pp. 21–36.
Knaup, W. Algebraische Strukturen in einfachen Warteschlangen-Netzen. Verlag Hänsel-Hohenhausen, Egelsbach (Germany), 1994.
Knaup, W. A New Iterative Numerical Solution Algorithm for Markovian Queueing Networks. In H. Beilner, F. Bause (eds.); Quantitative Evaluation of Computing and Communication Systems, Springer LNCS 977, 1995, pp. 194–208.
Krieger, U.R., Müller-Clostermann, B. and Sczittnick, M. Modelling and Analysis of Communication Systems Based on Computational Methods for Markov Chains. IEEE J. Sel. Areas in Com., Vol.8, No.9, December 1990, pp. 1630–1648.
Plateau, B. On the stochastic structure of parallelism and synchronization models for distributed models. ACM Sigmetrics Conference on Measurement and Modelling of Computer Systems, Austin, August 1985.
Plateau, B., Fourneau, J.M. and Lee, K.H. PEPS: A package for solving complex Markov models of parallel systems. Fourth Intern. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, Palma (Mallorca), Sept., 1988.
Williamson, S.G. Combinatorics for Computer Science. Comp. Sc. Press, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knaup, W. (1996). A new iterative numerical solution algorithm for a class of stochastic Petri Nets. In: Billington, J., Reisig, W. (eds) Application and Theory of Petri Nets 1996. ICATPN 1996. Lecture Notes in Computer Science, vol 1091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61363-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-61363-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61363-3
Online ISBN: 978-3-540-68505-0
eBook Packages: Springer Book Archive