Observation loses distinctions
Paths A → B → D and A → C → D both produce α → β → γ. The observations alone do not tell you whether B or C was visited.
Change a constraint, take an admissible step, and compare the state with its observation.
Synthetic finite-state teaching example · provisional C = (U, A, T, o) interpretation · no measured data.
If a new constraint excludes the current path, the path resets to the selected start. The start is always admissible.
Interactive controls require JavaScript. The full model is listed below.
From A, the unmodified graph reaches A, B, C, D, and E.
The graph has no probabilities or timing. It says which changes are allowed, not which will occur.
Paths A → B → D and A → C → D both produce α → β → γ. The observations alone do not tell you whether B or C was visited.
Exclude D and start at A: A, B, and C remain reachable, while E no longer has an accessible path. This is a property of this graph.
| State | Outgoing transitions | Observation |
|---|---|---|
| A | B, C | α |
| B | D | β |
| C | D | β |
| D | E | γ |
| E | B | γ |