Simpy
Build, inspect, test, and analyze bounded process-based discrete-event simulations with SimPy, including events, resources, interrupts, monitoring, replications, warm-up, and reproducible output analysis.
How to use it
- Hit Copy SKILL.md — or use the Claude Code line below to get every file.
- Claude: ⋯ → Download .md, then Customize → Skills → Add → Upload skill.
ChatGPT: make a Project and paste it into Instructions.
Neither? Paste it at the top of a new chat — it works for that chat. - Describe your job in plain words. The AI follows the skill from there.
npx degit K-Dense-AI/scientific-agent-skills/skills/simpy#main ~/.claude/skills/simpyFor one project only, change the path to .claude/skills/simpy. This skill also uses config.json — copying SKILL.md alone won't be enough. See the folder on GitHub.
Not working?
- Check which app you pasted it into — the steps above name the right one.
- Some skills need the paid tier of Claude or ChatGPT.
Paste into Claude, ChatGPT or Cursor.
Show the full text301 lines
SimPy
Scope
Use this skill for process-based discrete-event models where active entities yield events and contend for resources: queues, production systems, logistics, networks, service operations, inventory, and other event-driven systems.
SimPy supplies an event scheduler and modeling primitives. It does not choose a scientifically valid conceptual model, input distribution, warm-up, run length, replication count, estimand, or causal interpretation. Treat those as simulation-study methodology, not SimPy API behavior.
Current release and installation
Verified 2026-07-23:
- Latest stable: SimPy 4.1.2, released on PyPI 2026-05-24; source tag
4.1.2points to commitf4381649. - Package metadata requires Python >=3.8 and classifies CPython 3.8-3.14 plus PyPy. SimPy has no runtime dependencies.
- 4.1.2 adds Python 3.13/3.14 support and modern-interpreter test fixes.
- Upstream and this skill are MIT-licensed.
Create a reproducible environment:
uv venv --python 3.13
source .venv/bin/activate
uv pip install "simpy==4.1.2"
python -c "import importlib.metadata; print(importlib.metadata.version('simpy'))"
Do not silently substitute the latest documentation build: it may describe an
unreleased development revision. Use the versioned 4.1.2 links in
references/sources.md.
Model workflow
- Define purpose and estimands. State the decision/question, system boundary, entities, resources, state, outputs, time units, and terminating event or steady-state target.
- Write a conceptual model first. Record assumptions, distributions, routing, priorities, initial conditions, and omitted mechanisms.
- Implement generators. A SimPy process is an event-yielding Python generator.
Register the generator object with
env.process(...). - Bound execution. Give every production run explicit time, entity, event, and
replication caps. Never call
env.run()on a model containing an endless process. - Separate random streams. Use local RNG instances for logically distinct stochastic sources; retain a seed manifest.
- Instrument deliberately. Observe state after the transition of interest, close time-weighted intervals at the horizon, and test that monitoring does not alter event order.
- Verify and validate. Test deterministic edge cases, conservation identities, traces, queue discipline, and analytical benchmarks; compare against system or expert evidence for the stated purpose.
- Run independent replications. Make intervals from replication-level estimates, not correlated entities within one run.
- Report limitations. Include initialization, unfinished entities, run length, seeds/streams, precision, sensitivity, and validation evidence. Never convert simulation association into a causal claim.
Read references/simulation-methodology.md before making inferential claims.
Minimal bounded model
import random
import simpy
HORIZON = 480.0
arrival_rng = random.Random(101)
service_rng = random.Random(202)
env = simpy.Environment()
server = simpy.Resource(env, capacity=2)
completed = []
def customer(arrival):
with server.request() as request:
yield request
wait = env.now - arrival
yield env.timeout(service_rng.expovariate(1 / 6.0))
completed.append((env.now, wait))
def arrivals():
for _ in range(10_000): # Entity cap.
delay = arrival_rng.expovariate(1 / 4.0)
if env.now + delay >= HORIZON:
return
yield env.timeout(delay)
env.process(customer(env.now))
env.process(arrivals())
env.run(until=HORIZON)
The numeric horizon is half-open: normal events scheduled exactly at 480.0 are
not processed. Report unfinished entities rather than silently treating them as
completed observations.
Core semantics
Environment and deterministic ordering
Environment is single-threaded. The queue is ordered by simulation time, event
priority, then a strictly increasing event ID. Same-time, same-priority events are
therefore processed FIFO in scheduling order. Model processes may represent
concurrency, but callbacks execute sequentially and deterministically.
env.now: unitless simulation clock; choose and document one unit.env.peek(): next event time or infinity.env.step(): process one event; raisesEmptySchedulewhen empty.env.active_process: currently executing process, otherwiseNone.env.run(): drain the queue; unsafe with recurring or endless processes.
env.run(until=number) and env.run(until=event) are not interchangeable at
boundaries:
- A numeric value schedules an urgent stop event and excludes ordinary events at that exact time.
- An Event criterion returns that event's value when its stop callback fires. Other same-time ordering depends on priority and scheduling order.
- In 4.1.2,
Environment.step()preserves callbacks remaining afterStopSimulationby rescheduling the target. Consequently, afterenv.run(until=target),target.processedcan remainFalseuntil one morestep()/run()even though its value was returned. Do not useprocessedas the sole post-run completion test.
See references/events.md and references/monitoring.md.
Event, Timeout, Process, and Condition
- An
Eventmoves once through not-triggered -> triggered/scheduled -> processed.succeed(value)orfail(exception)triggers it once. - A
Timeouttriggers when created, is scheduled fornow + delay, and cannot be manually succeeded again. env.process(generator)creates aProcess; the generator resumes with the yielded event value. Returning from the generator succeeds the Process with that return value. Uncaught exceptions fail it.AnyOf/a | bandAllOf/a & byield aConditionValue: an ordered, dict-like mapping from event objects to their values. Test membership using the original event objects; do not assume a scalar result.AnyOfdoes not cancel losing events. Explicitly cancel pending resource requests when abandoning them; ordinary timeouts remain scheduled.
Interrupts
process.interrupt(cause) schedules an urgent interruption that throws
simpy.Interrupt into the target generator. Catch it around the yielded work that
may be interrupted, inspect interrupt.cause, update remaining work, then either
resume, re-yield the original event, or terminate.
Interrupting a process removes its resume callback from its current target; it does
not cancel that target event. A process cannot interrupt itself or a terminated
process. See references/process-interaction.md.
Shared resources
| Type | Semantics |
|---|---|
Resource |
FIFO semaphore-like usage slots |
PriorityResource |
Queued requests sorted by lower numeric priority first |
PreemptiveResource |
Priority queue plus optional preemption of a current user |
Container |
Homogeneous numeric level; put/get wait for capacity/material |
Store |
FIFO Python objects |
FilterStore |
First available item satisfying the request's predicate |
PriorityStore |
Comparable items returned in priority order |
Use a request context manager:
def job(env, resource):
with resource.request() as request:
yield request
yield env.timeout(3)
On exit it releases an acquired request or cancels a still-pending one, including
during exception unwinding. For a manually retained pending put/get/request,
call cancel() if an interrupt or timeout makes the process abandon it.
PreemptiveResource.request(priority=..., preempt=True) uses lower numbers as
higher priority. The preempted process receives an Interrupt whose cause is a
Preempted object: cause.by is the preempting Process,
cause.usage_since is when use began, and cause.resource is the resource.
Queued priority takes precedence over the preempt flag; mixing preempting and
non-preempting requests needs explicit tests.
Read references/resources.md for blocked operations, queue rules, and examples.
Monitoring and stepping
Prefer explicit domain observations at state transitions. For generic resource
monitoring, wrappers or subclasses can inspect count, queue, level, items,
put_queue, and get_queue. For event tracing, schedule() and step() are the
central hooks.
Queue measurements are timing-sensitive:
- A request method's pre-state, post-call state, grant callback, and release callback can all differ at the same simulation timestamp.
- Sample averages weight event observations, not time. Compute area under the left-continuous state path and divide by elapsed time.
- Add initial and final samples; close the last interval at the analysis horizon.
env._queue, resource_env, and monkey-patching are implementation details. Pin SimPy, isolate the instrumentation, and regression-test after upgrades.- Tracing every event changes runtime and memory use; cap trace records.
Use scripts/resource_monitor.py and references/monitoring.md.
Real-time execution
simpy.rt.RealtimeEnvironment(initial_time=0, factor=1.0, strict=True) maps one
simulation unit to factor wall-clock seconds. In strict mode, step()/run()
raises RuntimeError when computation falls behind. strict=False tolerates lag;
it does not restore timing accuracy. Develop logic with Environment, then run
separate timing tests with generous platform-aware tolerances. See
references/real-time.md.
Bundled safe CLIs
All CLIs use a fixed built-in queue model or summarize local artifacts. They reject unknown JSON keys, URLs, symlinks, non-finite numbers, oversized inputs, and unbounded time/events/entities/replications. They never evaluate config text, execute user Python, import plugins, or call a network service.
# Inspect all options.
python skills/simpy/scripts/bounded_queue_scenario.py --help
python skills/simpy/scripts/replication_runner.py --help
python skills/simpy/scripts/event_trace_summary.py --help
python skills/simpy/scripts/validate_simulation_config.py --help
# Deterministic built-in scenario.
python skills/simpy/scripts/bounded_queue_scenario.py
# Independent replications with replication-level Student-t intervals.
python skills/simpy/scripts/replication_runner.py
# Validate only; no simulation runs.
python skills/simpy/scripts/validate_simulation_config.py config.json
The replication runner refuses one-replication intervals. Its intervals quantify
Monte Carlo uncertainty under the configured model; they neither validate the model
nor identify causal effects. See references/cli-guide.md.
Testing
Use deterministic unit tests for ordering, boundary times, conditions, interrupts, all resource disciplines, conservation, event/entity limits, seed reproducibility, and monitor non-interference. Add stochastic tests only as broad distributional checks with fixed seeds; avoid brittle exact sample estimates.
Run the skill's suite in the exact pinned environment without bytecode artifacts:
PYTHONDONTWRITEBYTECODE=1 uv run --isolated --no-project \
--python 3.13 --with "simpy==4.1.2" \
python -m unittest discover -s tests/simpy -v
References
references/events.md— scheduler, lifecycle, run boundaries, conditionsreferences/process-interaction.md— generators, shared events, interruptsreferences/resources.md— all Resource, Container, and Store variantsreferences/monitoring.md— time weighting, queue timing, tracing, steppingreferences/real-time.md— factor, strict mode, drift, timing testsreferences/simulation-methodology.md— replications, warm-up, validation, CIreferences/cli-guide.md— schemas, bounds, outputs, and safe CLI examplesreferences/sources.md— dated official and primary-method sources
Citing Scientific Agent Skills
This skill is part of Scientific Agent Skills by K-Dense. If it materially contributed to a manuscript, report, presentation, or code release, add the paper to the references or software section and tell the user you did so:
Kassis, T., Agarwal, V., He, Y., Patel, D., & Brueckner, A. M. (2026). Scientific Agent Skills: A Library of Procedural Knowledge for Research Agents. arXiv:2609.00065. https://doi.org/10.48550/arXiv.2609.00065
Always cite the current version. The DOI and https://arxiv.org/abs/2609.00065 resolve to the
latest arXiv version, so never append a version suffix such as v1. When network access is
available, fetch https://arxiv.org/abs/2609.00065 (or
http://export.arxiv.org/api/query?id_list=2609.00065) before writing the reference and take
the author list, year, and version from that record. If the record lists a journal reference
or publisher DOI, cite the published version instead.
| 1 | |
| 2 | name simpy |
| 3 | description Build, inspect, test, and analyze bounded process-based discrete-event simulations with SimPy, including events, resources, interrupts, monitoring, replications, warm-up, and reproducible output analysis. |
| 4 | license MIT |
| 5 | compatibility Upstream SimPy 4.1.2 supports Python 3.8+; bundled CLIs require Python 3.10+, uv, and SimPy 4.1.2. They use only SimPy and the standard library, operate on local bounded inputs, and make no network calls. |
| 6 | allowed-tools Read Write Edit Bash Glob |
| 7 | metadata |
| 8 | version "1.4" |
| 9 | skill-author K-Dense Inc. |
| 10 | |
| 11 | |
| 12 | # SimPy |
| 13 | |
| 14 | ## Scope |
| 15 | |
| 16 | Use this skill for process-based discrete-event models where active entities yield |
| 17 | events and contend for resources: queues, production systems, logistics, networks, |
| 18 | service operations, inventory, and other event-driven systems. |
| 19 | |
| 20 | SimPy supplies an event scheduler and modeling primitives. It does **not** choose a |
| 21 | scientifically valid conceptual model, input distribution, warm-up, run length, |
| 22 | replication count, estimand, or causal interpretation. Treat those as simulation-study |
| 23 | methodology, not SimPy API behavior. |
| 24 | |
| 25 | ## Current release and installation |
| 26 | |
| 27 | Verified **2026-07-23**: |
| 28 | |
| 29 | Latest stable: **SimPy 4.1.2**, released on PyPI 2026-05-24; source tag |
| 30 | `4.1.2` points to commit `f4381649`. |
| 31 | Package metadata requires Python **>=3.8** and classifies CPython 3.8-3.14 |
| 32 | plus PyPy. SimPy has no runtime dependencies. |
| 33 | 4.1.2 adds Python 3.13/3.14 support and modern-interpreter test fixes. |
| 34 | Upstream and this skill are MIT-licensed. |
| 35 | |
| 36 | Create a reproducible environment: |
| 37 | |
| 38 | |
| 39 | uv venv --python 3.13 |
| 40 | source .venv/bin/activate |
| 41 | uv pip install "simpy==4.1.2" |
| 42 | python -c "import importlib.metadata; print(importlib.metadata.version('simpy'))" |
| 43 | |
| 44 | |
| 45 | Do not silently substitute the `latest` documentation build: it may describe an |
| 46 | unreleased development revision. Use the versioned 4.1.2 links in |
| 47 | `references/sources.md`. |
| 48 | |
| 49 | ## Model workflow |
| 50 | |
| 51 | **Define purpose and estimands.** State the decision/question, system boundary, |
| 52 | entities, resources, state, outputs, time units, and terminating event or |
| 53 | steady-state target. |
| 54 | **Write a conceptual model first.** Record assumptions, distributions, |
| 55 | routing, priorities, initial conditions, and omitted mechanisms. |
| 56 | **Implement generators.** A SimPy process is an event-yielding Python generator. |
| 57 | Register the generator object with `env.process(...)`. |
| 58 | **Bound execution.** Give every production run explicit time, entity, event, and |
| 59 | replication caps. Never call `env.run()` on a model containing an endless process. |
| 60 | **Separate random streams.** Use local RNG instances for logically distinct |
| 61 | stochastic sources; retain a seed manifest. |
| 62 | **Instrument deliberately.** Observe state after the transition of interest, |
| 63 | close time-weighted intervals at the horizon, and test that monitoring does not |
| 64 | alter event order. |
| 65 | **Verify and validate.** Test deterministic edge cases, conservation identities, |
| 66 | traces, queue discipline, and analytical benchmarks; compare against system or |
| 67 | expert evidence for the stated purpose. |
| 68 | **Run independent replications.** Make intervals from replication-level |
| 69 | estimates, not correlated entities within one run. |
| 70 | **Report limitations.** Include initialization, unfinished entities, run length, |
| 71 | seeds/streams, precision, sensitivity, and validation evidence. Never convert |
| 72 | simulation association into a causal claim. |
| 73 | |
| 74 | Read `references/simulation-methodology.md` before making inferential claims. |
| 75 | |
| 76 | ## Minimal bounded model |
| 77 | |
| 78 | |
| 79 | import random |
| 80 | import simpy |
| 81 | |
| 82 | HORIZON = 480.0 |
| 83 | arrival_rng = random.Random(101) |
| 84 | service_rng = random.Random(202) |
| 85 | env = simpy.Environment() |
| 86 | server = simpy.Resource(env, capacity=2) |
| 87 | completed = [] |
| 88 | |
| 89 | def customer(arrival): |
| 90 | with server.request() as request: |
| 91 | yield request |
| 92 | wait = env.now - arrival |
| 93 | yield env.timeout(service_rng.expovariate(1 / 6.0)) |
| 94 | completed.append((env.now, wait)) |
| 95 | |
| 96 | def arrivals(): |
| 97 | for _ in range(10_000): # Entity cap. |
| 98 | delay = arrival_rng.expovariate(1 / 4.0) |
| 99 | if env.now + delay >= HORIZON: |
| 100 | return |
| 101 | yield env.timeout(delay) |
| 102 | env.process(customer(env.now)) |
| 103 | |
| 104 | env.process(arrivals()) |
| 105 | env.run(until=HORIZON) |
| 106 | |
| 107 | |
| 108 | The numeric horizon is half-open: normal events scheduled exactly at `480.0` are |
| 109 | not processed. Report unfinished entities rather than silently treating them as |
| 110 | completed observations. |
| 111 | |
| 112 | ## Core semantics |
| 113 | |
| 114 | ### Environment and deterministic ordering |
| 115 | |
| 116 | `Environment` is single-threaded. The queue is ordered by simulation time, event |
| 117 | priority, then a strictly increasing event ID. Same-time, same-priority events are |
| 118 | therefore processed FIFO in scheduling order. Model processes may represent |
| 119 | concurrency, but callbacks execute sequentially and deterministically. |
| 120 | |
| 121 | `env.now`: unitless simulation clock; choose and document one unit. |
| 122 | `env.peek()`: next event time or infinity. |
| 123 | `env.step()`: process one event; raises `EmptySchedule` when empty. |
| 124 | `env.active_process`: currently executing process, otherwise `None`. |
| 125 | `env.run()`: drain the queue; unsafe with recurring or endless processes. |
| 126 | |
| 127 | `env.run(until=number)` and `env.run(until=event)` are not interchangeable at |
| 128 | boundaries: |
| 129 | |
| 130 | A numeric value schedules an urgent stop event and excludes ordinary events at |
| 131 | that exact time. |
| 132 | An Event criterion returns that event's value when its stop callback fires. |
| 133 | Other same-time ordering depends on priority and scheduling order. |
| 134 | In 4.1.2, `Environment.step()` preserves callbacks remaining after |
| 135 | `StopSimulation` by rescheduling the target. Consequently, after |
| 136 | `env.run(until=target)`, `target.processed` can remain `False` until one more |
| 137 | `step()`/`run()` even though its value was returned. Do not use `processed` as the |
| 138 | sole post-run completion test. |
| 139 | |
| 140 | See `references/events.md` and `references/monitoring.md`. |
| 141 | |
| 142 | ### Event, Timeout, Process, and Condition |
| 143 | |
| 144 | An `Event` moves once through not-triggered -> triggered/scheduled -> processed. |
| 145 | `succeed(value)` or `fail(exception)` triggers it once. |
| 146 | A `Timeout` triggers when created, is scheduled for `now + delay`, and cannot be |
| 147 | manually succeeded again. |
| 148 | `env.process(generator)` creates a `Process`; the generator resumes with the |
| 149 | yielded event value. Returning from the generator succeeds the Process with that |
| 150 | return value. Uncaught exceptions fail it. |
| 151 | `AnyOf` / `a | b` and `AllOf` / `a & b` yield a `ConditionValue`: an ordered, |
| 152 | dict-like mapping from **event objects** to their values. Test membership using |
| 153 | the original event objects; do not assume a scalar result. |
| 154 | `AnyOf` does not cancel losing events. Explicitly cancel pending resource |
| 155 | requests when abandoning them; ordinary timeouts remain scheduled. |
| 156 | |
| 157 | ### Interrupts |
| 158 | |
| 159 | `process.interrupt(cause)` schedules an urgent interruption that throws |
| 160 | `simpy.Interrupt` into the target generator. Catch it around the yielded work that |
| 161 | may be interrupted, inspect `interrupt.cause`, update remaining work, then either |
| 162 | resume, re-yield the original event, or terminate. |
| 163 | |
| 164 | Interrupting a process removes its resume callback from its current target; it does |
| 165 | not cancel that target event. A process cannot interrupt itself or a terminated |
| 166 | process. See `references/process-interaction.md`. |
| 167 | |
| 168 | ## Shared resources |
| 169 | |
| 170 | | Type | Semantics | |
| 171 | |---|---| |
| 172 | | `Resource` | FIFO semaphore-like usage slots | |
| 173 | | `PriorityResource` | Queued requests sorted by lower numeric priority first | |
| 174 | | `PreemptiveResource` | Priority queue plus optional preemption of a current user | |
| 175 | | `Container` | Homogeneous numeric level; `put`/`get` wait for capacity/material | |
| 176 | | `Store` | FIFO Python objects | |
| 177 | | `FilterStore` | First available item satisfying the request's predicate | |
| 178 | | `PriorityStore` | Comparable items returned in priority order | |
| 179 | |
| 180 | Use a request context manager: |
| 181 | |
| 182 | |
| 183 | def job(env, resource): |
| 184 | with resource.request() as request: |
| 185 | yield request |
| 186 | yield env.timeout(3) |
| 187 | |
| 188 | |
| 189 | On exit it releases an acquired request or cancels a still-pending one, including |
| 190 | during exception unwinding. For a manually retained pending `put`/`get`/request, |
| 191 | call `cancel()` if an interrupt or timeout makes the process abandon it. |
| 192 | |
| 193 | `PreemptiveResource.request(priority=..., preempt=True)` uses lower numbers as |
| 194 | higher priority. The preempted process receives an `Interrupt` whose cause is a |
| 195 | `Preempted` object: `cause.by` is the preempting Process, |
| 196 | `cause.usage_since` is when use began, and `cause.resource` is the resource. |
| 197 | Queued priority takes precedence over the `preempt` flag; mixing preempting and |
| 198 | non-preempting requests needs explicit tests. |
| 199 | |
| 200 | Read `references/resources.md` for blocked operations, queue rules, and examples. |
| 201 | |
| 202 | ## Monitoring and stepping |
| 203 | |
| 204 | Prefer explicit domain observations at state transitions. For generic resource |
| 205 | monitoring, wrappers or subclasses can inspect `count`, `queue`, `level`, `items`, |
| 206 | `put_queue`, and `get_queue`. For event tracing, `schedule()` and `step()` are the |
| 207 | central hooks. |
| 208 | |
| 209 | Queue measurements are timing-sensitive: |
| 210 | |
| 211 | A request method's pre-state, post-call state, grant callback, and release |
| 212 | callback can all differ at the same simulation timestamp. |
| 213 | Sample averages weight event observations, not time. Compute area under the |
| 214 | left-continuous state path and divide by elapsed time. |
| 215 | Add initial and final samples; close the last interval at the analysis horizon. |
| 216 | `env._queue`, resource `_env`, and monkey-patching are implementation details. |
| 217 | Pin SimPy, isolate the instrumentation, and regression-test after upgrades. |
| 218 | Tracing every event changes runtime and memory use; cap trace records. |
| 219 | |
| 220 | Use `scripts/resource_monitor.py` and `references/monitoring.md`. |
| 221 | |
| 222 | ## Real-time execution |
| 223 | |
| 224 | `simpy.rt.RealtimeEnvironment(initial_time=0, factor=1.0, strict=True)` maps one |
| 225 | simulation unit to `factor` wall-clock seconds. In strict mode, `step()`/`run()` |
| 226 | raises `RuntimeError` when computation falls behind. `strict=False` tolerates lag; |
| 227 | it does not restore timing accuracy. Develop logic with `Environment`, then run |
| 228 | separate timing tests with generous platform-aware tolerances. See |
| 229 | `references/real-time.md`. |
| 230 | |
| 231 | ## Bundled safe CLIs |
| 232 | |
| 233 | All CLIs use a fixed built-in queue model or summarize local artifacts. They reject |
| 234 | unknown JSON keys, URLs, symlinks, non-finite numbers, oversized inputs, and |
| 235 | unbounded time/events/entities/replications. They never evaluate config text, |
| 236 | execute user Python, import plugins, or call a network service. |
| 237 | |
| 238 | |
| 239 | # Inspect all options. |
| 240 | python skills/simpy/scripts/bounded_queue_scenario.py --help |
| 241 | python skills/simpy/scripts/replication_runner.py --help |
| 242 | python skills/simpy/scripts/event_trace_summary.py --help |
| 243 | python skills/simpy/scripts/validate_simulation_config.py --help |
| 244 | |
| 245 | # Deterministic built-in scenario. |
| 246 | python skills/simpy/scripts/bounded_queue_scenario.py |
| 247 | |
| 248 | # Independent replications with replication-level Student-t intervals. |
| 249 | python skills/simpy/scripts/replication_runner.py |
| 250 | |
| 251 | # Validate only; no simulation runs. |
| 252 | python skills/simpy/scripts/validate_simulation_config.py config.json |
| 253 | |
| 254 | |
| 255 | The replication runner refuses one-replication intervals. Its intervals quantify |
| 256 | Monte Carlo uncertainty under the configured model; they neither validate the model |
| 257 | nor identify causal effects. See `references/cli-guide.md`. |
| 258 | |
| 259 | ## Testing |
| 260 | |
| 261 | Use deterministic unit tests for ordering, boundary times, conditions, interrupts, |
| 262 | all resource disciplines, conservation, event/entity limits, seed reproducibility, |
| 263 | and monitor non-interference. Add stochastic tests only as broad distributional |
| 264 | checks with fixed seeds; avoid brittle exact sample estimates. |
| 265 | |
| 266 | Run the skill's suite in the exact pinned environment without bytecode artifacts: |
| 267 | |
| 268 | |
| 269 | PYTHONDONTWRITEBYTECODE=1 uv run --isolated --no-project \ |
| 270 | --python 3.13 --with "simpy==4.1.2" \ |
| 271 | python -m unittest discover -s tests/simpy -v |
| 272 | |
| 273 | |
| 274 | ## References |
| 275 | |
| 276 | `references/events.md` — scheduler, lifecycle, run boundaries, conditions |
| 277 | `references/process-interaction.md` — generators, shared events, interrupts |
| 278 | `references/resources.md` — all Resource, Container, and Store variants |
| 279 | `references/monitoring.md` — time weighting, queue timing, tracing, stepping |
| 280 | `references/real-time.md` — factor, strict mode, drift, timing tests |
| 281 | `references/simulation-methodology.md` — replications, warm-up, validation, CI |
| 282 | `references/cli-guide.md` — schemas, bounds, outputs, and safe CLI examples |
| 283 | `references/sources.md` — dated official and primary-method sources |
| 284 | |
| 285 | ## Citing Scientific Agent Skills |
| 286 | |
| 287 | This skill is part of Scientific Agent Skills by K-Dense. If it materially contributed to a |
| 288 | manuscript, report, presentation, or code release, add the paper to the references or |
| 289 | software section and tell the user you did so: |
| 290 | |
| 291 | > Kassis, T., Agarwal, V., He, Y., Patel, D., & Brueckner, A. M. (2026). Scientific Agent |
| 292 | > Skills: A Library of Procedural Knowledge for Research Agents. arXiv:2609.00065. |
| 293 | > https://doi.org/10.48550/arXiv.2609.00065 |
| 294 | |
| 295 | Always cite the current version. The DOI and https://arxiv.org/abs/2609.00065 resolve to the |
| 296 | latest arXiv version, so never append a version suffix such as `v1`. When network access is |
| 297 | available, fetch https://arxiv.org/abs/2609.00065 (or |
| 298 | http://export.arxiv.org/api/query?id_list=2609.00065) before writing the reference and take |
| 299 | the author list, year, and version from that record. If the record lists a journal reference |
| 300 | or publisher DOI, cite the published version instead. |
| 301 |