Introduced reentrant algorithms. They are denoted by 0 cardinality

In case an algorithm has 0 cardinality, it is now considered by the framework as reentrant. As such, the same instance of the algorithm will be reused as often as needed.