Affiliation(s)
Raimond Wüst, Ph.D., Zurich University of Applied Sciences (ZHAW), Institute for Data Analysis and Process Design (IDP), Rosenstr, 3, 8401 Winterthur, Switzerland.
Stephan Bütikofer, Ph.D., Zurich University of Applied Sciences (ZHAW), Institute for Data Analysis and Process Design (IDP), Rosenstr, 3, 8401 Winterthur, Switzerland.
Jürgen Spielberger, M.Sc., Zurich University of Applied Sciences (ZHAW), Institute for Applied Information Technology (InIT), Obere Kirchgasse 2/Steinberggasse 12/14, CH-8401 Winterthur, Switzerland.
Jörg Sigrist, M.Sc., AM-TEC Switzerland AG (AM-TEC), Bahnhofstrasse 18, CH-8197 Rafz, Switzerland.
ABSTRACT
A concept is introduced in this article which has strong practical impact for computer aided system configuration. System configuration is a cumbersome and fault sensitive task while setting up systems in a broad range of business applications like ERP (enterprise resource planning) and other workflow-systems. Given a generic process or workflow model in YAWL-notation (yet another workflow language) or any other process modeling language like business process model and notation or WFMC (workflow management coalition), it could be stated that, by using a set of reduction rules as introduced, it is possible to generate a hierarchically structured tree of sub graphs of the workflow graph-representation. According to the notation used, authors call these sub graphs facts. The tree structure of the graph-representation on one hand and the logical relation between the branches and leafs of the tree on the other can be utilized to create a set of constraints and dependencies among the single facts. Some researchers showed that the nested branches can be associated to (predefined) questions with respect to the configuration of a workflow management system, for instance an ERP-application. They presented an algorithm which dynamically sorts the questions and answers in a maximum efficient configuration path, while working through the corresponding questionnaire. By combining the different elements as facts, constraints on questions, and configuration space, it is thus possible to algorithmically generate the efficient structured and interactive questionnaire for the configuration of workflow systems and algorithmically check the consistency (dead lock free, free of synchronization structural conflict) of the underlying workflow model. The concept was tested in the prototype of the interactive questionnaire for configuration of the web-service based ERP-Application Posity.
KEYWORDS
workflow modeling, interactive questionnaire, algorithmic process analysis, workflow graph reduction, formal workflow consistence, ERP-system setup, system automation
Cite this paper
References
Grosskopf, A., Decker, G., & Weske, M. (2009). The process: Business process modelling using BPMN. Tampa: Meghan-Kiffer Press.
La Rosa, M., Van Der Aalst, W. M., Dumas, M., Ter Hofstede, A. H., & Gottschalk, F. (2006). Generating inter-active questionnaires from configuration models. Retrieved from http://eprints.qut.edu.au
Rosemann, M., & Van Der Aalst, W. M. P. (2007). A configurable reference modeling language. Information Systems, 32(1), 1-23.
Sadiq, W., & Orlowska, M. E. (2000). Analysing process models using graph reduction techniques. Proceedings from The 11th International Conference on Advanced Information System Engineering.
Spielberger, J., Bärtschi-Rusch, M., Mürner, M., Perellano, G., & Wüst, R. M. (2014). Rapid development of ICT business services by business engineers independent of computer scientists. Proceedings from Science-to-Business Marketing Conference. Retrieved from http://www.s2b-conference.com/
Van Der Aalst, W. M. P., & Ter Hofstede, A. H. M. (2005). YAWL: Yet another workflow language. Information Systems, 30, 245-275.
Van Der Aalst, W. M. P., Hirnschall, A., & Verbeek, H. M. W. (2002). An alternative way to analyze workflow graphs. In A. Banks-Pidduck, J. Mylopoulos, C. C. Woo, and M. T. Ozsu (Eds.), Proceedings from The 14th International Conference on Advanced Information Systems Engineering (CAiSE’02) (pp. 535-552). Berlin: Springer.
Verbeek, H. M. W., Van Der Aalst, W. M. P., & Ter Hofstede, A. H. M. (2005). Verifying workflows with cancellation regions and OR-joins: An approach based on relaxed soundness and invariants. Oxford: Oxford University Press.
XML 1410 Views