Abstract: An activity diagram can be converted into code, by traversing the activity diagram to identify the cycles in the activity diagram. Each identified cycle can be stored in a list of cycles. Intermixed cycles among the list of cycles can be resolved. When resolving, the identified cycles can be compared one to another to determine if they have common nodes. If so one of the cycles can be removed from the list of cycles. The other cycle can be labeled as a GOTO loop. The activity diagram can be traversed. For each traversed node, code statements can be generated based on the node type and the labels associated with the node.

Abstract: An activity diagram can be converted into code, by traversing the activity diagram to identify the cycles in the activity diagram. Each identified cycle can be stored in a list of cycles. Intermixed cycles among the list of cycles can be resolved. When resolving, the identified cycles can be compared one to another to determine if they have common nodes. If so one of the cycles can be removed from the list of cycles. The other cycle can be labeled as a GOTO loop. The activity diagram can be traversed. For each traversed node, code statements can be generated based on the node type and the labels associated with the node.