Example logic from Gordon: A customer arrives (GENERATE). They wait for a teller (QUEUE/SEIZE). They are served (ADVANCE 10,20 for uniform service time). They leave (RELEASE/TERMINATE).
import simpy import random def customer(env, name, server): print(f'{name} arrives at {env.now:.2f}') with server.request() as req: yield req # This is the SEIZE (and implicit QUEUE) print(f'{name} starts service at {env.now:.2f}') service_time = random.uniform(8, 16) # ADVANCE 12,4 range yield env.timeout(service_time) print(f'{name} leaves at {env.now:.2f}') # RELEASE
Later simulation textbooks (by Banks, Carson, Nelson, or Law) are excellent, but they are dense. Gordon wrote with a clarity that came from actually building the first simulation languages. He isn't citing someone else's research in a footnote; he is telling you how he solved the problem in 1962. That authenticity is addictive.
Gordon’s GPSS logic:
In the vast library of technical computing, few books have managed to bridge the gap between academic theory and practical industrial application quite like System Simulation by Geoffrey Gordon .
Gordon was not just a theorist; he was the creator of , one of the first high-level simulation languages. GPSS was revolutionary because it allowed engineers to model complex systems (like factories or communication networks) using a block-diagram approach rather than writing thousands of lines of assembly code.
GENERATE 10,5 ; Customers arrive every 10±5 min QUEUE LINE ; Enter the waiting line SEIZE TELLER ; Take the teller if free DEPART LINE ; Leave the line ADVANCE 12,4 ; Service takes 12±4 min RELEASE TELLER ; Free the teller TERMINATE ; Customer leaves Modern Python (SimPy):
