Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
ON THE COMPLEXITY OF VERIFYING STRUCTURAL PROPERTIES OF DISCRETE EVENT SIMULATION MODELS. |
| Συγγραφείς: |
Jacobson, Sheldon H., Yucesan, Enver |
| Πηγή: |
Operations Research. May/Jun1999, Vol. 47 Issue 3, p476-481. 6p. 1 Chart. |
| Θεματικοί όροι: |
*Mathematical models, SIMSCRIPT (Computer program language), Computational complexity |
| Περίληψη: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Operations Research is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Βάση Δεδομένων: |
Business Source Index |
