Slide 6
Slide 6 text
Reachable States
A state is reachable if it appears in some execution.
The execution of a state machine,
= (, ⊆ × , 0
∈ )
is a (possibly infinite) sequence of states, (0
, 1
, … ,
) that:
1. 0
= 0
(it begins with the start state)
2. ∀ ∈ 0, 1, … , − 1 .
→ +1
∈ (if and are
consecutive states in the sequence, there is an edge → ∈ .