| 摘要 |
<p>PROBLEM TO BE SOLVED: To shorten the time required for simulation by calculating the simulation time for arrival of a first event is before the simulation time for arrival of a second event and making the simulation time for arrival of the second event is before the simulation time for arrival of the first event. SOLUTION: This simulator advances along routes existing by desired number even when the event on an other route is generated earlier than the event on a first route to be simulated and is capable of switching to an other route next. Namely, this simulator starts a simulation on a route 3 and is capable of simulating all the events on the route. Subsequently, the previously generated events B and F on the route 2 are simulated by performing a 'flashback', events A, D and E can be simulated by performing the flashback again next, subsequently an event K can be simulated, and after the event K is simulated, events H, I and J can be simulated.</p> |
