Szukana fraza: [Abstract = "It is shown that for an important special class of workflow graphs, namely, structured workflow graphs, the answer to all these questions is affirmative. For general workflow graphs, a set of requirements is presented that can always be fulfilled, but the numbering is not necessarily unique. An algorithm based on a depth\-first search can be used to compute an appropriate numbering efficiently."]

Wyników: 1