Given an atomic DEVS model, simulation algorithms are methods to generate the model's legal behaviors which are trajectories not to reach to illegal states. (see Behavior of DEVS). [Zeigler84] originally introduced the algorithms that handle time variables related to lifespan and elapsed time by introducing two other time variables, last event time,, and next event time with the following relations: and where denotes the current time. And the remaining time, is equivalently computed as, apparently. Since the behavior of a given atomic DEVS model can be defined in two different views depending on the total state and the external transition function (refer to Behavior of DEVS), the simulation algorithms are also introduced in two different views as below.

Common parts

Regardless of two different views of total states, algorithms for initialization and internal transition cases are commonly defined as below. DEVS-simulator variables: parent // parent coordinator t_l // time of last event t_n // time of next event // the associated Atomic DEVS model when receive init-message(Time t) when receive star-message(Time t) if t \ne t_n then error: bad synchronization; send y-message(y,t) to parent;

View 1: total states = states * elapsed times

As addressed in Behavior of Atomic DEVS, when DEVS receives an input event, right calling, the last event time,t_l is set by the current time,t, thus the elapsed timet_e becomes zero because. when receive x-message(x \in X, Time t) if ( t_l \le t and t \le t_n ) == false then error: bad synchronization;

View 2: total states = states * lifespans * elapsed times

Notice that as addressed in Behavior of Atomic DEVS, depending on the value of b return by, last event time,t_l, and next event time,t_n,consequently, elapsed time, t_e, and lifespant_n, are updated (if b=1) or preserved (if b=0). when receive x-message(x \in X, Time t) if ( t_l \le t and t \le t_n ) == false then error: bad synchronization; if b = 1 then