The invention belongs to the technical field of interface arrangement
process design, and particularly relates to a
branch merging method of an interface arrangement process. Compared with a traditional method which needs to manually specify
branch merging nodes and the number of messages received by the
branch merging nodes, the method has the advantages that the branch nodes and the merging nodes in the process can be automatically identified, and the corresponding branch merging logic is automatically generated according to the node types. Therefore, the
workload of designers is reduced, and problems caused by human errors are also reduced. The ring structure is automatically identified through a
topological sorting algorithm, and the ring structure is converted into the acyclic graph by adopting a specific strategy, so that the problem of infinite execution caused by circulation in a branch merging process is avoided, and the complexity of a subsequent branch merging
algorithm is reduced. According to the method, the process is more robust, and the reliability of process execution is improved. And
backtracking an upstream path by using a public ancestor
algorithm, and finding out a first public
branch node for path merging. In this way, the accuracy of the merging operation is ensured, and logic errors caused by inaccurate merging point selection are avoided.