Pro
15 min

Lesson 11 — Conveyor Reject

curriculumlessonmixedconveyorcounter
Lesson 11 — Conveyor Reject scenario preview

Ready to build this?

Sign up free — no credit card required. This scenario requires the Pro plan.

Sign up to play this scenario →

Already have an account? Log in

Briefing

Bring it all together: a conveyor with a photoelectric sensor, a counter, and a reject gate. Parts pass the PHOTO_EYE sensor. Every 5th part is rejected by the REJECT_GATE. The CONV_RUN motor runs while ENABLE is true. This lesson combines Lessons 1-10.

Objectives

  • CONV_RUN follows ENABLE (seal-in not required here)
  • Each PHOTO_EYE rising edge increments the count
  • REJECT_GATE activates on every 5th part (when CTU.CV mod 5 === 0)

Hints

  • Run the conveyor: | ENABLE | := CONV_RUN ;
  • Count parts with CTU(CU := PHOTO_EYE, R := REJECT_GATE, PV := 5);

I/O Table

Inputs

ENABLE

Conveyor enable

BOOL · %I0.0

PHOTO_EYE

Part detected sensor

BOOL · %I0.1

Outputs

CONV_RUN

Conveyor motor run

BOOL · %Q0.0

REJECT_GATE

Reject gate solenoid

BOOL · %Q0.1

Your program will be tested against:

All test cases run automatically when you submit. Assertions are hidden until you pass.

  1. #1CONV_RUN follows ENABLE

    Conveyor must run when enable is on

  2. #25th part triggers REJECT_GATE

    5 photoelectric pulses should activate the reject gate

Ready to build this?

Sign up free — no credit card required. This scenario requires the Pro plan.

Sign up to play this scenario →

Already have an account? Log in

Competency and practice field guide

Mixed PLC instructions curriculum scenario: implementation, evidence and troubleshooting

Direct answer

Mixed PLC instructions curriculum scenario becomes useful when it connects input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy with sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback, then proves a declared multi-step cycle starts, advances, counts, times and stops repeatedly from one clean initial state under normal, boundary, fault and recovery conditions. The objective is a repeatable engineering or learning result, not merely activity inside a page or tool.

This guide is written for pLC learners integrating individually understood instructions into a complete, testable machine behavior. The intended result is specific: the learner can assign clear state ownership, predict scan-order interactions and prove normal, simultaneous, fault and restart cases.

a PLC logic and scan-cycle training station with observable inputs, outputs, timing traces and program state used to prove execution behavior while studying combined Boolean, edge, timer, counter and state behavior in one PLC sequence
The training scene connects combined Boolean, edge, timer, counter and state behavior in one PLC sequence to a declared initial state, inspectable boundaries, safe limits and repeatable acceptance evidence.

System map / 02

Six concepts that control the result

Treat these as connected checkpoints. Each checkpoint has an expected state, an observable state and a boundary to the next part of the system. That structure prevents a software indication from being mistaken for physical proof.

NODE 01observable

Define the operating contract

input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy. For combined Boolean, edge, timer, counter and state behavior in one PLC sequence, record the initial condition, actor, requested change, observable result and stopping condition before selecting a tool or implementation.

NODE 02observable

Map the evidence path

sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback. Separate request, internal state, output or service, physical or user-visible result and independent feedback so each boundary can be inspected.

NODE 03observable

Prove normal operation

a declared multi-step cycle starts, advances, counts, times and stops repeatedly from one clean initial state. Run more than one cycle from a known state and retain the values, timings or artifacts that demonstrate repeatability.

NODE 04observable

Exercise a boundary case

simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset. Choose minimum, maximum, simultaneous, delayed or restart conditions that reveal assumptions hidden by the happy path.

NODE 05observable

Diagnose a controlled fault

an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch. Preserve the first symptom, divide the system at a measurable boundary and change one condition only after predicting the result.

NODE 06observable

Transfer and hand over

the behavior recreated in official tools with exact data types, scheduling and target I/O checks. Restore normal state, remove temporary changes, repeat affected checks and document which claims remain limited to the learning environment.

