TY - GEN
A1 - Mann, Zoltán Ádám
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - Workflow graphs, consisting of actions, events, and logical switches, are used to model business processes. In order to easily identify the actions within a workflow graph, it is useful to number them in such a way that the numbering reflects the structure of the workflow. However, available tools offer only rudimental numbering schemes. In the paper, a set of natural requirements is defined that a logical numbering should fulfill. It is investigated under what conditions there is an appropriate numbering at all, when it is uniquely defined by the set of requirements, and when it can be computed efficiently.
N2 - 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.
L1 - http://zbc.uz.zgora.pl/Content/46876/AMCS_2010_20_3_14.pdf
L2 - http://zbc.uz.zgora.pl/Content/46876
KW - workflow graph
KW - flowchart
KW - event-driven process chain
KW - numbering
KW - depth-first search
T1 - Numbering action vertices in workflow graphs
UR - http://zbc.uz.zgora.pl/dlibra/docmetadata?id=46876
ER -