Abstract
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of parallel and distributed systems. However, iterative numerical algorithms, even well-fitted to a multidimensional structured representation of Markov chains, still face the state space explosion problem. Discrete-event simulations can estimate the stationary distribution based on long run trajectories and are also alternative methods to estimate performance indexes of models. Perfect simulation algorithms directly build steady-state samples avoiding the warm-up period and the initial state bias of forward simulations. This paper introduces the concepts of backward coupling and the advantages of monotonicity properties and component-wise characteristics to simulate Stochastic Automata Networks (SAN). The main contribution is a novel technique to solve SAN descriptions originally unsolvable by iterative methods due to large state spaces. This method is extremely efficient when the state space is large and the model has dynamic monotonicity because it is possible to contract the reachable state space in a smaller set of maximal states. Component-wise characteristics also contribute to the state space reduction extracting extremal states of the model underlying chain. The efficiency of this technique applied to sample generation using perfect simulation is compared to the overall efficiency of using an iterative numerical method to predict performance indexes of SAN models.
The order of the authors is merely alphabetical.
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
Stewart, W.J.: Introduction to the numerical solution of Markov chains. Princeton University Press, Princeton (1994)
Plateau, B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: ACM Sigmetrics Conference on Measurements and Modeling of Computer Systems, pp. 147–154. ACM Press, New York (1985)
Benoit, A., Fernandes, P., Plateau, B., Stewart, W.J.: On the benefits of using functional transitions and Kronecker algebra. Performance Evaluation (in Press, 2004)
Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memory efficient Kronecker operations with applications to the solution of Markov models. INFORMS Journal on Computing 13(3), 203–222 (2000)
Fernandes, P., Plateau, B., Stewart, W.J.: Efficient vector-descriptor multiplication in Stochastic Automata Networks. Journal of the ACM 45(3), 381–414 (1998)
Buchholz, P., Kemper, P.: Hierarchical reachability graph generation for Petri nets. Formal Methods in Systems Design 21(3), 281–315 (2002)
Miner, A.S., Ciardo, G.: Efficient Reachability Set Generation and Storage Using Decision Diagrams. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, vol. 1639, pp. 6–25. Springer, Heidelberg (1999)
Jungblut-Hessel, R., Plateau, B., Stewart, W.J., Ycart, B.: Fast simulation for Road Traffic Network. RAIRO Operational Research 35, 229–250 (2001)
Häggström, O.: Finite Markov Chains and Algorithmic Applications. Based on lecture notes. Cambridge University Press, Cambridge (2002)
Propp, J.G., Wilson, D.B.: Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics. Random Structures and Algorithms 9(1-2), 223–252 (1996)
Plateau, B., Atif, K.: Stochastic Automata Networks for modelling parallel systems. IEEE Transactions on Software Engineering 17(10), 1093–1108 (1991)
Brenner, L., Fernandes, P., Sales, A.: The Need for and the Advantages of Generalized Tensor Algebra for Kronecker Structured Representations. In: 20th Annual UK Performance Engineering Workshop, Bradford, UK, July 2004, pp. 48–60 (2004)
Glasserman, P., Yao, D.D.: Monotone structure in discrete-event systems. John Wiley & Sons, Inc., New York (1994)
Borovkov, A.A., Foss, S.G.: Two ergodicity criteria for stochastically recursive sequences. ACTA Applicande Math. 34, 125–134 (1994)
Stenflo, O.: Ergodic Theorems for Markov chains represented by Iterated Function Systems. Bull. Polish Acad. Sci. Math. 49(1), 27–43 (2001)
Benoit, A., Brenner, L., Fernandes, P., Plateau, B., Stewart, W.J.: The PEPS Software Tool. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 98–115. Springer, Heidelberg (2003)
Brenner, L., Fernandes, P., Plateau, B., Sbeity, I.: PEPS2007 - Stochastic Automata Networks Software Tool. In: QEST 2007, pp. 163–164. IEEE Press, Los Alamitos (2007)
Vincent, J.M.: Perfect simulation of monotone systems for rare event probability estimation. In: Winter Simulation Conference, pp. 528–537. ACM, New York (2005)
Vincent, J.M.: Perfect Simulation of Queueing Networks with Blocking and Rejection. In: International Symposium on Applications and the Internet Workshops: SAINT Workshops, pp. 268–271. IEEE Computer Society, Los Alamitos (2005)
Vincent, J.M., Vienne, J.: Perfect simulation of index based routing queueing networks. SIGMETRICS Performance Evaluation Review 34(2), 24–25 (2006)
Dimakos, X.K.: A Guide to Exact Simulation. International Statistical Review 69(1), 27–48 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernandes, P., Vincent, JM., Webber, T. (2008). Perfect Simulation of Stochastic Automata Networks. In: Al-Begain, K., Heindl, A., Telek, M. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2008. Lecture Notes in Computer Science, vol 5055. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68982-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-68982-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68980-5
Online ISBN: 978-3-540-68982-9
eBook Packages: Computer ScienceComputer Science (R0)