Business process verification: a Petri Net approach.

In this report, we discuss the use of Petri Net language theory for business process modeling. Essentially, the focus is on the opportunities of the modeling technique for analysis and verification. Semantic compatibility, as opposed to syntactic compatibility, is concerned with the meaningfulness of the distributedbusiness process. We start with a description and motivation of different notions of semantically compatible business processes. Further, these different types ofcompatibility are formalized by means of Petri Net language theory. Finally, we describe the foundations of an algorithm that enables us to verify the semantic compatibility in an automated way.Keywords: Petri Net theory; Business Process Modeling; Verification; Semantic Com-patibilityBusiness process modeling; Petri Net theory; Semantic compatibility; Verification; Theory; Business; Processes; Process modeling; Opportunities;

Toward the automation of business process ontology generation

Semantic Business Process Management (SBPM) utilises semantic technologies (e.g., ontology) to model and query process representations. There are times in which such models must be reconstructed from existing textual documentation. In this scenario the automated generation of ontological models would be preferable, however current methods and technology are still not capable of automatically generating accurate semantic process models from textual descriptions. This research attempts to automate the process as much as possible by proposing a method that drives the transformation through the joint use of a foundational ontology and lexico-semantic analysis. The method is presented, demonstrated and evaluated. The original dataset represents 150 business activities related to the procurement processes of a case study company. As the evaluation shows, the proposed method can accurately map the linguistic patterns of the process descriptions to semantic patterns of the foundational ontology to a high level of accuracy, however further research is required in order to reduce the level of human intervention, expand the method so as to recognise further patterns of the foundational ontology and develop a tool to assist the business process modeller in the semi-automated generation of process models

Towards an ontology for process monitoring and mining

Business Process Analysis (BPA) aims at monitoring, diagnosing, simulating and mining enacted processes in order to support the analysis and enhancement of process models. An effective BPA solution must provide the means for analysing existing e-businesses at three levels of abstraction: the Business Level, the Process Level and the IT Level. BPA requires semantic information that spans these layers of abstraction and which should be easily retrieved from audit trails. To cater for this, we describe the Process Mining Ontology and the Events Ontology which aim to support the analysis of enacted processes at different levels of abstraction spanning from fine grain technical details to coarse grain aspects at the Business Level

Towards a pivotal-based approach for business process alignment.

This article focuses on business process engineering, especially on alignment between business analysis and implementation. Through a business process management approach, different transformations interfere with process models in order to make them executable. To keep the consistency of process model from business model to IT model, we propose a pivotal metamodel-centric methodology. It aims at keeping or giving all requisite structural and semantic data needed to perform such transformations without loss of information. Through this we can ensure the alignment between business and IT. This article describes the concept of pivotal metamodel and proposes a methodology using such an approach. In addition, we present an example and the resulting benefits

B-BabelNet: Business-Specific Lexical Database for Improving Semantic Analysis of Business Process Models

Similarity calculation between business process models has an important role in managing repository of business process model. One of its uses is to facilitate the searching process of models in the repository. Business process similarity is closely related to semantic string similarity. Semantic string similarity is usually performed by utilizing a lexical database such as WordNet to find the semantic meaning of the word. The activity name of the business process uses terms that specifically related to the business field. However, most of the terms in business domain are not available in WordNet. This case would decrease the semantic analysis quality of business process model. Therefore, this study would try to improve semantic analysis of business process model. We present a new lexical database called B-BabelNet. B-BabelNet is a lexical database built by using the same method in BabelNet. We attempt to map the Wikipedia page to WordNet database but only focus on the word related to the domain of business. Also, to enrich the vocabulary in the business domain, we also use terms in the business-specific online dictionary (businessdictionary.com). We utilize this database to do word sense disambiguation process on business process model activity’s terms. The result from this study shows that the database can increase the accuracy of the word sense disambiguation process especially in particular terms related to the business and industrial domains

Semantic enabled complex event language for business process monitoring

Efforts are being made to enable business process monitoring and analysis through processing continuously generated events. Several ontologies and tools have been defined and implemented to allow applying general-purpose Business Process Analysis techniques to specific domains. On this basis, a Semantic Enabled Monitoring Event Language (SEMEL) is proposed to facilitate defining complex queries over monitoring data so as to interleave temporal and ontological reasoning. In this paper, the formal semantics of SEMEL is discussed, and the implementation approach of SEMEL interpreter is also briefly described, which encompasses translation into an operational language

Ontology-based metrics computation for business process analysis

