Discrete Event Dynamic Systems (DEDS)

The simulations of DEDs depends on the determination of the time taken to complete given tasks and the
times of the occurrence of events.

The simulation includes the selection of times of completion or times of events using the distribution of
time to complete tasks or the time between successive events. This as been described before.

Bound Task:
The bound tasks are tasks that could be started if another event has completed. This does not depend on
a condition. Example of such bound process is the arrival process. If a customer has arrived, then we can
start to expect the arrival of the next customer.

The service task is not a bound task, because the service can start only IF there is a customer o be served.
See conditional tasks

Conditional Tasks (or events)

Some tasks can be started e.g. only if a condition is satisfied. Example, the task may require a resource A
and a resource B.. Example of such action is to start a machine only if the machine has been oiled and the
electrical source has been connected to main line.

ABC Simulation Method: {Advance, Bound, Conditional}

Is fundamentally a Monte-Carlo model for the simulation of dynamic systems that are driven by
events. It takes into consideration the intrinsic nature of both {B}ound and {C}onditional events and
tasks.

ABC Algorithm:
StartABC
Initialise Tasks and events {Generate initial events and start tasks}
Repeat
Advance Time to time of first event in List
Execute the Event
Execute Bound Events (That must be executed at this moment
Execute Conditional Events (that may be executed as a result of the current state
Until Simulation Time expires
Calculate performance parameters
EndABC