Storage alternatives for large structured state spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1245, Issue , 1997, Pages 44-57

  Ciardo, Gianfranco ^a   Miner, Andrew S ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; FORESTRY; PETRI NETS; QUEUEING NETWORKS;

HIGH-LEVEL MODELING; MULTIPLE LEVELS; PARAMETRIC MODELS; SEARCH TREES; SINGLE SEARCH; TRADITIONAL TECHNIQUES;

SYSTEMS ANALYSIS;

EID: 77954562220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0022196     Document Type: Conference Paper

References (5)

1. G. Chiola. Compiling techniques for the analysis of stochastic Petri nets. In Proc. 4th Int. Conf. on Modelling Techniques and Tools for Performance Evaluation, pages 13-27, 1989.
2. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, 1996.
3. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Perf. Eval., 18(1):37-59, 1993.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. The MIT Press, Cambridge, MA, 1990.
5. D. E. Knuth. Sorting and Searching. Addison-Wesley, Reading, MA, 1973.