Business Process Management (BPM) aims to support the whole life-cycle necessary to deploy and maintain business processes in organisations. Crucial within the BPM lifecycle is the analysis of deployed processes. Analysing business processes requires computing metrics that can help determining the health of business activities and thus the whole enterprise. However, the degree of automation currently achieved cannot support the level of reactivity and adaptation demanded by businesses. In this paper we argue and show how the use of Semantic Web technologies can increase to an important extent the level of automation for analysing business processes. We present a domain-independent ontological framework for Business Process Analysis (BPA) with support for automatically computing metrics. In particular, we define a set of ontologies for specifying metrics. We describe a domain-independent metrics computation engine that can interpret and compute them. Finally we illustrate and evaluate our approach with a set of general purpose metrics

EXPLORING A DOMAIN ONTOLOGY BASED APPROACH TO BUSINESS PROCESS DESIGN

Business process modeling is a critical area of business application as business processes increase in complexity and become more automated. However, little attention has been paid to the fact that business process modelers often misunderstand domain concepts or relationships due to a lack of precise domain knowledge. This semantic ambiguity problem often affects the efficiency and quality of business process modeling. To address this problem, we propose a domain ontology based approach (DOBA) to supporting business process design by capturing domain semantics with a meta model of process ontologies. DOBA provides a means to capture rich, semantic information on complex business processes, which enables the incorporation of domain specific ontologies to facilitate modeling of business processes. The validity of DOBA is demonstrated via a business case in electronic auctions. The DOBA approach represents a first step towards developing a formal methodology for ontology-based modeling and analysis in business process management

MEASURING BUSINESS PROCESS SIMILARITY USING PROBABILISTIC LATENT SEMANTIC ANALYSIS (PLSA) AND GREEDY GRAPH MATCHING

AbstractThe business process is a set of activities and tasks performed to achieve the goals of an organization. The business process model can be reused as a business process management effort into a repository. To solve the problem, it is necessary to measure the business process model that has similarity or similarity in terms of activity or process. From several business process models that have similarity can be identified as the main business process model, which has the primary function of the same activity. Business process model matching is the one of technique that can be used to identify, to measure the similarity of a set of business process models. The graph matching approach fit to identify the similarity of processes or activities in the business process model. The technique of matching the graph with Greedy graph matching shows similar results with an 89% precision value based on measuring the similarity of the graph building structure. Another approach in graph matching is a semantically or a text-based. Probabilistic Latent Semantic Analysis (PLSA) is one of the semantic approaches to measure the similarity of text in documents. PLSA measures the linkage of words in the document to identify any similarity of topics in the document. Measuring PLSA in business process matching analysis is by comparing text labels on each node in the business process. This research measures the similarity of business process models by combining two similarity analysis techniques based on semantics using PLSA and structural with Greedy. A graph matching technique by computing the semantics of each label on activities that are related to other activity labels. Structurally, connected activities are related to the same process or the same function. The result of this research is to know the effectiveness of business process which has activity relation.Keywords : Business Process, BPMN, Graph Similarity, Probabilistic Latent Semantic Analysis (PLSA), Greedy Graph MatchingProses bisnis adalah serangkaian aktivitas dan tugas yang dilakukan untuk mencapai tujuan dari sebuah organisasi. Model proses bisnis dapat digunakan kembali sebagai upaya manajemen proses bisnis tersebut ke dalam sebuah repositori. Dalam repositori berisi ratusan hingga ribuan model proses bisnis dengan model yang sama maupun berbeda. Hingga dapat terjadinya duplikasi dan penumpukkan data. Untuk mengatasi permasalahan tersebut, perlunya dilakukan pengukuran terhadap model proses bisnis yang memiliki kesamaan atau kemiripan dalam hal aktivitas ataupun proses. Beberapa model proses bisnis yang memiliki kemiripan (similarity) dapat diidentifikasi sebagai model proses bisnis utama, yaitu memiliki fungsi dan aktivitas yang sama. Mencocokkan model proses bisnis merupakan salah satu teknik untuk mengidentifikasi, mengukur kemiripan dari kumpulan model proses bisnis. Pendekatan pencocokkan graf (graph matching) cocok untuk mengidentifikasi kemiripan proses atau aktivitas dalam model proses bisnis. Teknik mencocokkan graf dengan Greedy graph matching menghasilkan nilai presisi sebesar 89% berdasarkan pengukuran kemiripan struktur graf. Pendekatan lain dalam pencocokkan graf ialah secara semantik atau teks. Probabilistic Latent Semantic Analysis (PLSA) merupakan salah satu pendekatan semantik untuk menghitung kemiripan teks dalam dokumen. Perhitungan PLSA dalam analisis pencocokkan proses bisnis adalah dengan membandingkan label teks pada tiap node (label) proses bisnis. Penelitian ini mengukur kemiripan model proses bisnis dengan menggabungkan dua teknik analisis kemiripan berdasarkan semantik menggunakan PLSA dan struktural dengan Greedy. Teknik pencocokkan graf dengan menghitung semantik dari setiap label aktivitas yang saling memiliki keterkaitan atau hubungan. Secara struktural, beberapa aktivitas saling terhubung memiliki keterkaitan proses atau fungsi yang sama. Hasil penelitian ini adalah untuk mengetahui efektifitas dari proses bisnis yang memiliki keterkaitan aktivitas.Kata Kunci : Proses Bisnis, BPMN, Kemiripan Graf, Probabilistic Latent Semantic Analysis (PLSA), Greedy Graph Matching

