Building correct simulation models is difficult

Enver Yucesan, Sheldon H. Jacobson

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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

Original languageEnglish (US)
Title of host publicationProceedings of the 24th Conference on Winter Simulation, WSC 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages8
ISBN (Print)0780307984
StatePublished - Dec 1 1992
Externally publishedYes
Event24th Conference on Winter Simulation, WSC 1992 - Arlington, United States
Duration: Dec 13 1992Dec 16 1992

Publication series

NameProceedings - Winter Simulation Conference
ISSN (Print)0891-7736


Other24th Conference on Winter Simulation, WSC 1992
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Computer Science Applications


Dive into the research topics of 'Building correct simulation models is difficult'. Together they form a unique fingerprint.

Cite this