-
Committer:
Jiri Srba
-
Date:
2017-12-14 08:59:40 UTC
-
mfrom:
(190.2.25 conjunction)
-
Revision ID:
srba.jiri@gmail.com-20171214085940-7s5l2d3ow5jc7e7h
merged in branch lp:~verifypn-stub/verifypn/conjunction
- Compiles inequalities into a convex constraint-system when possible.
- Unfolds fire-ability propositions on-the-fly instead of up front.
- Removes occurrences of same variable of each side of an equality over commutative arithmetic operators (eg a+b+c<=a can be rewritten b+c<=0).
- Compiles id-expressions and constants directly into an array of a commutative arithmetic expression rather than as child-objects.
- Constructs lazy linear programs into a (balanced) tree instead of a linear walk through (fixes issue with stack-overflow).