On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models

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.

[1]  Bennett L. Fox,et al.  Scientific Applications: An algorithm for identifying the ergodic subchains and transient states of a stochastic matrix , 1967, Commun. ACM.

[2]  Bernard P. Zeigler,et al.  Theory of Modelling and Simulation , 1979, IEEE Transactions on Systems, Man and Cybernetics.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  A. Alan B. Pritsker,et al.  Introduction to simulation and SLAM II , 1979 .

[5]  Richard E. Nance,et al.  The time and state relationships in simulation modeling , 1981, CACM.

[6]  C. M. Overstreet,et al.  Model specification and analysis for discrete event simulation , 1982 .

[7]  Lee W. Schruben,et al.  Simulation modeling with event graphs , 1983, CACM.

[8]  G. S. Shedler,et al.  Regeneration and Networks of Queues , 1986 .

[9]  Lee W. Schruben,et al.  An interactive run length control for simulation on PCs , 1986, WSC '86.

[10]  Robert G. Sargent.  Event Graph Modelling for Simulation with an Application to Flexible Manufacturing Systems , 1988 .

[11]  W. Whitt.  Planning queueing simulations , 1989 .

[12]  Robert G. Sargent,et al.  A Formal Development of Event Graphs as an Aid to Structured and Efficient Simulation Programs , 1989, INFORMS J. Comput..

[13]  Paul Glasserman,et al.  Gradient Estimation Via Perturbation Analysis , 1990 .

[14]  Enver Yücesan,et al.  Building correct simulation models is difficult , 1992, WSC '92.

[15]  P. Glasserman,et al.  Some Guidelines and Guarantees for Common Random Numbers , 1992 .

[16]  Lee W. Schruben,et al.  Structural and behavioral equivalence of simulation models , 1992, TOMC.

[17]  Lee W. Schruben,et al.  Modeling paradigms for discrete event simulation , 1993, Oper. Res. Lett..

[18]  Guy L. Steele,et al.  C: A Reference Manual, Fourth Edition , 1994 .

[19]  Enver Yücesan,et al.  Computational issues for accessibility in discrete event simulation , 1996, TOMC.