On the complexity of verifying structural properties of discrete event simulation models
成果类型：
Article
署名作者：
Jacobson, SH; Yücesan, E
署名单位：
University of Illinois System; University of Illinois Urbana-Champaign; INSEAD Business School
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.47.3.476
发表日期：
1999
页码：
476-481
关键词：
摘要：
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.