Complexity of simulation models: a graph theoretic approach

Complexity of a simulation model is defined as a measure that reflects the requirements imposed by models on computational resources. It is often related to the structural properties of models. In this paper, we introduce complexity measures for simulation models using the concept of Simulation Graphs. A reasonable measure of complexity is useful in a priori evaluation of proposed simulation studies that must be completed within a specified budget. They can also be useful in classifying simulation models in order to obtain a thorough test bed of models to be used in simulation methodology research. Some surrogate measures of run time complexity are also developed.

[1]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[2]  Enver Yiicesan.  ANALYSIS OF MARKOV CHAINS USING SIMULATION GRAPH MODELS , 1990 .

[3]  Robert G. Sargent.  Event Graph Modelling for Simulation with an Application to Flexible Manufacturing Systems , 1988 .

[4]  C. M. Overstreet,et al.  Model specification and analysis for discrete event simulation , 1982 .

[5]  Ronald F. Perry,et al.  Simulation: A Problem-Solving Approach , 1989 .

[6]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[7]  A. Bonato,et al.  Graphs and Hypergraphs , 2021, Clustering.

[8]  B. Fox.  Beating Future-Event Schedules , 1987 .

[9]  B. Fox.  Generating Markov-Chain Transitions Efficiently , 1987 .

[10]  James O. Henriksen,et al.  Event list management - a tutorial , 1983, WSC '83.

[11]  John Craig Comfort,et al.  The simulation of a microprocessor based event set processor , 1981, ANSS.

[12]  A. Alan B. Pritsker,et al.  Introduction to simulation and SLAM II , 1979 .

[13]  Claude Dennis Pegden.  Introduction to SIMAN , 1988, WSC '88.

[14]  William M. McCormack,et al.  Analysis of future event set algorithms for discrete event simulation , 1981, CACM.

[15]  B. Fox,et al.  Gradient Computation for Transient Markov Chains , 1987 .

[16]  R. D. Smet.  Simulation modeling and analysis (2nd edition): Averill M. Law and W. David Kelton McGraw-Hill, Inc., New York, 1991, xxii + 759 pages, £31.05, ISBN 0 07 036698 5 , 1993 .

[17]  B. Fox,et al.  Complexity of Gradient Estimation for Transient Markov Chains , 1987 .

[18]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[19]  Lee W. Schruben,et al.  Simulation modeling with event graphs , 1983, CACM.

[20]  Robert G. Sargent,et al.  A Formal Development of Event Graphs as an Aid to Structured and Efficient Simulation Programs , 1989, INFORMS J. Comput..

[21]  Lee W. Schruben,et al.  On the Generality of Simulation Graphs , 1988 .

[22]  B. Fox.  Numerical Methods for Transient Markov Chains , 1988 .

[23]  Peter W. Glynn,et al.  Replication Schemes For Limiting Expectations , 1989, Probability in the Engineering and Informational Sciences.

[24]  Claude Dennis Pegden,et al.  Introduction to SIMAN , 1983, WSC '85.

[25]  George W Evans,et al.  SIMULATION USING DIGITAL COMPUTERS. , 1967 .

[26]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[27]  Enver Yücesan.  Analysis of Markov chains using simulation graph models , 1990, WSC' 90.

[28]  Alan Weiss,et al.  Sensitivity Analysis for Simulations via Likelihood Ratios , 1989, Oper. Res..

[29]  Bernard P. Zeigler,et al.  Theory of modeling and simulation , 1976 .

[30]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[31]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[32]  Xi-Ren Cao,et al.  Convergence properties of infinitesimal perturbation analysis , 1988 .

[33]  Lee W. Schruben,et al.  Simulation Graph Duality: A World View Transformation For Simple Queueing Models , 1989, 1989 Winter Simulation Conference Proceedings.

[34]  Lee W. Schruben,et al.  Modeling paradigms for discrete event simulation , 1993, Oper. Res. Lett..

[35]  Bernard P. Zeigler,et al.  Theory of Modelling and Simulation , 1979, IEEE Transactions on Systems, Man, and Cybernetics.