Simuvera

A name with possibilities.

The same event quantities can produce different final states

Use a fictional container with capacity six counters and an initial content of three. One batch brings four arriving counters and another event requests removal of two. Arrivals are accepted only while space remains; rejected counters leave the exercise permanently and do not wait. Removals take available counters. Compare two sequences starting from the same initial state: arrivals followed by removal, and removal followed by arrivals. This is a deterministic worksheet, not a test of an operating system.

Simuvera.com
Arrivals first in the Simuvera event-order worksheetCapacity 6 · start with 34 arrive: accept 3, reject 1Container now holds 6Remove 2: finish with 4State trace: 3 → 6 → 4

01

Process arrivals before making room

Starting with three counters leaves three free spaces. Of the four arrivals, three are accepted and one is rejected, so the container reaches six. Removing two then leaves four. Record the intermediate states as three, six and four. The conservation check is initial content plus accepted arrivals minus removals: three plus three minus two equals four. Separately check the arriving batch: three accepted plus one rejected equals four arrivals. The rejection is not undone when removal later creates space because this example explicitly gives rejected counters no waiting queue.

Removals first in the Simuvera event-order worksheetRestart from 3 · capacity 6Remove 2: container holds 14 arrive: accept all 4Finish with 5 · no rejectionState trace: 3 → 1 → 5

02

Make room before processing the arriving batch

Restart from three counters rather than continuing the previous trace. Remove two first, leaving one and therefore five free spaces. All four arrivals now fit, giving a final content of five with no rejection. The intermediate states are three, one and five. The conservation check is three plus four minus two equals five. Both sequences respect capacity six and remove two counters, yet their final states differ because one sequence accepted an additional arrival. No counter was created by reordering; the admission rule treated the same arriving batch differently.

Two conservation checks in the Simuvera event-order worksheetArrivals first: 3 + 3 − 2 = 4Removals first: 3 + 4 − 2 = 5Initial + accepted − removed = finalRejected counters never enter a queueOrdering changes admission, not capacity

03

Preserve the event rules in a reusable trace sheet

The trace template records capacity, initial content, ordered events, requested quantities, accepted arrivals, rejected arrivals, actual removals and state after each event. Include the conservation check and verify that every recorded state lies between zero and capacity. State whether rejected arrivals leave permanently or enter a queue; changing that rule creates a different model. For simultaneous events, choose an explicit tie-breaking order before calculating. The worksheet makes that choice visible so a collaborator can reproduce the result and identify which assumption caused the difference between scenarios.

simuvera.com

Explore Simuvera

Held for potential development. Acquisition inquiries may be considered.

Acquisition ↗