State machines with temporal events [closed]
Want to improve this question? Update the question so it's on-topic for Stack Overflow.
Closed开发者_如何学C 11 years ago.
Improve this questionI have defined a finite state machine
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
However, I have a transition from W to S via a temporal event, i.e., the transition should happen after a stipulated amount of time. How could I handle it?
精彩评论