MEASURING BUSINESS PROCESS SIMILARITY USING PROBABILISTIC LATENT SEMANTIC ANALYSIS (PLSA) AND GREEDY GRAPH MATCHING

AbstractThe business process is a set of activities and tasks performed to achieve the goals of an organization. The business process model can be reused as a business process management effort into a repository. To solve the problem, it is necessary to measure the business process model that has similarity or similarity in terms of activity or process. From several business process models that have similarity can be identified as the main business process model, which has the primary function of the same activity. Business process model matching is the one of technique that can be used to identify, to measure the similarity of a set of business process models. The graph matching approach fit to identify the similarity of processes or activities in the business process model. The technique of matching the graph with Greedy graph matching shows similar results with an 89% precision value based on measuring the similarity of the graph building structure. Another approach in graph matching is a semantically or a text-based. Probabilistic Latent Semantic Analysis (PLSA) is one of the semantic approaches to measure the similarity of text in documents. PLSA measures the linkage of words in the document to identify any similarity of topics in the document. Measuring PLSA in business process matching analysis is by comparing text labels on each node in the business process. This research measures the similarity of business process models by combining two similarity analysis techniques based on semantics using PLSA and structural with Greedy. A graph matching technique by computing the semantics of each label on activities that are related to other activity labels. Structurally, connected activities are related to the same process or the same function. The result of this research is to know the effectiveness of business process which has activity relation.Keywords : Business Process, BPMN, Graph Similarity, Probabilistic Latent Semantic Analysis (PLSA), Greedy Graph MatchingProses bisnis adalah serangkaian aktivitas dan tugas yang dilakukan untuk mencapai tujuan dari sebuah organisasi. Model proses bisnis dapat digunakan kembali sebagai upaya manajemen proses bisnis tersebut ke dalam sebuah repositori. Dalam repositori berisi ratusan hingga ribuan model proses bisnis dengan model yang sama maupun berbeda. Hingga dapat terjadinya duplikasi dan penumpukkan data. Untuk mengatasi permasalahan tersebut, perlunya dilakukan pengukuran terhadap model proses bisnis yang memiliki kesamaan atau kemiripan dalam hal aktivitas ataupun proses. Beberapa model proses bisnis yang memiliki kemiripan (similarity) dapat diidentifikasi sebagai model proses bisnis utama, yaitu memiliki fungsi dan aktivitas yang sama. Mencocokkan model proses bisnis merupakan salah satu teknik untuk mengidentifikasi, mengukur kemiripan dari kumpulan model proses bisnis. Pendekatan pencocokkan graf (graph matching) cocok untuk mengidentifikasi kemiripan proses atau aktivitas dalam model proses bisnis. Teknik mencocokkan graf dengan Greedy graph matching menghasilkan nilai presisi sebesar 89% berdasarkan pengukuran kemiripan struktur graf. Pendekatan lain dalam pencocokkan graf ialah secara semantik atau teks. Probabilistic Latent Semantic Analysis (PLSA) merupakan salah satu pendekatan semantik untuk menghitung kemiripan teks dalam dokumen. Perhitungan PLSA dalam analisis pencocokkan proses bisnis adalah dengan membandingkan label teks pada tiap node (label) proses bisnis. Penelitian ini mengukur kemiripan model proses bisnis dengan menggabungkan dua teknik analisis kemiripan berdasarkan semantik menggunakan PLSA dan struktural dengan Greedy. Teknik pencocokkan graf dengan menghitung semantik dari setiap label aktivitas yang saling memiliki keterkaitan atau hubungan. Secara struktural, beberapa aktivitas saling terhubung memiliki keterkaitan proses atau fungsi yang sama. Hasil penelitian ini adalah untuk mengetahui efektifitas dari proses bisnis yang memiliki keterkaitan aktivitas.Kata Kunci : Proses Bisnis, BPMN, Kemiripan Graf, Probabilistic Latent Semantic Analysis (PLSA), Greedy Graph Matching