In: Marie, R.; Plateau, B.; Calzarossa, M.; Rubino, G.: LNCS 1245: Proc. 9th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, pages 44-57. St. Malo, France: Springer-Verlag, June 1997.
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. 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.
Back to the Petri Nets Bibliography