SIMPLORER User Manual V6.0 - FER-a

13
420 Simulator
State Graph Simulator Processing
Within state machines the calculation of states, transitions, and actions continue as long as
there is no other valid transfer condition. The calculations are executed only in active
(marked) states. Afterwards the system tests if there have been any events. Only if events
have occurred and further states can be marked are new actions calculated.
State graphs do not need their own time step control; they work in discrete time and are actualized
at each time step. Otherwise, the state graph simulator itself influences the time step
(in the same way as other SIMPLORER modules). This method of processing concerns first of
all the identification of events. For the time determination of such an event, the simulator
searches for a value as precise as possible, canceling and repeating simulation time steps
with a decreasing time step until the minimum time step is reached. At this limit the time determination
of an event is accepted as valid (with sufficient precision) and the simulation continues
as usual. This event synchronization is performed using ≥ or ≤ and bypassed on the >
and < operators.
10
System
quantity
t0 tx t1=t0+h0
t2=t0+h1 t3=t2+h2
Decreasing step width
t2=t0+h1
t3=t2+h2
U>=10