Procedure / 03

A six-step practice and commissioning workflow

Run the steps in order the first time. Later, the same structure becomes a diagnostic loop: define the expected condition, observe the boundary, interpret the difference and choose one proving action.

  1. 01

    Write the acceptance case

    Convert input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy into initial conditions, one stimulus and observable pass criteria.

    Evidence: Another person can repeat the case without guessing the intended result.

    Avoid: Using page completion or an animation as the acceptance criterion.

  2. 02

    Build the map

    Document sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback and name who owns each state or decision.

    Evidence: Every request and result has a source, destination and useful inspection point.

    Avoid: Using the same value as command, status and independent feedback.

  3. 03

    Run the baseline

    Apply a declared multi-step cycle starts, advances, counts, times and stops repeatedly from one clean initial state from a clean start and record the expected evidence.

    Evidence: Repeated runs produce the same bounded result.

    Avoid: Changing several parameters before a baseline exists.

  4. 04

    Challenge assumptions

    Test simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset without changing the acceptance contract.

    Evidence: Limits, timing and restart behavior reach defined states.

    Avoid: Testing only one ideal sequence.

  5. 05

    Isolate one failure

    Introduce or analyse an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch and locate the first disagreement.

    Evidence: The proving action distinguishes the leading hypotheses.

    Avoid: Resetting, forcing or replacing before evidence is retained.

  6. 06

    Close the evidence loop

    Complete the behavior recreated in official tools with exact data types, scheduling and target i/o checks and repeat the affected regression cases.

    Evidence: A learner completes the surface by explaining the result, passing a changed case and identifying what still requires supervised target-equipment practice.

    Avoid: Treating an acknowledged message or one successful rerun as handover.

Diagnostic matrix / 04

Symptoms, proving points and next actions

The table is a reasoning aid, not a parts-replacement chart. Preserve the initial symptom, inspect the named boundary and use the interpretation to choose the next controlled test. Site safety procedures and equipment manuals remain authoritative.

Diagnostic symptoms, inspection points, interpretations and next actions for Mixed PLC instructions curriculum scenario: implementation, evidence and troubleshooting
Observed symptomInspectInterpretationNext proving action
The expected result is unclearRequirement, initial state, actor, stimulus, units and pass conditionThe learner, instructor and assessor may be solving different versions of the task.Rewrite one observable acceptance case before continuing.
Internal state changes but the outcome does notRequest, final owner, output or service boundary and independent feedbackA software or interface indication proves intent at one layer, not the complete outcome.Trace the first boundary after the changing state.
Normal case passes but an edge case failsLimits, timing, simultaneous events, reset and restart assumptionsThe implementation contains a hidden assumption exposed by the changed condition.Add the failed boundary as a permanent regression case.
The failure disappears after resetOriginal symptom, histories, diagnostics, timestamps and active causeReset changed evidence or state without proving the initiating cause.Reproduce under a controlled condition and preserve pre/post-event data.
Simulator and target disagreeModel boundary, software version, task timing, I/O behavior, data types and configurationA learning model and the intended target do not share one of the recorded assumptions.Reduce the case and verify against current target documentation.
The result cannot be explainedPrediction, observation, proving action, alternative hypotheses and limitationsActivity occurred but the evidence is not yet transferable or reviewable.Have the learner defend the signal path and repeat a changed case.

Product evidence / 05

What the browser practice can actually demonstrate

The browser platform can retain programs, scenario results, attempts and observable machine state so practice is attached to evidence rather than seat time alone.

Where simulation stops

The generic exercise does not establish vendor-specific execution order, task scheduling, safety behavior or target-machine suitability.

Commissioning notebook / 06

Six cases that turn the concepts into evidence

Use these as written briefs rather than click-through instructions. For every case, state the expected condition before acting, retain the first useful observation and explain why the final result proves the requirement. A different program or component choice can still be correct when it produces the same bounded behavior and evidence.

Case 01

predict → observe → prove

Prove define the operating contract

