On the complexity of verifying structural properties of discrete event simulation models

On the complexity of verifying structural properties of discrete event simulation models

0.00 Avg rating0 Votes
Article ID: iaor20011071
Country: United States
Volume: 47
Issue: 3
Start Page Number: 476
End Page Number: 481
Publication Date: May 1999
Journal: Operations Research
Authors: ,
Abstract:

This paper uses computational complexity theory to assess the difficulty of various discrete event simulation problems. More specifically, accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling for discrete event simulations are formally stated as search problems and proven to be NP-hard. The consequences of these results cover a wide range of modeling and analysis problems in simulation. For example, problems associated with certain variance reduction techniques, model verification, model validation, and the applicability of infinitesimal perturbation analysis, among others, are deemed intractable.

Reviews

Required fields are marked *. Your email address will not be published.