论文信息 - Implementations of time (panel)

Implementations of time (panel)

In conventional discrete event simulation svstems, the flow of simulated time is controlled by-a data structure that is variously called the event set, the pending event set, the future-event chain, or the sequencing-set. At any instant, this structure contains records of those events, processes or activities that are to be simulated at some future time as a result of events that have already been simulated.

[1] Ruth Davies,et al. A microcomputer system for simulation modelling , 1986 .

[2] Douglas W. Jones,et al. An empirical comparison of priority-queue and event-set implementations , 1986, CACM.

[3] Richard E. Nance,et al. The time and state relationships in simulation modeling , 1981, CACM.

[4] Robert M. O'Keefe. Comment on 'Complexity Analyses of Event Set Algorithms' , 1985, Comput. J..

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

[6] Robert G. Sargent. Joining existing simulation programs , 1986, WSC '86.

[7] J. G. Crookes. Simulation in 1981 , 1982 .

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

[9] Geoffrey Gordon,et al. The development of the General Purpose Simulation System (GPSS) , 1978, SIGP.

[10] Richard K. Nance. On Time Flow Mechanisms for Discrete System Simulation , 1971 .

[11] D. Davey,et al. Self-Optimizing Partitioned Sequencing Sets For Discrete Event Simulation , 1980 .

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

[13] Michael Pidd,et al. Computer Simulation in Management Science (3rd Edition) , 1998 .

[14] Robert M. O'Keefe,et al. Discrete visual simulation with Pascal_SIM , 1986, WSC '86.