This report extends the model for parallel discrete event simulation presented in  by introducing the notion of time. The model is based on the notions of processes and gates and on the rendezvous mechanism defined in the the basic LOTOS process algebra. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the TOPO.
An algorithm is presented that allows optimistic gate activations (i.e., speculative computation). This increases the available parallelism while ensuring correct execution of the simulation. In the case where the simulation processes are time-invariant, the optimistic execution admits additional parallelism via the mechanism of time shifting.
The model is used to describe closed stochastic queueing network simulations. Simulations of various queueing network topologies have implemented. Analysis of preliminary results suggests that the model makes available a limited degree of parallelism.
Copyright 1994 by Bruno R. Preiss.
Full text. BibTeX entry.