Academic Journal
ON THE COMPLEXITY OF VERIFYING STRUCTURAL PROPERTIES OF DISCRETE EVENT SIMULATION MODELS.
| Τίτλος: | 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 |
| FullText | Text: Availability: 0 CustomLinks: – Url: http://www.jstor.org/openurl?issn=0030364X&date=1999&volume=47&issue=3&spage=476 Name: JSTOR (all content) (s7799221) Category: fullText Text: Icon: https://imageserver.ebscohost.com/branding/jstor/iconJSTOR.gif MouseOverText: Full Text from JSTOR |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 2178120 RelevancyScore: 1249 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1249.251953125 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: ON THE COMPLEXITY OF VERIFYING STRUCTURAL PROPERTIES OF DISCRETE EVENT SIMULATION MODELS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Jacobson%2C+Sheldon+H%2E%22">Jacobson, Sheldon H.</searchLink><br /><searchLink fieldCode="AR" term="%22Yucesan%2C+Enver%22">Yucesan, Enver</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Operations+Research%22">Operations Research</searchLink>. May/Jun1999, Vol. 47 Issue 3, p476-481. 6p. 1 Chart. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22SIMSCRIPT+%28Computer+program+language%29%22">SIMSCRIPT (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=2178120 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1287/opre.47.3.476 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 6 StartPage: 476 Subjects: – SubjectFull: Mathematical models Type: general – SubjectFull: SIMSCRIPT (Computer program language) Type: general – SubjectFull: Computational complexity Type: general Titles: – TitleFull: ON THE COMPLEXITY OF VERIFYING STRUCTURAL PROPERTIES OF DISCRETE EVENT SIMULATION MODELS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Jacobson, Sheldon H. – PersonEntity: Name: NameFull: Yucesan, Enver IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 05 Text: May/Jun1999 Type: published Y: 1999 Identifiers: – Type: issn-print Value: 0030364X Numbering: – Type: volume Value: 47 – Type: issue Value: 3 Titles: – TitleFull: Operations Research Type: main |
| ResultId | 1 |