The application demonstrates the forward execution of long-running transactions and the recovery execution
that happens to recover all processed nodes done during the forward execution when an error occurs.
This application takes as input the transaction tree.
The transaction tree itself contains the required information on how the multiple services can be invoked in the
There are three ways to do this. Services can be invoked sequentially meaning one after the other, alternatively,
one or the other and in parallel all at the same time. To execute the transaction the tree is converted into a
different form. This form is none other than the vector format.The vector format does some mathematical
calculations to extract the service invocations into vectors that are
ordered and executed one by one.