Simultaneous events and distributed simulation

The authors study the handling of simultaneous events in distributed simulation and conclude that the results of a distributed simulation are the same as those of a sequential simulation in which a particular assignment of priorities is used to resolve time ties. They study the ordering relation that a distributed simulation implicitly enforces on simultaneous events, and then give an algorithm that can be used to assign priorities to processes so that the ordering relation enforced by a distributed simulation can also be enforced in a sequential simulation. The motivation for this is that if distributed implementation and a sequential implementation of the same simulation were being developed, it would be necessary for the two implementations to handle simultaneous events in the same manner. In addition, the authors show how to dynamically assign priorities to processes in a simulation in which processes can be created and destroyed during the simulation, and they discuss the costs and the limitations of this method