Simulation graphs

ABSTRACT

The Simulation Graphs presented in this paper are a mathematical formalization and extension of Event Graphs introduced by Schruben (1983) as a graphical representation of the event-scheduling approach in discrete-event simulations. Any simulation, indeed any computer program, can be modeled using a Simulation Graph. Finally, we present a graph theoretic approach to define equivalence of simulations.

REFERENCES

• 1: John Adrian Bondy, Graph Theory With Applications, Elsevier Science Ltd, 1976
• 2: John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 3: Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
• 4: 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]
• 5: Schruben, L.W. and Yucesan, E. (1987) On the Generality of Simulation Graphs. Technical Report No.773. SORIE, Cornell University, Ithaca, N.Y.
• 6: S~hruben, L.}V. and Yucesan, E. (1988) Equivalence of Simulations: A Graph Theoretic Approach. Technical Report No.794. SORIE, Cornell University, Ithaca, N.Y.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

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

General Terms:
Design, Performance, Theory