Storage Alternatives for Large Structured State Spaces

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. 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.

• Type: Conference
• Year: 1997
• Where: CPE
• Authors: Gianfranco Ciardo, Andrew S. Miner
• Keywords: CPE 1997, Further Execution Time, Hardware, Large State Space, Search Trees