Suppose that there are n parallel activities, i.e., all n activities need to be executed but any order is allowed. There are n! possible execution sequences. The transition system requires 2^n states and n×2^(n-1) transitions. I do not understand how n×2^(n-1) transitions are obtained.
Any hint please.