Engineering context. input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy. For combined Boolean, edge, timer, counter and state behavior in one PLC sequence, record the initial condition, actor, requested change, observable result and stopping condition before selecting a tool or implementation. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Write the acceptance case” stage of the workflow: convert input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy into initial conditions, one stimulus and observable pass criteria. The acceptance record should show this result: another person can repeat the case without guessing the intended result. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “The expected result is unclear” as one bounded deviation. Inspect requirement, initial state, actor, stimulus, units and pass condition The working interpretation is that the learner, instructor and assessor may be solving different versions of the task. The next proving action is to rewrite one observable acceptance case before continuing. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is using page completion or an animation as the acceptance criterion. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: How do you combine timers and counters safely in PLC logic? A defensible short answer is: Give each function a clear enable and reset contract, use explicit state ownership and test scan-order and restart cases instead of chaining status bits by intuition.

Case 02

predict → observe → prove

Prove map the evidence path

Engineering context. sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback. Separate request, internal state, output or service, physical or user-visible result and independent feedback so each boundary can be inspected. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Build the map” stage of the workflow: document sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback and name who owns each state or decision. The acceptance record should show this result: every request and result has a source, destination and useful inspection point. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “Internal state changes but the outcome does not” as one bounded deviation. Inspect request, final owner, output or service boundary and independent feedback The working interpretation is that a software or interface indication proves intent at one layer, not the complete outcome. The next proving action is to trace the first boundary after the changing state. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is using the same value as command, status and independent feedback. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: Why does mixed PLC logic pass simple tests but fail in a sequence? A defensible short answer is: Interactions between retained state, edges, timing, output ownership and simultaneous events appear only when the complete scan and machine state are exercised.

Case 03

predict → observe → prove

Prove prove normal operation

Engineering context. a declared multi-step cycle starts, advances, counts, times and stops repeatedly from one clean initial state. Run more than one cycle from a known state and retain the values, timings or artifacts that demonstrate repeatability. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Run the baseline” stage of the workflow: apply a declared multi-step cycle starts, advances, counts, times and stops repeatedly from one clean initial state from a clean start and record the expected evidence. The acceptance record should show this result: repeated runs produce the same bounded result. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “Normal case passes but an edge case fails” as one bounded deviation. Inspect limits, timing, simultaneous events, reset and restart assumptions The working interpretation is that the implementation contains a hidden assumption exposed by the changed condition. The next proving action is to add the failed boundary as a permanent regression case. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is changing several parameters before a baseline exists. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: What should I learn first about combined Boolean, edge, timer, counter and state behavior in one PLC sequence? A defensible short answer is: Start with the operating contract and evidence path: input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy, followed by sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback. Add advanced features only after the baseline is predictable.

Case 04

predict → observe → prove

Prove exercise a boundary case

Engineering context. simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset. Choose minimum, maximum, simultaneous, delayed or restart conditions that reveal assumptions hidden by the happy path. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Challenge assumptions” stage of the workflow: test simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset without changing the acceptance contract. The acceptance record should show this result: limits, timing and restart behavior reach defined states. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “The failure disappears after reset” as one bounded deviation. Inspect original symptom, histories, diagnostics, timestamps and active cause The working interpretation is that reset changed evidence or state without proving the initiating cause. The next proving action is to reproduce under a controlled condition and preserve pre/post-event data. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is testing only one ideal sequence. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: How do I practise combined Boolean, edge, timer, counter and state behavior in one PLC sequence effectively? A defensible short answer is: Use short cases with known initial conditions, a written prediction, one action and an observable result. Then alter a boundary or fault and explain why the evidence changed.

Case 05

predict → observe → prove

Prove diagnose a controlled fault

Engineering context. an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch. Preserve the first symptom, divide the system at a measurable boundary and change one condition only after predicting the result. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Isolate one failure” stage of the workflow: introduce or analyse an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch and locate the first disagreement. The acceptance record should show this result: the proving action distinguishes the leading hypotheses. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “Simulator and target disagree” as one bounded deviation. Inspect model boundary, software version, task timing, I/O behavior, data types and configuration The working interpretation is that a learning model and the intended target do not share one of the recorded assumptions. The next proving action is to reduce the case and verify against current target documentation. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is resetting, forcing or replacing before evidence is retained. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: What counts as proof of competence? A defensible short answer is: A repeatable artifact or system result plus an explanation of the signal path is stronger than time spent, screenshots or a copied answer. Physical competence requires separate supervised evidence.

