Piotr Wiśniewski

Overview of Verification Tools for Business Process Models

Formal verification of process models is an important issue in Business Process Management. Such a verification provides the information about the correctness of a process model, can be also used for checking business compliance or as a preliminary step to simulation. In this paper, we provide an overview of the existing tools for such a verification.

Constraint-Based Composition of Business Process Models

Process models help organizations to visualize and optimize their activities, and achieve their business goals in a more efficient way. Modeling a business process requires exact information about possible execution sequences of the activities as well as process modeling notation knowledge. We present a method of business process composition based on the constraint programming technique. Taking task specifications as the input, our solution can generate a workflow log which can be used to discover the model using any process mining technique.

A Concept for Generating Business Process Models from Natural Language Description.

Manual extraction of business process models from technical documentation is a time-consuming task. Several approaches to generating such process models have been proposed. We present a proposal of a new method for extracting business process from natural language text through intermediate process model using the spreadsheet-based representation. Such intermediate model is transformed into a valid BPMN process model. Our method is enhanced with semantic analysis of the text, allows for quick check of the transformation result and manual correction during this process. As the obtained BPMN model is structured, it is easier to check its correctness.

Knowledge Representation in Model Driven Approach in Terms of the Zachman Framework

Model driven approach uses distinct models for representing various kinds of complex knowledge. Use of appropriate models allows for taking advantage of formal checking, testing, and validating possibilities available for the models. Although the notations do not provide any design method or software process, this paper offers a step to integrated modeling using them. We present an overview of the existing OMG solutions for knowledge representation used in software engineering, focusing on UML, BPMN, DMN and CMMN models and the diagrams provided by these notations. We perform an analysis of these approaches in terms of Kruchten’s 4+1 view model architecture as well as the Zachman Framework.

Constraint-Based Identification of Complex Gateway Structures in Business Process Models

In this paper, we present a method for identifying parallel and alternative gateway structures in BPMN models. It can be applied in the composition of business processes from their declarative specifications. Our approach is based on a directed graph representation of a business process as well as the constraint programming technique. Provided the information about process activities and relations between them, the proposed approach consists in finding a structure of logical data-based gateways that satisfies the set of predefined constraints. A detailed illustration of our method is preceded by a brief description of BPMN and its formal representation.

Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction

In this paper, a new temporal extension of Traveling Salesman Problem (TSP) – as an old optimization problem – is proposed. This proposal stems from a need to elucidate TSP not only as an optimization problem, but also as a potentially paradigmatic problem for the subject specification of temporal planning. This new Temporal Traveling Salesman Problem is described in two ways – in the graph-based depiction and in terms of logic to be interpreted later by the so-called fibred semantics.

An Approach to Robust Urban Transport Management. Mixed Graph-Based Model for Decision Support

In this paper, we present a mathematical model of public transport network, which can be used for generation of alternative routes during crisis situations. It is based on a mixed graph, where decision points are represented by vertices and track sections by edges. Route and vehicle definitions are also provided. We determine the objective function to select the most suitable route as well as the forbidden path set which contains paths that cannot be executed in real networks. The model definition is preceded by examples and analyses of different types of crisis situations.

Supporting BPMN Process Models with UML Sequence Diagrams for Representing Time Issues and Testing Models

Business Process Model and Notation is a standard for process modeling. However, such models do not specify the time issues such as time of performing tasks or time of utilizing the resources. We propose the complementary UML sequence model generated from the BPMN model. Such a model can support time specification and provide direct time visualization. It is also suitable for validation in terms of time matters by domain experts as well as can be used to estimate and test methods in the systems based on random examination of the critical paths.