Aggregation of stochastic automata networks with replicas

Linear Algebra and Its Applications

Volumn 386, Issue 1-3 SUPPL., 2004, Pages 111-136

  Benoit, Anne ^a   Brenner, L ^b   Fernandes, P ^b   Plateau, B ^a  

^a CNRS   (France)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Generalized tensor algebra; Large Markov chains; Lumpability; PEPS software tool; Replication; Stochastic automata networks; Strong aggregation

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED SOFTWARE ENGINEERING; MARKOV PROCESSES; MATHEMATICAL MODELS; RANDOM PROCESSES; TENSORS;

GENERALIZED TENSOR ALGEBRA; LARGE MARKOV CHAINS; LUMPABILITY; PEPS SOFTWARE TOOL; REPLICATION; STOCHASTIC AUTOMATA NETWORKS; STRONG AGGREGATION;

AUTOMATA THEORY;

EID: 2942590918     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.02.015     Document Type: Conference Paper

References (26)

1. A. Benoit, L. Brenner, P. Fernandes, B. Plateau, W. J. Stewart, The PEPS software tool, in: P. Kemper, W.H. Sanders (Eds.), 13th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS, Urbana-Champaign, Illinois, USA, 2003.
2. Buchholz P. Exact and ordinary lumpability in finite Markov chains. J. Appl. Prob. 31:1994;59-75.
3. P. Buchholz, Equivalence relations for stochastic automata networks, in: Proc. 2nd Int. Workshop on the Numerical Solution of Markov Chains, Kluwer, Boston, Masachussetts, 1995.
4. Buchholz P. An aggregation-disaggregation algorithm for stochastic automata networks. Prob. Eng. Inf. Sci. 11:1997;229-253.
5. Buchholz P. An adaptative aggregation-disaggregation algorithm for hierarchical Markovian models. Euro. J. Oper. Res. 116:1999;545-564.
6. Buchholz P. Exact performance equivalence - an equivalence relation for stochastic automata. Theor. Comput. Sci. 215(1/2):1999;239-261.
7. J. Campos, M. Silva, S. Donatelli, Structured solution of stochastic DSSP systems, in: Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), Saint Malo, France, IEEE Comp. Soc. Press, June 1997, pp. 91-100.
8. Donatelli S. Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Perform. Evaluat. 18(1):1993;21-36.
9. S. Donatelli, Superposed generalized stochastic Petri nets: definition and efficient solution, in: R. Valette (Ed.), 15th International Conference on Application and Theory of Petri Nets, LNCS 815, Zaragoza, Spain, 1994, pp. 258-277.
10. P. Fernandes, Méthodes Numériques pour la Solution de Systémes Markoviens à Grand Espace d'États, PhD thesis, Institut National Polytechnique de Grenoble, France, 1998.
11. Fernandes P., Plateau B., Stewart W.J. Efficient descriptor-vector multiplications in stochastic automata networks. JACM. 45(3):1998;381-414.
12. Fernandes P., Plateau B., Stewart W.J. Optimizing tensor product computations in stochastic automata networks. RAIRO, Oper. Res. 32(3):1998;325-351.
13. Gusak O., Dayar T., Fourneau J.-M. Stochastic automata networks and near complete decomposability. SIAM J. Matrix Anal. Appl. 23:2001;581-599.
14. Gusak O., Dayar T., Fourneau J.-M. Lumpable continuous-time stochastic automata networks. Euro. J. Oper. Res. 148:2003;436-451.
15. Gusak O., Dayar T., Fourneau J.-M. Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks. Perform. Evaluat. 53:2003;43-69.
16. H. Hermanns, M. Ribaudo, Exploiting symmetries in stochastic process algebras, in: Proc. of 12th European Simulation Multiconference, Manchester, UK, 1998.
17. Kemeny J.G., Snell J.L. Finite Markov Chains. 1960;Van Nostrand Reinhold, New York.
18. Knuth D.E. The Art of Computer Programming, Volume 1 (Fundamental Algorithms). 1967;Addison-Wesley.
19. J. Ledoux, Weak lumpability of finite Markov chains and positive invariance of cones, Technical report, Rapport de recherche INRIA n. 2801, France, 1996.
20. Miner A.S., Ciardo G., Donatelli S. Using the exact state space of a Markov model to compute approximate stationary measures. Measure. Model. Comput. Syst. 2000;207-216.
21. B. Plateau, On the stochastic structure of parallelism and synchronization models for distributed algorithms, in: Proc. ACM Sigmetrics Conference on Measurement and Modelling of Computer Systems, Austin, Texas, August 1985.
22. Rosenblatt M. Functions of a Markov process that are Markovian. J. Math. Mech. 8(4):1959;585-596.
23. Sanders W.H., Meyer J.F. Reduced base model construction methods for stochastic activity networks. IEEE J. Select. Areas Commun. 9(1):1991;25-36.
24. M. Siegle, Structured Markovian performance modelling with automatic symmetry exploitation, in: Proc. 11th Conf. Computer Performance Evaluation: Modelling Techniques and Tools, LNCS 794, 1994.
25. M. Siegle, Using structured modelling for efficient performance prediction of parallel systems, in: G.R. Joubert, et al. (Eds.), Parallel Computing: Trends and Applications, NorthHolland, 1994, pp. 453-460.
26. Stewart W.J. Introduction to the Numerical Solution of Markov Chains. 1994;Princeton University Press, Princeton.