Normal view MARC view

Building correct simulation models is difficult

Author: Yücesan, Enver ; Jacobson, SheldonINSEAD Area: Technology and Operations Management In: 1992 Winter Simulation Conference Proceedings - Swain, James J.;Goldsman, David;Crain, R - 1992 - Book Language: EnglishDescription: p. 783-790.Type of document: INSEAD ChapterNote: Please ask the Library for this chapterAbstract: An application of the theory of computational complexity to the problem of verifying certain structural properties of discrete event simulation models is illustrated. Such modelling questions as accessibility of states, ordering of events, ambiguity of model specifications, and execution stalling are asserted to be NP-complete decision problems. These results imply that it is highly unlikely that a polynomia-time algorithm can be devised to verify such properties. The consequences of these assertions cover a wide range of modelling and analysis questions in simulation.
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
INSEAD Chapter Digital Library
PDF Available

Please ask the Library for this chapter

An application of the theory of computational complexity to the problem of verifying certain structural properties of discrete event simulation models is illustrated. Such modelling questions as accessibility of states, ordering of events, ambiguity of model specifications, and execution stalling are asserted to be NP-complete decision problems. These results imply that it is highly unlikely that a polynomia-time algorithm can be devised to verify such properties. The consequences of these assertions cover a wide range of modelling and analysis questions in simulation.

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?