Next: Static Simulation Up: A General Method for Previous: Event Graph Representation

Dynamic Simulation

Before we describe our compiler algorithm, we first formally describe how we model the traditional dynamic simulation process. During simulation, the state of the computation is captured by a quadruple , where

We assume the existence of the following operations:

We define by , where

(Type I Transition)
This represents the execution of an event in the current simulation time step:

if , then
Let in

(Type II Transition)
This represents incrementing the simulation time to the next time during which an event can occur.

if and , then
Let

in

(Type III Transition)
This represents the end of simulation:

if and , then
, denoting no next state.

The dynamic simulation of an event graph is a sequence of states , where



Next: Static Simulation Up: A General Method for Previous: Event Graph Representation


Robert French