Structural and behavioral equivalence of simulation models
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Complexity of simulation models: a graph theoretic approach
WSC '93 Proceedings of the 25th conference on Winter simulation
Simulation modelling support via network based concepts
WSC' 90 Proceedings of the 22nd conference on Winter simulation
On the Generality of Event-Graph Models
INFORMS Journal on Computing
Modeling paradigms for discrete event simulation
Operations Research Letters
| Hi-index | 0.00 |
Planar graphs play an important role in real world applications, partly due to the fact that some practical problems can be efficiently solved for planar graphs while they are intractable for general graphs. Simulation Graph Models of simple queueing systems are planar graphs. Their geometric duals can then be constructed. In the context of queueing models, this dualization process represents a transformation from the event scheduling to the activity scanning world view in discrete event simulation. The so-called primaldual pair of models provides an alternative but equivalent representation of these stochastic systems.