Z Language |
General |
The algorithms are expressed in an algorithmic
language (the Z language).
Algorithms operate on abstract machines.
An algorithm = { parallel modules }
Static objects are declared in the main module.
Communication between modules is done through parameters and global variables.
Z allows the writing of structured algorithms, i.e. algorithms expressed with the following control structures:
IF condition {statements} ELSE {statements} ENDIF,
WHILE condition {statements} ENDWHILE,
FOR v=exp1, exp2, exp3 {statements} ENDFOR
Z provides high-level operations for filling or
initializing abstract machines.
Z accepts recursive modules.
Z provide some usual functions : MOD, MAX, MIN, ...
Z allows compound types like stack of stacks of lists of ...