ProB requires all deferred sets to be given a finite cardinality. If no cardinality is specified a default size will be used. Also, mathematical integers will only be enumerated within MININT to MAXINT.
Other general limitations are:
- closure The transitive and reflexive closure operator is not supported as defined in the B-Book by Abrial. AtelierB also does not support the operator as defined in the B-Book (as this version cannot be applied in practice). For the reflexive component of closure, ProB will compute the elements in the domain and range of the relation.
Note, however, that the transitive closure operator closure1 is fully supported, and hence one can translate an expression closure(e), where e is a binary relation over some domain d, into the expression closure1(e) \/ id(d).
- fnc, rel These operators are not supported. Also, succ and pred are only supported when applied to numbers (i.e., succ(x) is supported; dom(succ) is not).
- Trees and binary trees. These onstructs are specific to AtelierB tool and are not supported (the STRING type is now supported);
- Definitions Definitions (from the DEFINITIONS clause) with arguments are now supported, but in contrast to AtelierB they are type-checked and have to be either and expression, a predicate or a substitution;
- There are also limitations wrt refinements. See below;
- VALUES This clause of IMPLEMENTATION machines is not yet supported;