Build a transition table
See this course’s project requirements
A tested fictional equipment-repair workflow with a transition table, guarded actions, rejected transitions and a trace of two complete cases.
Keep your working files in your own notebook or software. Save a private description, checklist, and work link in My Proof.
What to include
- A workflow map with distinct states and events.
- A complete allowed-transition table and a rejection case.
- A guarded verification matrix with accepted and rejected cases.
- An impossible-event test with state preservation.
- Complete, resumed and rejected workflow traces.
- A tested finite workflow model with honest completion boundaries.
Review and revise
Use these criteria to check your work and choose what to improve.
- The implementation or declared simulation follows the supplied contract and retains inspectable original inputs.
- Normal, boundary and rejected cases are recorded with expected versus observed results.
- The changed case has a correct explanation and does not rely on hidden state.
- The project includes source, outputs, instructions and honest tool, privacy and verification limits.
Want more background?
The idea in everyday life
Transitions maps(new, triage)→triaged;(triaged, start_repair)→repair;(repair, verify)→tested;(tested, close)→closed.
A transition table is a contract of allowed pairs. A missing pair is rejected rather than guessed. This small table has four forward transitions and no closing from new.
Build a transition table — original worked practice
A transition table is a contract of allowed pairs. A missing pair is rejected rather than guessed. This small table has four forward transitions and no closing from new.
Transitions maps(new, triage)→triaged;(triaged, start_repair)→repair;(repair, verify)→tested;(tested, close)→closed.
1. Step 1
Read the four key/value pairs in the supplied source.
You should see: Each key contains current state and event.
This keeps the rule and its observable result together.
2. Step 2
Find the repair, verify pair.
You should see: Its next state is tested.
This keeps the rule and its observable result together.
3. Step 3
Check whether new, close is present.
You should see: It is absent and unsupported.
This keeps the rule and its observable result together.
4. Step 4
Copy the table with one explicit invalid pair.
You should see: A complete allowed-transition table and a rejection case.
This keeps the rule and its observable result together.
What to finish
A complete allowed-transition table and a rejection case.
Watch for this
Encoding only allowed pairs in prose while letting implementation fall through to an arbitrary default state.
How can I tell I understand it?
Explain and demonstrate the required distinction: A transition table is a contract of allowed pairs. A missing pair is rejected rather than guessed. This small table has four forward transitions and no closing from new. Show a changed input and the expected result without weakening this contract.
Quick knowledge check
Answer all 3 questions. Get at least 2 right and the lesson completes automatically.
You’ll get an explanation for each answer. Signed in? Your results save to your account.
Pass the check. We’ll save the progress.
Answer all 3 questions above and get at least 2 right. You can review the explanations and try again.
Go to the knowledge checkTools, templates, and lesson sources
Tools and templates
Tools open in a new tab so you can keep your place here.
Sources and further reading
Explore the references behind this lesson.
Source & access notes · checked 2026-10-01
Relevant documented module/API behavior inspected during expansion authoring; actual execution evidence is recorded separately. No grant eligibility is established.
Access: Official page retrieved with the web reader on 2026-10-01. Documentation reading does not certify execution in every native tool or browser.
Reuse: Original local practice files, fictional data, worked examples and questions. Concepts paraphrased and linked; source exercises are not copied.
Report a problem with this lesson
Tell us what went wrong. Please leave out personal information and private project contents.