Home PURPOSE OF THE CENTER: To develop the center to address state-of-the-art research, create innovating educational programs, and support technology transfers using commercially viable results to assist the Army Research Laboratory to develop the next generation Future Combat System in the telecommunications sector that assures prevention of perceived threats, and Non Line of Sight/Beyond Line of Sight lethal support.

How to… home page

Business Process Management (BPM) research resulted in a plethora of methods, techniques, and tools to support the design, enactment, management, and analysis of operational business processes. This survey aims to structure these results and provide an overview of the state-of-the-art in BPM. In BPM the concept of a process model is fundamental. Process models may be used to configure information systems, but may also be used to analyze, understand, and improve the processes they describe. Hence, the introduction of BPM technology has both managerial and technical ramifications and may enable significant productivity improvements, cost savings, and flow-time reductions. The practical relevance of BPM and rapid developments over the last decade justify a comprehensive survey.

/pdf/business-process-management-a-comprehensive-survey-bjvwpsge7u.pdf

Business Process Management: A Comprehensive Survey

The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of systems development. The mix of constructs found in BPMN makes it possible to create models with semantic errors. Such errors are especially serious, because errors in the early phases of systems development are among the most costly and hardest to correct. The ability to statically check the semantic correctness of models is thus a desirable feature for modelling tools based on BPMN. Accordingly, this paper proposes a mapping from BPMN to a formal language, namely Petri nets, for which efficient analysis techniques are available. The proposed mapping has been implemented as a tool that, in conjunction with existing Petri net-based tools, enables the static analysis of BPMN models. The formalisation also led to the identification of deficiencies in the BPMN standard specification.

/pdf/semantics-and-analysis-of-business-process-models-in-bpmn-1opylwzudv.pdf

Semantics and analysis of business process models in BPMN

https://pure.tue.nl/ws/files/3887204/760250.pdf

A review of recent research on green road freight transportation

https://kodu.ut.ee/~dumas/pubs/BetaWPSimilarity.pdf

Similarity of business process models: Metrics and evaluation

The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of system development. The mix of constructs in BPMN makes it possible to define models with a range of semantic errors. But the static analysis of BPMN models to detect such errors is hindered by ambiguities in the standard specification and the complexity of the language. The fact that BPMN integrates constructs from graph-oriented process definition languages with features for concurrent execution of multiple instances of a subprocess and exception handling, makes it challenging to provide a formal semantics of BPMN. Even more challenging is to provide a semantics that can be used to analyse BPMN models. This paper proposes a formalisation of BPMN in terms a mapping to Petri nets, for which efficient analysis techniques exist. The mapping has been implemented as a tool that generates code in the Petri Net Markup Language. The formalisation has led to the identification of deficiencies in the BPMN specification.

We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, we seek to find a compromise between computational complexity and quality of the computed ranking. Using a repository of 100 process models, we evaluate four graph matching algorithms, ranging from a greedy one to a relatively exhaustive one. The results show that the mean average precision obtained by a fast greedy algorithm is close to that obtained with the most exhaustive algorithm.

/pdf/graph-matching-algorithms-for-business-process-model-1j47l962kk.pdf

Graph Matching Algorithms for Business Process Model Similarity Search

/pdf/business-process-model-and-notation-third-international-jdy5x4pq31.pdf

Remco M. Dijkman

Papers

Semantics and analysis of business process models in BPMN

Similarity of business process models: Metrics and evaluation

Semantics and analysis of business process models in BPMN

Graph Matching Algorithms for Business Process Model Similarity Search

Business process model and notation : third international workshop, BPMN 2011, Lucerne, Switzerland, November 21-22, 2011 : proceedings