Transition selection algorithm

The set of transitions to fire satisfies the following conditions:

This definition of the selection set is not imperative, but implementing a selection algorithm is done by a straightforward traversal of the active state configuration.

Active states are traversed bottom-up where transitions related to each are evaluated. This traversal guarantees that the priority principle is not violated. The only issue is resolving transition conflicts across orthogonal states. This issue is solved by "locking" each And state once a transition is fired inside one of its components. The bottom-up traversal and the And state locking together guarantee a proper selection set.


Feedback