Blocking
A single-server station with a finite buffer that uses block-after-service semantics: when the server completes an instance but the downstream receiver cannot accept it, the server is blocked — it holds the finished instance and does not start the next one until the downstream frees a slot. A chain of blocking stations models a production line with limited buffers and back-pressure.
The finite buffer (bufferCapacity, the maximum number waiting + in service + blocked) is enforced via canReceive for blocking upstreams; a non-blocking upstream (such as a source) is expected not to exceed it.
Parameters
the model element serving as this station's parent
the maximum number of instances the station may hold (>= 1)
the service-time distribution
where processed instances are pushed
the name of the station
Constructors
Properties
Time-weighted 0/1 indicator that the server is blocked (finished but cannot push downstream).
True if this node has any onward routing configured (a static next receiver, a station-level sender, or a class route). A non-terminal node for which this is false — and which is not a non-terminal step of a registered route — is a dangling node and fails validation.
Time-weighted number of instances in the station (waiting, in service, or blocked).
The number of instances processed (pushed downstream).
Time in the station per processed instance (includes any blocking delay).
The waiting queue (read-only).
Functions
Registers a listener invoked when a slot frees (so a blocked upstream can push).
True if the receiver currently has room for another instance.
This method should be overridden by subclasses that need actions performed to initialize prior to a replication. It is called once before each replication occurs if the model element wants initialization. It is called after beforeReplication() is called
Sets the downstream receiver, registering for its space-available events if blockable.
The statically known receivers this node may route to. Best-effort: empty when the node has no static link or when its routing is opaque (for example, a probabilistic sender whose destinations are not introspectable).