Storage Alternatives for Large Structured State Spaces.

Abstract

We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional technique based on a single search tree, we demonstrate how an approach based on multiple levels of search trees offers advantages in both memory and execution complexity, and how solution algorithms based on Kronecker operators greatly benefit from these results. Further execution time improvements are obtained by exploiting the concept of event locality. We apply our technique to three large parametric models, and give detailed experimental results.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA323332

Entities

People

  • Andrew S. Miller
  • Gianfranco Ciardo

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Classification
  • Complex Systems
  • Computer Science
  • Engineering
  • Lists (Data Structures)
  • Markov Chains
  • Markov Models
  • Models
  • Notation
  • Petri Nets
  • Probability
  • Simulations
  • Steady State
  • Stochastic Processes
  • Transitions
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.

Technology Areas

  • Space