Process Life Cycle States and Transition Diagram in Operating Systems

Process Life Cycle States and Transition Diagram in Operating Systems

Verified Sources
May 27, 2026

A process in an operating system does not execute in one uninterrupted stretch. Instead, it moves through a set of well-defined states from creation to completion. The classic five-state model includes New, Ready, Running, Waiting/Blocked, and Terminated.3

The purpose of a transition diagram is to show both:

  1. the possible states of a process, and
  2. the events that cause movement from one state to another, such as scheduling, preemption, I/O wait, and completion.2

A process typically enters the system when it is created, waits in a ready queue for CPU service, executes when scheduled, may pause for I/O or another event, and eventually exits.2 In a single-processor system, at most one process is in the Running state at a time, while many may be in Ready or Waiting queues.2

The standard transition diagram is:

This model is fundamental to understanding CPU scheduling and context switching, because every scheduling decision depends on the current state of each process.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions. 2 3

  2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes. 2

  3. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching. 2 3 4

  4. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states. 2

Process State Transition Diagram and Various Schedulers

Core Idea

A process does not move randomly. Each arrow in the transition diagram corresponds to a specific operating-system event such as admission, dispatch, preemption, I/O wait, event completion, or exit.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

The Five Main Process States

1. New

The New state represents a process that has just been created. At this point, the OS has recognized the program as a process and begins preparing its internal representation, usually including a PCB.2 The process is not yet executing; it must first be admitted to main memory and the ready queue.2

2. Ready

A process in the Ready state has everything needed to execute except the CPU itself.2 It is loaded or admitted for execution and waits in the ready queue until the scheduler selects it. Multiple processes may be ready simultaneously.2

3. Running

A process is Running when the CPU is actively executing its instructions.2 In a single-core system, only one process can occupy this state at any instant. While running, the process may finish, be preempted, or request an operation that forces it to wait.2

4. Waiting / Blocked

A process enters the Waiting or Blocked state when it cannot continue until some event occurs, most commonly I/O completion, user input, inter-process signaling, or resource availability.3 This distinction is important: a ready process is able to run but lacks the CPU, whereas a blocked process cannot run even if the CPU is free.2

5. Terminated

The Terminated state marks the end of the process life cycle. The process has either completed successfully or has been aborted by the OS or another entity.2 Its resources are released, and its PCB is eventually removed.

A useful conceptual summary is shown below:

StateMeaningCan Use CPU Now?Typical Next State
NewProcess is being createdNoReady
ReadyPrepared to execute, waiting for CPUNoRunning
RunningCurrently executing on CPUYesReady, Waiting, or Terminated
Waiting / BlockedWaiting for event or resourceNoReady
TerminatedExecution finishedNoNone

3

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions. 2 3 4 5 6 7 8

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching. 2 3 4 5

  3. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes. 2 3 4 5 6 7

  4. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states. 2 3 4

How a Process Moves Through Its Life Cycle

  1. 1
    Step 1

    The OS creates a new process, assigns an identifier, and builds the PCB. At this moment, the process is in the New state.2

    Footnotes

    1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

    2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

  2. 2
    Step 2

    After initialization, the process is admitted to memory or the ready queue, where it waits for CPU allocation. It is now in the Ready state.2

    Footnotes

    1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

    2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

  3. 3
    Step 3

    The short-term scheduler selects the process and dispatches it to the processor. The state changes from Ready to Running.2

    Footnotes

    1. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

    2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

  4. 4
    Step 4

    While running, the process may continue computing, get preempted when its time slice expires, or lose the CPU to a higher-priority process. In those cases, it moves back to Ready.2

    Footnotes

    1. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

    2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

  5. 5
    Step 5

    If the process requests I/O or must wait for some external event, it leaves the CPU and enters the Waiting or Blocked state.2

    Footnotes

    1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

    2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

  6. 6
    Step 6

    When the needed event occurs, such as completion of disk or keyboard I/O, the process becomes eligible to run again and returns to Ready.2

    Footnotes

    1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

    2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

  7. 7
    Step 7

    Once execution finishes or the process is aborted, it transitions from Running to Terminated and the OS reclaims its resources.2

    Footnotes

    1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

    2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

