Whereas equations are very well suited for physical modeling, there are situations where computations are more conveniently expressed as algorithms, i.e., sequences of statements. In this chapter we describe the algorithmic constructs that are available in Modelica.
Statements are imperative constructs allowed in algorithm sections.
An algorithm section is comprised of the keyword algorithm followed by a sequence of statements. The formal syntax is as follows:
Equation equality = or any other kind of equation (see chapter 8) shall not be used in an algorithm section.
See section 8.6 for a description of both initial algorithm sections and initial equation sections.
An algorithm section is conceptually a code fragment that remains together and the statements of an algorithm section are executed in the order of appearance. Whenever an algorithm section is invoked, all variables appearing on the left hand side of the assignment operator := are initialized (at least conceptually):
A non-discrete variable is initialized with its start value (i.e. the value of the start-attribute).
A discrete variable v is initialized with pre(v).
If at least one element of an array appears on the left hand side of the assignment operator, then the complete array is initialized in this algorithm section.
[Initialization is performed, in order that an algorithm section cannot introduce a “memory” (except in the case of discrete states which are explicitly given), which could invalidate the assumptions of a numerical integration algorithm. Note, a Modelica tool may change the evaluation of an algorithm section, provided the result is identical to the case, as if the above conceptual processing is performed.
An algorithm section is treated as an atomic vector-equation, which is sorted together with all other equations. For the sorting process (BLT), every algorithm section with N different left-hand side variables, is treated as an atomic N-dimensional vector-equation containing all variables appearing in the algorithm section. This guarantees that all N equations end up in an algebraic loop and the statements of the algorithm section remain together.
See section 12.4.4 Initialization and Binding Equations of Components in Functions.
Statements are imperative constructs allowed in algorithm sections. A flattened statement is identical to the corresponding nonflattened statement.
Names in statements are found as follows:
If the name occurs inside an expression: it is first found among the lexically enclosing reduction functions (see section 10.3.4) in order starting from the inner-most, and if not found it proceeds as if it were outside an expression:
Names in a statement are first found among the lexically enclosing for-statements in order starting from the inner-most, and if not found:
Names in a statement shall be found by looking up in the partially flattened enclosing class of the algorithm section.
The syntax of statements is as follows:
The syntax of simple assignment statement is as follows:
The expression is evaluated. The resulting value is stored into the variable denoted by component-reference.
There is a special form of assignment statement that is used only when the right-hand side contains a call to a function with multiple results. The left-hand side contains a parenthesized, comma-separated list of variables receiving the results from the function call. A function with n results needs m<=n receiving variables on the left-hand side, and the variables are assigned from left to right.
It is possible to omit receiving variables from this list:
[Example: The function f called below has three results and two inputs:
In the second example above x is assigned twice – first with the first output and then with the third output. For that case the following will give the same result:
The syntax of an assignment statement with a call to a function with multiple results is as follows:
[Also see section 8.3.1 regarding calling functions with multiple results within equations.]
Only components of the restricted classes type, record, operator record, and connector may appear as left-hand-side in algorithms. This applies both to simple assignment statements, and the parenthesized, comma-separated list of variables for functions with multiple results.
The syntax of a for-statement is as follows:
For-statements may optionally use several iterators (for-indices), see section 18.104.22.168 for more information:
The following is an example of a prefix of a for-statement:
The rules for for-statements are the same as for for-expressions in section 22.214.171.124 - except that the expression of a for-statement is not restricted to a parameter-expression.
The loop-variable may hide other variables as in the following example. Using another name for the loop-variable is, however, strongly recommended.
An iterator IDENT in range-expr without the in range-expr requires that the IDENT appears as the subscript of one or several subscripted expressions. The dimension size of the array expression in the indexed position is used to deduce the range-expr as 1:size(array-expression,indexpos) if the indices are a subtype of Integer, or as E.e1:E.en if the indices are of an enumeration type E=enumeration(e1, ..., en), or as false:true if the indices are of type Boolean. If it is used to subscript several expressions, their ranges must be identical. The IDENT may also, inside a reduction-expression, array constructor expression, for-statement, or for-equation, occur freely outside of subscript positions, but only as a reference to the variable IDENT, and not for deducing ranges.
The size of an array – the iteration range is evaluated on entry to the for-loop and the array size may not change during the execution of the for-loop.
The iteration range can be specified as Boolean or as an enumeration type. This means iteration over the type from min to max, i.e. for Boolean it is the same as false:true and for an enumeration E it is the same as E.min:E.max. This can be used for for loops and reduction expressions.
The notation with several iterators is a shorthand notation for nested for-statements or for-equations (or reduction-expressions). For for-statements or for-equations it can be expanded into the usual form by replacing each ‘,’ by “loop for” and adding extra “end for”. For reduction-expressions it can be expanded into the usual form by replacing each ‘,’ by “) for” and prepending the reduction-expression with “functionName(”.
The while-statement has the following syntax:
The expression of a while-statement shall be a scalar Boolean expression. The while-statement corresponds to while-statements in programming languages, and is formally defined as follows:
The expression of the while-statement is evaluated.
If the expression of the while-statement is false, the execution continues after the while-statement.
The break-statement breaks the execution of the innermost while or for-loop enclosing the break-statement and continues execution after the while- or for-loop. It can only be used in a while- or for-loop in an algorithm section. It has the following syntax:
[Example: (Note that this could alternatively use return).
Can only be used inside functions, see section 12.1.2.
If-statements have the following syntax:
The expression of an if- or elseif-clause must be scalar Boolean expression. One if-clause, and zero or more elseif-clauses, and an optional else-clause together form a list of branches. One or zero of the bodies of these if-, elseif- and else-clauses is selected, by evaluating the conditions of the if- and elseif-clauses sequentially until a condition that evaluates to true is found. If none of the conditions evaluate to true the body of the else-clause is selected (if an else-clause exists, otherwise no body is selected). In an algorithm section, the selected body is then executed. The bodies that are not selected have no effect on that model evaluation.
A when-statement has the following syntax:
The expression of a when-statement shall be a discrete-time Boolean scalar or vector expression. The algorithmic statements within a when-statement are activated when the scalar or any one of the elements of the vector-expression becomes true.
[Example: Algorithms are activated when x becomes > 2:
The statements inside the when-statement are activated on the positive edge of any of the expressions x > 2, sample(0, 2), or x < 5:
For when-statements in algorithm sections the order is significant and it is advisable to have only one assignment within the when-statement and instead use several algorithm sections having when-statements with identical conditions, e.g.:
Merging the when-statements can lead to less efficient code and different models with different behavior depending on the order of the assignment to y1 and y3 in the algorithm.]
A when-statement shall not be used within a function.
When-statements may not occur inside initial algorithms.
When-statements cannot be nested.
When-statements may not occur inside while, if, and for-clauses in algorithms.
[Example: The following nested when-statement is invalid:
is similar to the following special if-statement, where Boolean b1[N]; and Boolean b2; are necessary because the edge() operator can only be applied to variables
with edge(A)= A and not pre(A) and the additional guarantee, that the statements within this special if-statement are only evaluated at event instants. The difference compared to the when-statements is that e.g. pre may only be used on continuous-time real variables inside the body of a when-clause and not inside these if-statements.
These special statements have the same form and semantics as the corresponding equations, apart from the general difference in semantics between equations and statements.
See section 8.3.7. A failed assert stops the execution of the current algorithm.
See section 8.3.8. The terminate statement may not be in functions; In an algorithm outside a function it does not stop the execution of the current algorithm.