On the benefits of using functional transitions and Kronecker algebra

Performance Evaluation

Volumn 58, Issue 4, 2004, Pages 367-390

  Benoit, Anne ^a   Fernandes, Paulo ^b   Plateau, Brigitte ^a   Stewart, William J ^c  

^a avenue Jean Kuntzmann   (France)

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

^c North Carolina State University   (United States)

Author keywords

Generalized tensor algebra; Markov chains; Stochastic automata networks; Vector descriptor multiplication

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; PROBABILITY; VECTORS;

KRONECKER ALGEBRA; STOCHASTIC AUTOMATA NETWORKS; VECTOR-DESCRIPTOR MULTIPLICATION;

TENSORS;

EID: 6444237031     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.04.002     Document Type: Article

References (35)

1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, G. Franceschinis, Modelling with Generalized Stochastic Petri Nets, Wiley, New York, 1995.
2. A. Benoit, B. Plateau, W.J. Stewart, Memory efficient iterative methods for stochastic automata networks, IRISA Research Report Number 4259, INRIA Rhone-Alpes, 38330 Montbonnot-St-Martin, France, September 2001.
3. A. Benoit, B. Plateau, W.J. Stewart, Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems, in: Proceedings of the International Workshop on Performance Modelling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS'03) at the International Parallel and Distributed Processing Symposium (IPDPS'03), IEEE Computer Society Press, Nice, France, April 2003.
4. Bryant R.E., Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. 35(8):1986;677-691.
5. Bryant R.E., Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv. 24(3):1992;318-393.
6. P. Buchholz, Equivalence relations for stochastic automata networks, computations with Markov chains; in: W.J. Stewart (Ed.), Proceedings of the Second International Meeting on the Numerical Solution of Markov Chains, Kluwer, Boston, 1995.
7. P. Buchholz, Projection methods for the analysis of stochastic automata networks, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Zaragoza, Spain, September 1999, pp. 149-168.
8. Buchholz P., Ciardo G., Donatelli S., Kemper P., Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp. 12(3):2000;203-222.
9. P. Buchholz, M. Fischer, P. Kemper, Distributed steady state analysis using Kronecker algebra, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Zaragoza, Spain, September 1999, pp. 76-95.
10. G. Chiola, GreatSPN 1.5 Software Architecture, in: Computer Performance Evaluation, Elsevier, Amsterdam, 1992, pp. 121-136.
11. G. Ciardo, Discrete-time Markovian stochastic Petri nets, in: W.J. Stewart (Ed.), Computations with Markov Chains, Kluwer, Boston, MA, 1995, pp. 339-358.
12. Ciardo G., Gluckman J., Nicol D., Distributed state-space generation of discrete-state stochastic models. INFORMS J. Comp. 10(1):1998;82-93.
13. G. Ciardo, A.S. Miner Storage alternatives for large structured state spaces, in: R. Marie, B. Plateau, M. Calzarossa, G. Rubino (Eds.), Proceedings of the Ninth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Lecture Notes in Computer Science, Vol. 1245, St. Malo, France, June 1997, Springer, Berlin, pp. 44-57.
14. G. Ciardo, A.S. Miner, A data structure for the efficient Kronecker solution of GSPNs, in: P. Buchholz (Ed.), Proceedings of the Eighth International Workshop on Petri Nets and Performance Models (PNPM'99), Zaragoza, Spain, September 1999, IEEE Comp. Soc. Press, 1999, pp. 22-31.
15. Davio M., Kronecker products and shuffle algebra. IEEE Trans. Comp. C-30:1981;116-125.
16. Donatelli S., Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space. Perf. Eval. 18:1993;21-26.
17. S. Donatelli, Superposed generalized stochastic Petri nets: definition and efficient solution, in: R. Valette (Ed.), Proceedings of the 15th International Conference on Applications and Theory of Petri Nets, Lecture Notes in Computer Science, Vol. 815, Zaragoza, Spain, June 1994, Springer, Berlin, 1994, pp. 258-277.
18. P. Fernandes, Méthodes numériques pour la solution de systèmes Markoviens à grand espace d'états, Ph.D. Thesis, University of Grenoble, 1998.
19. Fernandes P., Plateau B., Stewart W.J., Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM. 45(3):1998;381-414.
20. Fernandes P., Plateau B., Stewart W.J., Optimizing tensor product forms in stochastic automata networks. Oper. Res. 32:1998;325-351.
21. J.-M. Fourneau, F. Quessette, Graphs and stochastic automata networks, computations with Markov chains, in: W.J. Stewart (Ed.), Proceedings of the Second International Meeting on the Numerical Solution of Markov Chains, Kluwer, Boston, 1995.
22. H. Hermanns, J. Meyer-Kayser, M. Siegle, Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains, in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Zaragoza, Spain, June 1997, pp. 188-207.
23. P. Kemper, Closing the gap between classical and tensor based iteration techniques, computations with Markov chains, in: W.J. Stewart (Ed.), Proceedings of the Second International Meeting on the Numerical Solution of Markov Chains, Kluwer, Boston, 1995.
24. Kemper P., Numerical analysis of superposed GSPNs. IEEE Trans. Softw. Eng. 22(4):1996;615-628.
25. A.S. Miner, Efficient solution of GSPNs using canonical matrix diagrams, in: Proceedings of the Ninth International Workshop on Petri Nets and Performance Models, Aachen, Germany, September 2001, in press.
26. A.S. Miner, G. Ciardo, Efficient reachability set generation and storage using decision diagrams, in: H. Kleijn, S. Donatelli (Eds.), Proceedings of the 20th International Conference on Applications and Theory of Petri Nets, Williamsburg, VA, USA, Lecture Notes in Computer Science, Vol. 1639, Springer, Berlin, June 1999, pp. 6-25.
27. B. Plateau, On the stochastic structure of parallelism and synchronisation models for distributed algorithms, in: Proceedings of the 1985 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Austin, TX, USA, May 1985, pp. 147-153.
28. Plateau B., Atif K., Stochastic automata network for modeling parallel systems. IEEE Trans. Softw. Eng. 17(10):1991;1093-1108.
29. B. Plateau, J.-M. Fourneau, K.H. Lee, PEPS: a package for solving complex Markov models of parallel systems, in: R. Puigjaner (Ed.), Proceedings of the Fourth International Conference Modelling Techniques and Tools, 1988, pp. 341-360.
30. B. Plateau, W.J. Stewart, Stochastic automata networks, in: W. Grassmann (Ed.), Advances in Computational Probability; Kluwer Academic Publishers, Boston, 1999 (Chapter 4).
31. M. Siegle, BDD extensions for stochastic transition systems, in: Proceedings of the UKPEW, Ilkley, UK, July 1997.
32. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
33. Stewart W.J., Atif K., Plateau B., The numerical solution of stochastic automata networks. Eur. J. Oper. Res. 86:1995;503-525.
34. V.L. Wallace, R.S. Rosenberg, RQA-1, the recursive queue analyzer, Technical report, University of Michigan, Ann Arbor, 1966.
35. Uysal E., Dayar T., Iterative methods based on splittings for stochastic automata networks. Eur. J. Oper. Res. 110(1):1998;166-186.