Class Solver_mam_ispn

java.lang.Object
jline.solvers.mam.analyzers.Solver_mam_ispn

public final class Solver_mam_ispn extends Object
The 'ispn' method of SolverMAM: steady state of a stochastic Petri net with exactly one unbounded place, solved as a quasi-birth-death process by the matrix-geometric method (Haverkort 1998, ch. 17; Spn_ispn).

The net is flattened to (place, class) levels, place-major, so level pp*R+k is class k in place pp. An open class arriving from a Source to a Place becomes a timed transition with no input place, firing at the arrival rate times the routing probability; tokens a mode sends to a Sink are dropped. The unbounded level is options.config.ispn_place when set (a place name, or "place.class" in a multiclass net), and otherwise the one level no non-negative S-invariant covers.

The measures follow SolverCTMC on a Petri net: QN is the mean number of tokens in the place, UN = QN, TN the token rate out of the place (the sum over the modes of their firing rate times the input multiplicity) and RN = QN / TN. The Source row carries the arrival rate.

MATLAB twin: solver_mam_ispn.m. Python twin: api/solvers/mam/ispn.py.