|
Vol: 58(72) No: 2 / June 2013 Modeling Dynamic Behavior of Administrative Business Processes József Tick Department of Software Engineering, Óbuda University, John von Neumann Faculty of Informatics, Bécsi út 96/b., 1034 Budapest, Hungary, phone: (36-1) 666-5550, e-mail: tick@uni-obuda.hu, web: http://www.uni-obuda.hu/tick Andrea Tick Department of Methodology, Budapest Business School, College of International Management and Business Studies, Diósy L. u. 22-24., 1165 Budapest, Hungary, phone: (36-1) 467-7976, e-mail: tick.andrea@kkk.bgf.hu, web: http://www.bgf.hu Keywords: Business Process Modeling, Workflow, P-graph network, Dynamic Behavior, Activity Simulation Abstract In the course of modeling administrative type business processes one of the crucial objective is to meet the criteria namely to produce the relevant and adequate documents with the help of the necessary input documents and resources. A further important goal is, however, to examine the dynamic behavior of the constructed model and to reveal resource constraints and bottlenecks during the operation of the system. Parallel to several existing models, the p-graph-based workflow model as well as business process modeling have been introduced in our earlier papers. One of their big advantages is the systematic generation of the optimal model structure. This paper presents a possible extension, namely the extension capable of the examination of the dynamic behavior of this model. The model originally is represented by p-graph. The extended model includes a special descriptor linked to each element of the p-graph, which stores the features of the given element. We precisely define each single characteristic of the document descriptor, the activity descriptor and the resource descriptor and even their interpretation in the system. As an extension of the already used visual notation we introduce animation in operation, which is a useful supplement in system examination. Based on this, congestions and scarcity can be identified in the system. The rate of these features can be calculated and precisely determined during the simulation for the purpose of effective evaluation of the operation. For the precise execution of administrative tasks it is necessary to pair the input documents, furthermore, the relevant legal regulations must be taken into account. The operation of activities in the simulation of the dynamic behavior is separately discussed, whose algorithm is defined in this paper. This kind of extension of the so far used p-graph-based business process model can be beneficially applied in the course of the analysis of the dynamic behavior of a system. Based on these analyses our models can be further optimized. References [1] Z. Vámossy, D. Kladek, L. Fazekas, “Environment mapping with laser-based and other sensors,” University Graz (ed.) Robot Sensing, ROSE 2004. International Workshop, Graz, Austria, 2004, pp. 74-78. [2] Z. Vámossy, A. Molnár, “Obstacle Avoidance for a CLAWAR Machine,” 2nd International Symposium on Climbing and Walking Robots-CLAWAR, Portsmouth, England, 1999. London: Professional Engineering Publishing Limited, pp. 597-603. [3] S. Sergyán, L. Csink, “Consistency Check of Image Databases,” 2nd Romanian-Hungarian Joint Symposium on Applied Computational Intelligence SACI 2005, Timisoara, Romania, 2005, pp. 201-206. [4] S. Sergyán, L. Csink, “Automatic Parametrization of Region Finding Algorithms in Gray Images,” 4th International Symposium on Applied Computational Intelligence and Informatics SACI 2007, Timisoara, Romania, 2007, pp. 199-202. [5] L. Erdődi, “File compression with LZO algorithm using NVIDIA CUDA architecture,” 4th IEEE International Symposium on Logistics and Industrial Informatics LINDI 2012, Smolenice, Slovakia, 2012, pp. 251-254. [6] L. Erdődi, I. Bódi, “Numerical determination of the slip modulus of dowel-type timber joints,” Pollack Periodica: an International Journal for Engineering and Information Sciences, vol. 2, pp. 35-44, 2007. [7] Gy. Györök, “Function monitoring of human body by 3d a-sensor,” Buletinul Stiintific al Universitati Politehnica din Timisoara Romania, Seria Automatica si Calculatoare / Scientific Bulletin of the Politehnica University of Timisoara, Transactions on Automatic Control and Computer Science, vol. 51(65), no. 1, pp. 61-64, 2006. [8] Gy. Györök, M. Makó, J. Lakner, “Combinatorics at Electronic Circuit Realization,” Acta Polytechnica Hungarica, Journal of Applied Sciences, vol. 6, no. 1, pp. 151-160, 2009. [9] J. Tick, “Potential Application of P-Graph-Based Workflow in Logistics,” Aspects of Computational Intelligence: Theory and Applications: Revised and Selected Papers of the 15th IEEE International Conference on Intelligent Engineering Systems 2011 INES 2011. Heidelberg, London, New York: Springer-Verlag, 2012, pp. 293-303. [10] J. Tick, “Application of P-graph-based workflow for administrative process modeling,” 9th IEEE International Symposium on Applied Machine Intelligence and Informatics SAMI 2011, Smolenice, Slovakia, 2011, pp. 15-18. [11] J. Tick, Z. Kovács, “P-graph based workflow synthesis,” 12th International Conference on Intelligent Engineering Systems INES 2008, Miami, FL, USA, 2008, pp. 249-253. [12] J. Tick, “Visualisation and Simulation of P-graph based Workflow Systems,” 6th International Symposium on Applied Computational Intelligence and Informatics SACI 2011, Timisoara, Romania, 2011, pp. 231-234. [13] J. Tick, “Visualization and Simulation Tool for Analyzing P-Graph-based Workflow Systems,” Applied Computational Intelligence in Engineering and Information Technology: Revised and Selected Papers from the 6th IEEE International Symposium on Applied Computational Intelligence and Informatics SACI 2011. Berlin, Heidelberg: Springer-Verlag, 2012, pp. 71-82. [14] A. L. Bencsik, J. Gáti, Gy. Kártyás, “Maintenance of Complex Automated Systems,” 7th International Symposium on Applied Computational Intelligence and Informatics SACI 2012, Timisoara, Romania, 2012, pp. 223-227. [15] A. Mishra, D. Mishra, “A Legal Business Information System: Implementation Process Context,” Acta Polytechnica Hungarica, Journal of Applied Sciences, vol. 8, no 2, pp. 45-59, 2011. [16] S. Misra, “An Approach for the Empirical Validation of Software Complexity Measures,” Acta Polytechnica Hungarica, Journal of Applied Sciences, vol. 8, no 2, pp. 141-160, 2011. [17] F. Friedler, K. Tarjan, Y. W. Huang, L. T. Fan, “Combinatorial algorithms for process synthesis,” Computers Chem. Engng, vol. 16, pp. 313-320, 1992. [18] F. Friedler, K. Tarjan, Y. W. Huang, L. T. Fan, “Graph-theoretic approach to process synthesis: axioms and theorems,” Chem. Engng Sci., vol. 47, pp. 1973-1988, 1992. [19] F. Friedler, L. T. Fan, B. Imreh, “Process network synthesis: problem definition,” Networks, vol. 28, pp. 119-124, 1998. [20] J. Tick, “P-Graph-based workflow modeling,” Acta Politechnica Hungarica, Journal of Applied Sciences, vol. 4, no. 1, pp. 75-88, 2007. [21] J. Tick, “Fuzzy extension to P-graph based workflow models,” IEEE 7th International Conference on Computational Cybernetics ICCC 2009, Spain, 2009, pp. 109-112. [22] W. M. P. van der Aalst, “The Application of Petri Nets to Workflow Management,” The Journal of Circuits, Systems and Computers, vol. 8, no. 1, pp. 21-66, 1998. |