Common Exam Confusion

Ready and Waiting are not the same. A ready process is able to execute but is waiting for CPU assignment, whereas a waiting process cannot execute until some event occurs.2

Footnotes

  1. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

  2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

Interpreting the Transition Diagram

The transition arrows represent operating-system events rather than arbitrary movements. The most important transitions are:

  • New \rightarrow Ready: the process is admitted after creation.2
  • Ready \rightarrow Running: the scheduler dispatches the process to the CPU.2
  • Running \rightarrow Waiting: the process requests I/O or must wait for an event.2
  • Waiting \rightarrow Ready: the event completes and the process becomes runnable again.2
  • Running \rightarrow Ready: preemption occurs because the time quantum expires or a higher-priority process arrives.2
  • Running \rightarrow Terminated: execution ends or the process is killed.2

The diagram can also be understood as a resource-eligibility model:

  • Ready means eligible for CPU.
  • Running means currently using CPU.
  • Waiting means temporarily ineligible due to an unsatisfied event condition.2

A more detailed conceptual flow is:

This explains why processes may cycle repeatedly among Ready, Running, and Waiting many times, but normally enter New once and Terminated once.

Footnotes

  1. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching. 2 3 4

  2. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions. 2 3 4

  3. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states. 2 3 4

  4. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes. 2 3 4

The classical model contains New, Ready, Running, Waiting, and Terminated. It is the standard introductory representation used to explain process behavior and scheduling.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

Extended Process States: Suspended Variants

Many modern descriptions go beyond the basic five-state model and add suspended states:

  • Ready Suspend
  • Blocked Suspend2

These appear when the OS removes a process from main memory, usually to manage limited RAM through swapping. A blocked process may be moved to Blocked Suspend if it is waiting for an event and is not immediately useful in memory. If the event later occurs while it is still swapped out, it may become Ready Suspend until it is brought back into memory.2

This extended model is especially useful when discussing swapping and medium-term scheduling.2 However, for most introductory explanations of the process life cycle, the five-state diagram remains the primary model.2

Footnotes

  1. Process Suspension and Process Switching - TutorialsPoint - Explains suspended states and memory-related swapping behavior. 2 3 4

  2. Lecture 05 Chapter 3: Process Concepts PDF - Shows the seven-state model with Ready Suspend and Blocked Suspend transitions. 2 3

  3. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  4. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

Important Clarifications and Edge Cases

Typical Causes of Process State Transitions

Conceptual frequency comparison in introductory operating-system workloads

The chart above is a conceptual learning aid, not a universal measurement. In many interactive and multiprogrammed systems, transitions related to I/O waiting and event completion occur very frequently because processes often alternate between CPU bursts and I/O bursts.2 By contrast, termination occurs only once per process.

From a scheduling perspective, the three most active operational states are:

  • Ready
  • Running
  • Waiting2

The OS constantly moves processes among these states to maximize CPU utilization and system responsiveness.2 This is why process-state diagrams are central not only to process management but also to queueing, scheduling, and context-switch analysis.2

Mathematically, if a process alternates between CPU bursts and I/O waits, its lifetime can be viewed as a sequence of transitions:

NewReady(RunningWaitingReady)kTerminated\text{New} \rightarrow \text{Ready} \rightarrow (\text{Running} \leftrightarrow \text{Waiting} \leftrightarrow \text{Ready})^k \rightarrow \text{Terminated}

where k0k \geq 0 denotes the number of repeated execution-wait cycles.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions. 2 3

  2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states. 2 3 4

  3. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

  4. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching. 2

  5. Process Suspension and Process Switching - TutorialsPoint - Explains suspended states and memory-related swapping behavior.

Chronological Roadmap of a Process Life Cycle

Process Creation

Stage 1

The OS creates the process and initializes its PCB, placing it in the New state.2"

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

Admission

Stage 2

The process is admitted to the ready queue and becomes eligible for execution.2"

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

CPU Execution

Stage 3

The scheduler dispatches the process to the CPU, moving it into Running.2"

Footnotes

  1. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

  2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

Possible Wait Cycle

