Decomposition of business process models into reusable sub-diagrams

Wiśniewski, Piotr

doi:10.1051/itmconf/20171501002

Cited by 12 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Selain itu, penelitian lain yang dilakukan oleh Effendi menggunakan metode top-to-down proses mining berdasarkan perbaikan petri nets dari multi-source event log [5]. Selanjutnya ada juga penelitian yang dilakukan oleh Piotr [6]…”

Section: Pendahuluanunclassified

“…Perlu diketahui, mengingat RPST apapun, k-decomposition selalu ada, yaitu, dalam kasus terburuk, dekomposisi yang dibentuk oleh semua daun RPST akan memenuhi definisi tersebut. Algoritma yang diusulkan memiliki kompleksitas linear sehubungan dengan ukuran RPST, dan penghentian dijamin oleh fakta bahwa ukuran komponen berkurang di setiap iterasi[10].Setelah didapatkan dekomposisi untuk setiap model proses, dilakukan pengukuran kompleksitas menggunakan formula Yaqin Complexity[6] pada (1Kami menggunakanFig. 4 (c)sebagai contoh aplikasi metode RPST yang disajikan padaFig.…”

unclassified

See 1 more Smart Citation

Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas

Safitri

Yaqin

Utomo

2020

J-TIT

View full text Add to dashboard Cite

Abstract— In an organization, some problems often arise, one of which lies in the complexity of business process modeling. In business processes, high complexity values are complicated to analyze and maintain as a whole, so a method is needed to break down the business process into smaller parts called the fragment process model. Therefore, a decomposition was carried out to decompose the process model to make it simpler. The benefit of decomposition is to make it easier for users to compose the required business process model. We used three different scenarios for the TMA process model to analyze each fragment. There is a process model with scenarios that tend to be the sequence, multi-branching, and nested branching. Furthermore, to support the results of the RPST, the calculation of the average complexity value with the Yaqin Complexity formula, and the standard deviation for the process model fragment was also carried out. Our experimental results found that the rate of the tree at the RPST affected the number of fragments. Also, we found that the more profound the tree depth, the higher the average complexity value. In this study, we found that scenarios that tend to be sequential, have the lowest average complexity value with the number 22, and a standard deviation value of 5,567. While the highest value is in the scenario that has nested branching, and there is a repetition process with an average complexity value of 29.8 and a standard deviation value of 13.405. Keywords— Process Model, RPST, Decomposition, Complexity Matrix, Standard Deviation. Abstrak— Dalam suatu organisasi seringkali timbul beberapa permasalahan, salah satunya terletak pada kompleksitas pemodelan proses bisnis. Dalam proses bisnis, nilai kompleksitas yang tinggi rumit untuk dianalisis dan dipelihara secara keseluruhan, sehingga diperlukan metode untuk memecah proses bisnis menjadi bagian-bagian yang lebih kecil yang disebut model proses fragmen. Oleh karena itu, dekomposisi dilakukan untuk menguraikan model proses agar lebih sederhana. Manfaat dekomposisi adalah memudahkan pengguna untuk menyusun model proses bisnis yang dibutuhkan. Kami menggunakan tiga skenario berbeda untuk model proses TMA untuk menganalisis setiap fragmen. Terdapat model proses dengan skenario yang cenderung berurutan, bercabang banyak, dan bercabang bersarang. Selanjutnya untuk mendukung hasil RPST juga dilakukan perhitungan nilai kompleksitas rata-rata dengan rumus Yaqin Complexity, dan standar deviasi untuk fragmen model proses. Hasil eksperimental kami menemukan bahwa laju pohon di RPST memengaruhi jumlah fragmen. Selain itu, kami menemukan bahwa semakin mendalam kedalaman pohon, semakin tinggi nilai kompleksitas rata-ratanya. Pada penelitian ini ditemukan skenario yang cenderung berurutan, memiliki nilai rata-rata kompleksitas terendah dengan angka 22, dan nilai standar deviasi 5,567. Sedangkan nilai tertinggi ada pada skenario bercabang nested, dan terjadi proses pengulangan dengan nilai kompleksitas rata-rata 29,8 dan nilai standar deviasi 13,405. Keywords—Model Proses, RPST, Dekomposisi, Matrik Kompleksitas, Standar Deviasi.

show abstract

Section: Pendahuluanunclassified

unclassified

Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas

Safitri

Yaqin

Utomo

2020

J-TIT

View full text Add to dashboard Cite

show abstract

“…Definition 1. (Sufficiently complete workflow log) Let G P be a business process graph [28] representing the analyzed process and S C be a set of all simple cycles in G P . Function C C (τ ) determines the number of occurrences of the vertex representing activity τ in S C .…”

Section: Workflow Logmentioning

confidence: 99%

Generation of Synthetic Business Process Traces using Constraint Programming

Wiśniewski

Kluza

Ligęza

et al. 2018

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Juxtapositioning manually created business process models with diagrams generated using process discovery algorithms exposes high complexity of the latter. As a consequence, their formal verification requires significant computational resources due to a large state space. Nevertheless, an analysis of the generated model is needed to assure its correctness and the ability to represent source data. As a solution to this problem, we present an approach for constraint-based generation of a complete workflow log for a given BPMN model. In this paper, we propose a method to extract directed subgraphs representing token flows in the process together with a set of predefined constraints. Likewise, in the case of process simulation, these constraints ensure the correctness of the generated traces. Ultimately, the obtained results can be compared to the original workflow log used for process discovery in order to verify the obtained model.

show abstract

“…The proposed mechanism can also be potentially used for supporting the creation of reusable component BP models. In [12], a set of activities, including the execution of a decomposition algorithm, creates a component model repository that facilitates process redesign and improvement. The method uses complete BPMN diagrams as input, and the repository of reusable parts follows BP modeling guidelines to avoid typical anomalies, which is a common objective with the assessment mechanism put forward in this paper.…”

Section: Introductionmentioning

confidence: 99%

Eligibility of BPMN Models for Business Process Redesign

2019

View full text Add to dashboard Cite

Business process redesign (BPR) is an organizational initiative for achieving competitive multi-faceted advantages regarding business processes, in terms of cycle time, quality, cost, customer satisfaction and other critical performance metrics. In spite of the fact that BPR tools and methodologies are increasingly being adopted, process innovation efforts have proven ineffective in delivering the expected outcome. This paper investigates the eligibility of BPMN process models towards the application of redesign methods inspired by data-flow communities. In previous work, the transformation of a business process model to a directed acyclic graph (DAG) has yielded notable optimization results for determining average performance of process executions consisting of ad-hoc processes. Still, the utilization encountered drawbacks due to a lack of input specification, complexity assessment and normalization of the BPMN model and application to more generic business process cases. This paper presents an assessment mechanism that measures the eligibility of a BPMN model and its capability to be effectively transformed to a DAG and be further subjected to data-centric workflow optimization methods. The proposed mechanism evaluates the model type, complexity metrics, normalization and optimization capability of candidate process models, while at the same time allowing users to set their desired complexity thresholds. An indicative example is used to demonstrate the assessment phases and to illustrate the usability of the proposed mechanism towards the advancement and facilitation of the optimization phase. Finally, the authors review BPMN models from both an SOA-based business process design (BPD) repository and relevant literature and assess their eligibility.

show abstract

Decomposition of business process models into reusable sub-diagrams

Cited by 12 publications

References 20 publications

Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas

Dekomposisi Model Proses Bisnis Tebang Muat Angkut (TMA) Menggunakan Refined Process Structure Tree (RPST) dan Metrik Kompleksitas

Generation of Synthetic Business Process Traces using Constraint Programming

Eligibility of BPMN Models for Business Process Redesign

Contact Info

Product

Resources

About