Package jline.solvers.fluid.petri

Class PetriConstraints

java.lang.Object
jline.solvers.fluid.petri.PetriConstraints
public final class PetriConstraints extends Object
Every finite place capacity as a linear row A x <= b.

THE GATE IS A LOSS ON THE DEPOSIT: LINE loses the tokens a firing would push past a place's capacity, so the fluid analogue scales the DEPOSIT leg of every event adding mass to the capped place and leaves the removal leg alone. The rows here name which coordinates are capped; the scaling itself lives in the tangent clamp.

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    Matrix
    A
    (nrows x nstate) capacity rows.
    double[]
    b
    The bound of each row.
    boolean[][]
    cover
    cover[r][s] is true where row r caps coordinate s.
    boolean[]
    fluid
    True for a bound of a fluid place.
    List<String>
    label
    One human-readable statement per row, for the report.
    boolean[]
    lower
    True for the EMPTY-level row -f <= 0 of a fluid place, whose multiplier gates the withdrawals (flows out of it and negative impulses) rather than the deposits.

  • Method Summary

    Modifier and Type
    Method
    Description
    static PetriConstraints
    constraints(NetworkStruct sn, PetriTerms t)
    Build the capacity rows of a term set.

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Field Details

    • A

      public Matrix A
      (nrows x nstate) capacity rows.

    • b

      public double[] b
      The bound of each row.

    • label

      public List<String> label
      One human-readable statement per row, for the report.

    • cover

      public boolean[][] cover
      cover[r][s] is true where row r caps coordinate s.

    • lower

      public boolean[] lower
      True for the EMPTY-level row -f <= 0 of a fluid place, whose multiplier gates the withdrawals (flows out of it and negative impulses) rather than the deposits. A token drain slows with the marking through min(), so a token place empties asymptotically; a fluid drain runs at its full rate down to zero, so the lower bound needs a row of its own.

    • fluid

      public boolean[] fluid
      True for a bound of a fluid place.

  • Method Details

    • constraints

      public static PetriConstraints constraints(NetworkStruct sn, PetriTerms t)
      Build the capacity rows of a term set.
      Parameters:
      sn - the network the places belong to
      t - the assembled terms
      Returns:
      the rows and their bounds