Case 06

predict → observe → prove

Prove transfer and hand over

Engineering context. the behavior recreated in official tools with exact data types, scheduling and target I/O checks. Restore normal state, remove temporary changes, repeat affected checks and document which claims remain limited to the learning environment. Begin with a written normal condition and identify which request, state, physical result or communication value will provide independent confirmation. Do not begin by changing the configuration; the initial state is part of the evidence and should remain reproducible.

Controlled setup. Use the “Close the evidence loop” stage of the workflow: complete the behavior recreated in official tools with exact data types, scheduling and target i/o checks and repeat the affected regression cases. The acceptance record should show this result: a learner completes the surface by explaining the result, passing a changed case and identifying what still requires supervised target-equipment practice. Record initial conditions, the exact stimulus and the observation point so another learner can repeat the case without relying on your memory.

Fault challenge. Introduce or analyse “The result cannot be explained” as one bounded deviation. Inspect prediction, observation, proving action, alternative hypotheses and limitations The working interpretation is that activity occurred but the evidence is not yet transferable or reviewable. The next proving action is to have the learner defend the signal path and repeat a changed case. Change only one condition before observing the result, and preserve timestamps or measurements where timing matters.

Review and recovery. The most common trap here is treating an acknowledged message or one successful rerun as handover. After restoring the cause, repeat the normal case and at least one stop, timeout, disconnect or restart boundary relevant to this topic. Remove temporary forces and bypasses, return the model to a known state and retain the evidence that both operation and recovery are deliberate.

Explain it aloud: Why test faults and restart behavior? A defensible short answer is: Because an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch or simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset can expose assumptions that never appear during ideal startup and steady operation.

Answer surface / 07

Questions people ask about Mixed PLC instructions curriculum scenario

These concise answers define the operating, training and product boundaries most often missed in broad summaries. The full workflow and diagnostic table above provide the evidence behind them.

How do you combine timers and counters safely in PLC logic?

Give each function a clear enable and reset contract, use explicit state ownership and test scan-order and restart cases instead of chaining status bits by intuition.

Why does mixed PLC logic pass simple tests but fail in a sequence?

Interactions between retained state, edges, timing, output ownership and simultaneous events appear only when the complete scan and machine state are exercised.

What should I learn first about combined Boolean, edge, timer, counter and state behavior in one PLC sequence?

Start with the operating contract and evidence path: input truth, stop priority, internal state, edge memory, timer and counter state, comparison, output ownership, feedback and restart policy, followed by sampled inputs through ordered rung or statement execution to state transitions, final outputs, machine response and feedback. Add advanced features only after the baseline is predictable.

How do I practise combined Boolean, edge, timer, counter and state behavior in one PLC sequence effectively?

Use short cases with known initial conditions, a written prediction, one action and an observable result. Then alter a boundary or fault and explain why the evidence changed.

What counts as proof of competence?

A repeatable artifact or system result plus an explanation of the signal path is stronger than time spent, screenshots or a copied answer. Physical competence requires separate supervised evidence.

Why test faults and restart behavior?

Because an input, instruction-state, scan-order, state-owner, timer, counter, output, feedback or restart mismatch or simultaneous start and stop, held sensor, extra edge, timer equality, counter rollover, fault during state, power return and manual reset can expose assumptions that never appear during ideal startup and steady operation.

Can browser practice replace official software or hardware?

No. It can build concepts and diagnostic reasoning. Exact firmware, I/O electrical behavior, networking, safety and commissioning require current official tools, documentation and target equipment.

How should progress be documented?

Keep the requirement, initial state, program or configuration, observed values, fault hypothesis, proving action, recovery result and a concise limitations statement.