State machines with temporal events
If I have finite state machine 
<pre>
Q = {Σ, S, s0, δ, F}

where 

Σ = {'[r]equest', '[o]ut', '[i]n', '[e]nd'}

S = {'[R]eady', '[I]nitiating', '[W]aiting', 'Re[C]eived', 'Re[S]etting'}

s0 = R,

F = {R}

δ =  (q ∈ S and x ∈ Σ)

 q      x      q
-------------------
 R      r      I
 I      o      W
 W      i      C
 C      e      S
 S      ∈      R
</pre>

However, I have a transition from  W to S via a temporal event. How would I handle it?
State machines with temporal events
===

If I have finite state machine 
<pre>
Q = {Σ, S, s0, δ, F}

where 

Σ = {'[r]equest', '[o]ut', '[i]n', '[e]nd'}

S = {'[R]eady', '[I]nitiating', '[W]aiting', 'Re[C]eived', 'Re[S]etting'}

s0 = R,

F = {R}

δ =  (q ∈ S and x ∈ Σ)

 q      x      q
-------------------
 R      r      I
 I      o      W
 W      i      C
 C      e      S
 S      ∈      R
</pre>

However, I have a transition from  W to S via a temporal event. How would I handle it?