12. A computer system, comprising one or more processors and a memory, operatively interconnected to one another and configured to implement steps for analyzing a control-flow in a business process, comprising: invoking a representation of the business process as an acyclic workflow graph containing a plurality of types of nodes and edges linking nodes of the graph; labeling edges of the graph such that a label assigned to a first edge comprises a plurality of edge identifiers identifying respective edges, each of the edges identified being an outgoing edge of a split node in the graph, whereby executing any one of the identified edges ensures that the first edge will be executed; and checking the labels for a deadlock using a processor, while labeling the edges of the graph, wherein a deadlock is found if a condition for relaxed soundness is true.
12. A computer system, comprising one or more processors and a memory, operatively interconnected to one another and configured to implement steps for analyzing a control-flow in a business process, comprising: invoking a representation of the business process as an acyclic workflow graph containing a plurality of types of nodes and edges linking nodes of the graph; labeling edges of the graph such that a label assigned to a first edge comprises a plurality of edge identifiers identifying respective edges, each of the edges identified being an outgoing edge of a split node in the graph, whereby executing any one of the identified edges ensures that the first edge will be executed; and checking the labels for a deadlock using a processor, while labeling the edges of the graph, wherein a deadlock is found if a condition for relaxed soundness is true. 13. The computer system of claim 12 , wherein the graph has a unique source edge with a predefined label comprising a unique edge identifier identifying the source edge, and wherein labeling is initiated from the source edge.