Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

The cancellation of previously scheduled events not only results in a model running less efficiently, it precludes the application of some analysis techniques such as infinitesimal perturbation analysis. While same simulation languages (SIMSCRIPT, SIGMA) include an explicit facility for event cancellation, others do not (SLAM, GPSS, SIMAN). From computation theory, it is known that event cancellation is never necessary; but it is sometimes a convenient modeling technique. Unfortunately, there has been no general methodology developed for eliminating event cancellation from a simulation model. We present a simple general approach. Applications to two classical models where event cancellation is typically used serve as illustrations of the method.

REFERENCES

• 1: Cola, B. A. and R, G. Sargent. 1989. Automatic Lookahead Computation for Conservative Distributed Simulation, CASE Center Technical Report No. 8916, Syracuse University, Syracuse, NY.
• 2: Paul Glasserman, Structural conditions for perturbation analysis derivative estimation: finite-time performance indices, Operations Research, v.39 n.5, p.724-738, Sept.-Oct. 1991 [doi>10.1287/opre.39.5.724]
• 3: Glynn, P. 1989. A GSMP Formalism for Discrete Event Systems. Proceedings of the IEEE 77 (1): 14-23.
• 4: Iglehart, D. L. and G. S. Shedler. 1983. Simulation of Non-Markovian Systems. IBM Journal of Research and Development 27(5):472-479.
• 5: Sanjai Narain, An axiomatic basis for general discrete-event modeling, Proceedings of the 23rd conference on Winter simulation, p.1073-1082, December 08-11, 1991, Phoenix, Arizona, United States
• 6: Lee Schruben, Simulation modeling with event graphs, Communications of the ACM, v.26 n.11, p.957-963, Nov. 1983 [doi>10.1145/182.358460]
• 7: Som, T. K. and R. G. Sargent. 1989. A Formal Development of Event Graphs as an Aid to Structured and Efficient Simulation Programs. ORSA Journal on Computing 1(2):107-125.
• 8: Yucesan, E. 1989. Simulation Graphs for Design and Analysis of Discrete Event Simulation Models, Ph.D. Dissertation, School of OR&m, Comell University, Ithaca, NY.
• 9: Enver Yücesan , Lee Schruben, Structural and behavioral equivalence of simulation models, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.2 n.1, p.82-103, Jan. 1992 [doi>10.1145/132277.132281]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.8 Types of Simulation
          Subjects: Discrete event

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING
      I.6.1 Simulation Theory
          Subjects: Model classification

General Terms:
Algorithms, Design, Languages, Theory