Stage 4

The process may request I/O or another event, causing a transition to Waiting, then back to Ready after completion.2"

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states.

Completion

Stage 5

When execution finishes or the process is aborted, it enters the Terminated state.2"

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes.

Memory Aid

Remember the logic as: created, prepared, executing, paused, finished. That corresponds to New, Ready, Running, Waiting, and Terminated.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions.

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

Final Conceptual Summary

The life cycle of a process is best understood as a controlled progression through states managed by the operating system.2 The transition diagram shows not only where a process can be, but also why it moves:

  • creation leads to New,
  • admission leads to Ready,
  • CPU allocation leads to Running,
  • I/O or event dependency leads to Waiting,
  • completion leads to Terminated.3

The most important insight is that process management is dynamic. A process may repeatedly alternate between Ready, Running, and Waiting, depending on scheduling and external events.2 This dynamic behavior is what allows a multiprogramming operating system to keep the CPU busy, overlap computation with I/O, and manage many tasks efficiently.2

Footnotes

  1. States of a Process in Operating Systems - GeeksforGeeks - Overview of the five main states and standard transitions. 2

  2. Chapter 3: Processes (Operating System Concepts, 10th Edition slides) - Defines process states, transition diagrams, queues, and context switching.

  3. 5 State Process Model in Operating System - GeeksforGeeks - Describes the five-state model and common state changes. 2

  4. Understanding Process States in Operating Systems - Summarizes the reasons for transitions among ready, running, waiting, and terminated states. 2 3

  5. Process Suspension and Process Switching - TutorialsPoint - Explains suspended states and memory-related swapping behavior.

Knowledge Check

Question 1 of 5
Q1Single choice

Which process state means the process is prepared to execute but is waiting for CPU allocation?

Explore Related Topics

1

Understanding Belady's Anomaly in Operating Systems

Belady's Anomaly shows that, for some page‑replacement policies, adding more physical frames can increase the number of page faults.

  • FIFO (a non‑stack algorithm) does not satisfy the inclusion property and can exhibit the anomaly.
  • On the reference string 1,2,3,4,1,2,5,1,2,3,4,51,2,3,4,1,2,5,1,2,3,4,5, FIFO yields 99 faults with 33 frames but 1010 faults with 44 frames.
  • Stack algorithms such as LRU or Optimal obey M(N,t)M(N+1,t)M(N,t)\subseteq M(N+1,t), guaranteeing that more frames never raise fault counts.
  • Designing a virtual‑memory system with stack‑based replacement eliminates Belady's Anomaly.
2

Process Scheduling in a Multiprogramming Operating System

Process scheduling is the OS mechanism that selects which ready process runs on a single CPU in a multiprogramming system, keeping the processor busy while processes alternate between CPU and I/O bursts.

  • Aim: maximize CPU utilization and throughput, minimize turnaround, waiting, and response times.
  • The short‑term scheduler picks a ready process (e.g., FCFS, priority, round‑robin) and the dispatcher performs the context switch.
  • Metrics: Turnaround Time=Completion TimeArrival Time \text{Turnaround Time}= \text{Completion Time} - \text{Arrival Time}, Waiting Time=Turnaround TimeCPU Burst Time \text{Waiting Time}= \text{Turnaround Time} - \text{CPU Burst Time}; trade‑offs mean no policy optimizes all goals, and favoring short jobs can cause starvation, requiring fairness mechanisms such as aging.
3

Machine Learning Foundations and Lifecycle

Machine learning is an AI subfield that builds models to learn patterns from data, covering its paradigms, lifecycle, mathematics, and common algorithms.

  • Supervised, unsupervised, and reinforcement learning describe the three main paradigms.
  • Standard dataset partitioning allocates 70 % for training, 15 % for validation, and 15 % for testing.
  • The ML lifecycle progresses through problem definition, data collection/preprocessing, feature engineering, model training, evaluation/tuning, and deployment/monitoring, with data quality and overfitting as key concerns.
  • Understanding linear algebra, calculus (gradient descent), and probability/statistics is essential for model development.
  • Typical algorithms include linear regression, decision trees, k‑means clustering, and neural networks.