A specification language to assist in analysis of discrete event simulation models
Communications of the ACM
Introduction to Simulation and SLAM II (3rd ed.)
Introduction to Simulation and SLAM II (3rd ed.)
Simulation methods for queues: an overview
Queueing Systems: Theory and Applications
Monotonicity in generalized semi-Markov processes
Mathematics of Operations Research
Building correct simulation models is difficult
WSC '92 Proceedings of the 24th conference on Winter simulation
Integrated support environments for simulation modelling
WSC' 90 Proceedings of the 22nd conference on Winter simulation
ACM Computing Surveys (CSUR)
The time and state relationships in simulation modeling
Communications of the ACM - Special issue on simulation modeling and statistical computing
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Model specification and analysis for discrete event simulation
Model specification and analysis for discrete event simulation
Using ACCESSIBILITY to assess the performance of generalized hill climbing algorithms
Proceedings of the 30th conference on Winter simulation
Observations on the complexity of composable simulation
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
A class of convergent generalized hill climbing algorithms
Applied Mathematics and Computation
Simulation of manufacturing systems
Applied system simulation
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
On the Generality of Event-Graph Models
INFORMS Journal on Computing
Hi-index | 0.00 |
Several simulation model building and analysis issues have been studied using a computational complexity approach. More specifically, four problems related to simulation model building and analysis (accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling) have been shown to be NP-hard search problems. These results imply that it is unlikely that a polynomial-time algorithm can be devised to verify structural properties of discrete event simulation models, unless P = NP. This article considers the problem of accessibility, identifies special cases that are polynomially solvable or remain NP-hard, and discusses implications with respect to the other three problems. A local search procedure and variations of simulated annealing are presented to address accessibility. Computational results illustrate these heuristics and demonstrate their strengths limitations.