Processes, interactions and lifecycle
Lifecycle trace verification
A flat lifecycle diagram plus its trace checker: replay a declared event list through the states and verify the outcome.
state.flat@1New DDN source
Why use it?
The state machine you cannot run an event list through is a picture, not a contract.
When it helps
Checking that a declared lifecycle actually reaches the states its name implies.
How to read it
- States and transitions are the model; the trace is a recorded input you replay.
- A mismatch names the event and the expected state.
What you need
- The states and transitions
- The event list to replay
- The expected end state
Things to check
- Do not treat a passing trace as proof of all traces.
- Do not hide an event the machine cannot consume.
Scope of this diagram
Deterministic flat-lifecycle replay with exactly-one-transition validation.
Work with the converted example
- Open the viewer and select
lifecycle_trace. Inspect the rendered view and its source. - Open the designer. Keep the selected profile and inspect its legal palette and property controls.
- Change one displayed title or an appropriate data value. Apply the edit and check the resulting diagram.
- Run the verifier and review its diagnostics before moving complete content into review.
- Download your edited DDN source to retain the change.
The example uses the indentation-based ddn-next-1 dialect. The language guide explains reusable definitions, dotted data rows and explicit property blocks.