PLC Simulator
Free tool

PLC Scan Time Calculator

Enter your program size, I/O count, and CPU class to get a rule-of-thumb scan cycle estimate — with an honest explanation of what actually drives scan time.

PLC Scan Time Estimator

Rule-of-thumb estimate only. Always verify with your controller’s benchmark utility. All calculations are client-side.

CPU class

rungs/instructions
points
points
points
points
ms (HMI, EtherNet/IP, remote I/O)

Estimated scan time range

3.2 ms6.0 ms

±30% spread accounts for overhead jitter, OS service tasks, and cache variability. Verify against the actual controller scan-time diagnostic.

How the scan works

The four phases of a PLC scan cycle

Every PLC executes the same repeating loop. Understanding which phase dominates your scan budget is the first step in reducing it.

ReadInputs1–5 µs/pt digital1–5 ms/card analogueExecuteProgram0.05–0.5 µs/instrWriteOutputs≈ same as readComms&HousekeepingHMI, EtherNet/IPremote I/OOne complete scan loop — typically 1 ms to 50 ms
PLC architecture whose CPU class and I/O count drive the scan time estimateA modular PLC rack on a backplane: power supply, CPU processor, input module, output module and a communications module side by side.PLC RACKbackplane busPSUPowerCPUProcessorDIInputDOOutputNETComms
CPU class and I/O module count are the two biggest scan-time drivers.
Ladder logic rung whose instruction count the scan time calculator multiplies by per-instruction timeA basic ladder logic rung between two power rails: an examine-if-closed contact (XIC) in series driving an output coil (OTE).L1L2] [StartXIC I:0/0LampOTE O:0/0
Every rung adds instructions — the calculator multiplies by per-instruction execution time.
IEC 61131-3 languages whose instruction mix affects PLC scan timeThe five IEC 61131-3 PLC programming languages as chips: Ladder Diagram, Function Block Diagram, Structured Text, Instruction List and Sequential Function Chart.IEC 61131-3 — five languagesLDLadder DiagramFBDFunction BlockSTStructured TextILInstruction ListSFCSequential Func. Chart
Instruction mix matters — floating-point can run 10x slower than bit instructions.
Digital I/O points added to the scan time read-inputs and write-outputs phasesA digital input pushbutton wired to a PLC input card, and a PLC output card driving a lamp, with a sinking versus sourcing hint.I/O CARDINPUTOUTPUTPushbuttonI:0/0LampO:0/0sinking (NPN) vs sourcing (PNP)
Each digital I/O point adds time to the read-inputs and write-outputs phases.

Background

What is PLC scan time and why does it matter?

Every PLC executes a continuous loop — read all inputs into an image table, run every rung of your ladder program against that snapshot, write the output image table back to physical outputs, then service communications. The total elapsed time for one complete cycle is the scan time. Typical values range from under 1 ms for a small micro PLC to 50 ms or more for a heavily loaded mid-range controller.

Scan time matters for three reasons. First, the PLC cannot respond to an input change faster than one scan — a 20 ms scan misses any event shorter than 20 ms unless you use an interrupt task. Second, PID controllers placed in the main scan execute at a variable rate, which degrades loop performance; most PLC platforms provide periodic interrupt tasks specifically to give PID a consistent sample rate. Third, HMI responsiveness and remote I/O update rates both depend on the comms slice within the scan budget.

What the estimator models

The estimator multiplies your instruction count by a per-instruction execution time (0.05 µs for a high-end controller, 0.5 µs for a micro PLC — conservative rule-of-thumb values). It adds digital I/O time (approximately 1.5 µs per point), analogue I/O overhead (roughly 2.5 ms per 8-channel card, accounting for ADC conversion latency), and your estimated communications overhead. A ±30% spread is applied to reflect jitter from OS servicing, instruction-cache misses, and remote-I/O variability.

What the estimator does not model

CPU-specific pipeline stalls, instruction-mix effects (floating-point vs. bit instructions can differ by 10×), motion-control axis servicing, and any interrupt tasks you run outside the main scan. For accurate scan time on your specific controller, use the manufacturer’s scan-time diagnostic: Allen-Bradley uses the GSV instruction to read the Overhead Time Object; Siemens TIA Portal shows OB1 cycle time in the Watch Table; Omron reads D8012/D8013 system memory.

Where to see scan effects in practice

The free interactive PLC scan cycle visualizer lets you change a physical input between the read, solve, and write phases, while the scan cycle lesson explains how a slow scan affects output timing. The scenario auto-grades whether your outputs respond within the correct scan window. If your estimator result is marginal for your process, that scenario is the fastest way to observe the consequences.

See scan time effects in a live scenario

Numbers in a calculator are one thing. Watching outputs respond — or not — in a graded scenario makes the concept stick.

Scan time FAQ

Common questions about PLC scan time.

A PLC scan cycle is the repeating loop the CPU executes: read all inputs, execute the user program, write all outputs, then service communications. The total time for one complete loop is the scan time. Typical values range from 1 ms to 50 ms for most industrial controllers running moderate programs.

Technical reference and worked-example guide

PLC scan-time calculator: implementation, evidence and troubleshooting

Direct answer

PLC scan-time calculator becomes useful when it connects task period, scan components, instruction path, i/o update, communications, variation, event duration, response requirement and units with input event through module update, task scheduling, logic execution, output update and physical response, then proves minimum, nominal and conservative values calculated with units and checked against a measured or specified bound 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 programmers estimating whether input update, logic execution, output update and task scheduling can observe and respond within a requirement. The intended result is specific: the user can calculate a bounded estimate, state its assumptions and identify when measurement or a faster input, task or hardware function is required.

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

task period, scan components, instruction path, I/O update, communications, variation, event duration, response requirement and units. For PLC task and scan timing estimates, record the initial condition, actor, requested change, observable result and stopping condition before selecting a tool or implementation.

NODE 02observable

Map the evidence path

input event through module update, task scheduling, logic execution, output update and physical response. 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

minimum, nominal and conservative values calculated with units and checked against a measured or specified bound. 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

asynchronous I/O, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load. Choose minimum, maximum, simultaneous, delayed or restart conditions that reveal assumptions hidden by the happy path.

NODE 05observable

Diagnose a controlled fault

an input-update, scheduling, execution, output-update, unit or assumption error. 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 estimate compared with controller diagnostics, traces and an observed target acceptance test. 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 task period, scan components, instruction path, i/o update, communications, variation, event duration, response requirement and units 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 input event through module update, task scheduling, logic execution, output update and physical response 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 minimum, nominal and conservative values calculated with units and checked against a measured or specified bound 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 asynchronous i/o, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load 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-update, scheduling, execution, output-update, unit or assumption error 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 estimate compared with controller diagnostics, traces and an observed target acceptance test and repeat the affected regression cases.

    Evidence: Reference use is complete when inputs, assumptions, units or initial conditions are recorded and the result is independently checked at a useful boundary.

    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 PLC scan-time calculator: implementation, evidence and troubleshooting
Observed symptomInspectInterpretationNext proving action
The expected result is unclearRequirement, initial state, actor, stimulus, units and pass conditionThe technician, programmer and reviewer 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 page connects definitions and worked examples to runnable tools, explicit assumptions and repeatable checks so a formula or pattern can be challenged.

Where simulation stops

A calculator estimate cannot reproduce firmware scheduling, communications, interrupts, cache, I/O module updates, network delay or worst-case target load.

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. task period, scan components, instruction path, I/O update, communications, variation, event duration, response requirement and units. For PLC task and scan timing estimates, 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 task period, scan components, instruction path, i/o update, communications, variation, event duration, response requirement and units 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 technician, programmer and reviewer 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 calculate PLC scan time? A defensible short answer is: Add or measure the relevant input update, scheduled wait, program execution, communication and output update terms for the task being evaluated, then include observed variation rather than relying on one nominal value.

Case 02

predict → observe → prove

Prove map the evidence path

Engineering context. input event through module update, task scheduling, logic execution, output update and physical response. 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 input event through module update, task scheduling, logic execution, output update and physical response 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: Can a PLC detect a pulse shorter than one scan? A defensible short answer is: It may miss an ordinary sampled pulse. Use input latching, a high-speed counter, an event task or suitable hardware when the event contract requires it.

Case 03

predict → observe → prove

Prove prove normal operation

Engineering context. minimum, nominal and conservative values calculated with units and checked against a measured or specified bound. 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 minimum, nominal and conservative values calculated with units and checked against a measured or specified bound 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 PLC task and scan timing estimates? A defensible short answer is: Start with the operating contract and evidence path: task period, scan components, instruction path, i/o update, communications, variation, event duration, response requirement and units, followed by input event through module update, task scheduling, logic execution, output update and physical response. Add advanced features only after the baseline is predictable.

Case 04

predict → observe → prove

Prove exercise a boundary case

Engineering context. asynchronous I/O, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load. 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 asynchronous i/o, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load 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 PLC task and scan timing estimates 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-update, scheduling, execution, output-update, unit or assumption error. 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-update, scheduling, execution, output-update, unit or assumption error 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 estimate compared with controller diagnostics, traces and an observed target acceptance test. 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 estimate compared with controller diagnostics, traces and an observed target acceptance test and repeat the affected regression cases. The acceptance record should show this result: reference use is complete when inputs, assumptions, units or initial conditions are recorded and the result is independently checked at a useful boundary. 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-update, scheduling, execution, output-update, unit or assumption error or asynchronous i/o, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load can expose assumptions that never appear during ideal startup and steady operation.

Answer surface / 07

Questions people ask about PLC scan-time calculator

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 calculate PLC scan time?

Add or measure the relevant input update, scheduled wait, program execution, communication and output update terms for the task being evaluated, then include observed variation rather than relying on one nominal value.

Can a PLC detect a pulse shorter than one scan?

It may miss an ordinary sampled pulse. Use input latching, a high-speed counter, an event task or suitable hardware when the event contract requires it.

What should I learn first about PLC task and scan timing estimates?

Start with the operating contract and evidence path: task period, scan components, instruction path, i/o update, communications, variation, event duration, response requirement and units, followed by input event through module update, task scheduling, logic execution, output update and physical response. Add advanced features only after the baseline is predictable.

How do I practise PLC task and scan timing estimates 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-update, scheduling, execution, output-update, unit or assumption error or asynchronous i/o, missed pulses, periodic tasks, interrupts, communications, online monitoring, jitter and peak load 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.