PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2010 | 20 | 3 | 591-600
Tytuł artykułu

Numbering action vertices in workflow graphs

Treść / Zawartość
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
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. 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.
Rocznik
Tom
20
Numer
3
Strony
591-600
Opis fizyczny
Daty
wydano
2010
otrzymano
2009-11-10
poprawiono
2010-04-24
Twórcy
  • Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Magyar tudósok körútja 2., 1117 Budapest, Hungary
  • AAM Management Information Consulting Ltd., Váci út 76., 1133 Budapest, Hungary
Bibliografia
  • Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C. (2001). Introduction to Algorithms, MIT Press, Cambridge, MA.
  • Kiepuszewski, B., ter Hofstede, A. and van der Aalst, W. (2003). Fundamentals of control flow in workflows, Acta Informatica 39(3): 143-209.
  • Microsoft Corporation (2010). Microsoft Office Visio: Number the shapes in a flowchart, http://office.microsoft.com/en-us/visio/HP866500731033.aspx.
  • RFF Electronics (2004). RFFlow user's guide, http://www.rff.com.
  • Scheer, A.-W. (2000). ARIS-Business Process Modeling, Springer, Berlin.
  • Scheer, A.-W., Thomas, O. and Adam, O. (2005). Process modeling using event-driven process chains, in M. Dumas, W.M.P. van der Aalst and A.H.M. ter Hofstede (Eds.), Process-Aware Information Systems, John Wiley & Sons, Hoboken, NJ, pp. 119-145.
  • van der Aalst, W.M.P. (1999). Formalization and verification of event-driven process chains, Information and Software Technology 41(10): 639-650.
  • Vanhatalo, J., Völzer, H. and Koehler, J. (2009). The refined process structure tree, Data & Knowledge Engineering 68(9): 793-818.
  • Weber, I., Hoffmann, J. and Mendling, J. (2008). Beyond soundness: On the semantic consistency of executable process models, Proceedings of the 6th European Conference on Web Services, Dublin, Ireland, pp. 102-111.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-amcv20i3p591bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.