| 5 | | Assuming the V-nodes are ordered lexicographically, we just iterate over them, and for each of the ones that correspond to states or derivatives, we check if there is more than one arc connecting to an equation node that has no other arcs. In that case, it is very likely that those equation nodes correspond to redundant initial equations, and we can symbolically check if they are consistent or not. |
| | 5 | Assuming the V-nodes are ordered lexicographically, we just iterate over them, and for each of the ones that correspond to states or derivatives, we check if there is more than one arc connecting to an E-node that has no other arcs. In that case, it is very likely that those equation nodes correspond to redundant initial equations, and we can symbolically check if they are consistent or not, possibly deferring the check to runtime in case the result depends on parameters, as we already do. |
