Structural and behavioral equivalence of simulation models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An axiomatic basis for general discrete-event modeling
WSC '91 Proceedings of the 23rd conference on Winter simulation
Simulation modeling with event graphs
Communications of the ACM
Eliminating canceling edges from the simulation graph model methodology
WSC '96 Proceedings of the 28th conference on Winter simulation
On the Generality of Event-Graph Models
INFORMS Journal on Computing
Mathematical programming representations for state-dependent queues
Proceedings of the 40th Conference on Winter Simulation
Simulation modeling for analysis
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
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.