📄️ CheckType
todo: document
📄️ ConvAdditionByAConstant
$(f \otimes g) + K = (f \otimes (g + K))$.
📄️ ConvAndSubadditiveClosure
$(g \oslash \overline) \otimes \overline{f} = g \oslash \overline{f}$.
📄️ ConvSubAdditiveAsSelfConvMinimum
If $f$ and $g$ are subadditive and 0 at 0, then $f \otimes g = (f \wedge g) \otimes (f \wedge g)$.
📄️ ConvolutionDistributivityMin
$f \otimes (g \wedge h) = (f \otimes g) \wedge (f \otimes h)$.
📄️ ConvolutionSubAdditiveWithDominance
If $f$ is subadditive, $g(0) = 0$, and $f(t) \le g(t) \forall~t$, then $f \otimes g = f$
📄️ ConvolutionWithConcaveFunctions
If $f$ and $g$ are concave and 0 at 0, then $f \otimes g = f \wedge g$.
📄️ DeconvAndSubAdditiveClosure
$(g \otimes \overline) \oslash \overline{f} = g \otimes \overline{f}$.
📄️ DeconvDistributivityWithMax
$(f \vee g) \oslash h = (f \oslash h) \vee (g \oslash h)$.
📄️ DeconvDistributivityWithMin
$f \oslash (g \wedge h) = (f \oslash g) \vee (f \oslash h)$.
📄️ DeconvolutionWeakCommutativity
$(f \oslash h) \oslash g = (f \oslash g) \oslash h$.
📄️ DeconvolutionWithConvolution
$f \oslash (g \otimes h) = (f \oslash h) \oslash g$.
📄️ Equivalence
The class allows to define equivalences involving NetCal expressions
📄️ EquivalenceApplyResult
todo: document
📄️ EquivalenceGrammarVisitor
Visitor class which translates a textual equivalence, written using the new grammar defined in the library, to a
📄️ IsomorphismConvLeft
The upper pseudoinverse of a (min,+) convolution of two non-decreasing left-continuous function is equal
📄️ IsomorphismConvRight
The lower pseudoinverse of a (max,+) convolution of two non-decreasing right-continuous function is equal
📄️ OneTimeEquivalenceApplier
Class which allows to apply an equivalence to an expression.
📄️ PseudoInversesOfLeftContinuous
If $f$ is non-decreasing and left-continuous, the lower pseudoinverse of its upper pseudoinverse is equal to $f$ again.
📄️ PseudoInversesOfRightContinuous
If $f$ is non-decreasing and right-continuous, the upper pseudoinverse of its lower pseudoinverse is equal to $f$ again.
📄️ SelfConvolutionSubAdditive
If $f$ is subadditive and $f(0) = 0$, its self-deconvolution is equal to $f$ itself, i.e. $f \oslash f = f$.
📄️ SelfDeconvolutionSubAdditive
If $f$ is subadditive and $f(0) = 0$, its self-deconvolution is equal to $f$ itself, i.e. $f \oslash f = f$.
📄️ SubAdditiveClosureOfMin
The subadditive clusore of the minimum of two function is equal to the convolution between their subadditive closures, i.e., $\overline{f \wedge g} = \overline \otimes \overline{g}$.
📄️ SubAdditiveClosureOfSubAdd
If $f$ is subadditive and $f(0) = 0$, its subadditive closure is equal to $f$ itself, i.e. $\overline = f$.