Package jline.api.mdd

Class MddMcdResult

java.lang.Object
jline.api.mdd.MddMcdResult

public class MddMcdResult extends Object
Result of the Miner-Ciardo-Donatelli level aggregation.
  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    int
    Fixed-point iterations performed.
    int[]
    |M_k| per paper level.
    int[][][]
    Mrows[k][r] = {node id, local value} of row r of M_k.
    boolean
    True certifies the result is EXACT with no reference solve needed; false means "not certified by this test", never "approximate" -- a product-form model is exact however much its diagram shares.
    double[]
    max |A(p)| per paper level: the largest number of distinct root-to-node paths at that level.
    double[][]
    pik[k] is the level-k stationary vector over M_k, in paper orientation.
    double[]
    Mean occupancy per station (or place), in station order.
    double[]
    Per-station utilization; null when the descriptor carries no queueing parameters.
    double[]
    Per-station throughput; null when the descriptor carries no queueing parameters.
  • Constructor Summary

    Constructors
    Constructor
    Description
     
  • Method Summary

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Field Details

    • QLen

      public double[] QLen
      Mean occupancy per station (or place), in station order.
    • X

      public double[] X
      Per-station throughput; null when the descriptor carries no queueing parameters.
    • U

      public double[] U
      Per-station utilization; null when the descriptor carries no queueing parameters.
    • pik

      public double[][] pik
      pik[k] is the level-k stationary vector over M_k, in paper orientation.
    • Mrows

      public int[][][] Mrows
      Mrows[k][r] = {node id, local value} of row r of M_k.
    • levelSizes

      public int[] levelSizes
      |M_k| per paper level.
    • iters

      public int iters
      Fixed-point iterations performed.
    • pathsPerLevel

      public double[] pathsPerLevel
      max |A(p)| per paper level: the largest number of distinct root-to-node paths at that level. 1 means no node there is shared, so conditioning on the node equals conditioning on the whole path above it.
    • noAggregation

      public boolean noAggregation
      True certifies the result is EXACT with no reference solve needed; false means "not certified by this test", never "approximate" -- a product-form model is exact however much its diagram shares.
  • Constructor Details

    • MddMcdResult

      public MddMcdResult()