TY  - JOUR
A1  - Rogge-Solti, Andreas
A1  - Weske, Mathias
T1  - Prediction of business process durations using non-Markovian stochastic Petri nets
JF  - Information systems
N2  - Companies need to efficiently manage their business processes to deliver products and services in time. Therefore, they monitor the progress of individual cases to be able to timely detect undesired deviations and to react accordingly. For example, companies can decide to speed up process execution by raising alerts or by using additional resources, which increases the chance that a certain deadline or service level agreement can be met. Central to such process control is accurate prediction of the remaining time of a case and the estimation of the risk of missing a deadline.
 To achieve this goal, we use a specific kind of stochastic Petri nets that can capture arbitrary duration distributions. Thereby, we are able to achieve higher prediction accuracy than related approaches. Further, we evaluate the approach in comparison to state of the art approaches and show the potential of exploiting a so far untapped source of information: the elapsed time since the last observed event. Real-world case studies in the financial and logistics domain serve to illustrate and evaluate the approach presented. (C) 2015 Elsevier Ltd. All rights reserved.
KW  - Business processes
KW  - Duration prediction
KW  - Risk control
KW  - Stochastic Petri nets
Y1  - 2015
U6  - https://doi.org/10.1016/j.is.2015.04.004
SN  - 0306-4379
SN  - 1873-6076
VL  - 54
SP  - 1
EP  - 14
PB  - Elsevier
CY  - Oxford
ER  - 
TY  - JOUR
A1  - Weidlich, Matthias
A1  - Ziekow, Holger
A1  - Gal, Avigdor
A1  - Mendling, Jan
A1  - Weske, Mathias
T1  - Optimizing event pattern matching using business process models
JF  - IEEE transactions on knowledge and data engineering
N2  - A growing number of enterprises use complex event processing for monitoring and controlling their operations, while business process models are used to document working procedures. In this work, we propose a comprehensive method for complex event processing optimization using business process models. Our proposed method is based on the extraction of behaviorial constraints that are used, in turn, to rewrite patterns for event detection, and select and transform execution plans. We offer a set of rewriting rules that is shown to be complete with respect to the all, seq, and any patterns. The effectiveness of our method is demonstrated in an experimental evaluation with a large number of processes from an insurance company. We illustrate that the proposed optimization leads to significant savings in query processing. By integrating the optimization in state-of-the-art systems for event pattern matching, we demonstrate that these savings materialize in different technical infrastructures and can be combined with existing optimization techniques.
KW  - Event processing
KW  - query optimisation
KW  - query rewriting
Y1  - 2014
U6  - https://doi.org/10.1109/TKDE.2014.2302306
SN  - 1041-4347
SN  - 1558-2191
VL  - 26
IS  - 11
SP  - 2759
EP  - 2773
PB  - Inst. of Electr. and Electronics Engineers
CY  - Los Alamitos
ER  - 
TY  - BOOK
A1  - Meyer, Andreas
A1  - Pufahl, Luise
A1  - Fahland, Dirk
A1  - Weske, Mathias
T1  - Modeling and enacting complex data dependencies in business processes
N2  - Enacting business processes in process engines requires the coverage of control flow, resource assignments, and process data. While the first two aspects are well supported in current process engines, data dependencies need to be added and maintained manually by a process engineer. Thus, this task is error-prone and time-consuming. In this report, we address the problem of modeling processes with complex data dependencies, e.g., m:n relationships, and their automatic enactment from process models. First, we extend BPMN data objects with few annotations to allow data dependency handling as well as data instance differentiation. Second, we introduce a pattern-based approach to derive SQL queries from process models utilizing the above mentioned extensions. Therewith, we allow automatic enactment of data-aware BPMN process models. We implemented our approach for the Activiti process engine to show applicability.
N2  - Die Ausführung von Geschäftsprozessen in Process Engines benötigt Informationen über den Kontrollfluss, die Rollenzuordnungen und die Datenabhängigkeiten. Während die ersten beiden Aspekte bereits automatisiert von Process Engines unterstützt werden, müssen die Datenabhängigkeiten durch einen Prozessingenieur manuell hinzugefügt und gewartet werden. Allerdings ist diese Aufgabe sehr fehleranfällig und zeitintensiv. In diesem Report zeigen wir wie Prozesse mit komplexen Datenabhängigkeiten, z.B. m:n Beziehungen, modelliert und automatisiert ausgeführt werden können. Dazu erweitern wir zuerst BPMN Datenobjekte mit wenigen Annotationen, um das Handling von Datenabhängikeiten sowie die Differenzierung von Datenobjektinstanzen zu ermöglichen. Danach beschreiben wir einen Pattern-basierten Ansatz, um SQL-Queries, unter Nutzung der oben erwähnten Erweiterungen, aus Prozessmodellen abzuleiten. Damit erlauben wir die automatisierte Ausführung von Daten-orientierten BPMN Prozessmodellen. Um die Anwendbarkeit unseres Ansatzen zu demonstieren, implementierten wir ihn für die Process Engine Activiti.
T3  - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 74 
KW  - Prozessmodellierung
KW  - Datenmodellierung
KW  - Prozessausführung
KW  - BPMN
KW  - SQL
KW  - Process Modeling
KW  - Data Modeling
KW  - Process Enactment
KW  - BPMN
KW  - SQL
Y1  - 2013
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-65103
SN  - 978-3-86956-245-2
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Polyvyanyy, Artem
A1  - Garcia-Banuelos, Luciano
A1  - Fahland, Dirk
A1  - Weske, Mathias
T1  - Maximal structuring of acyclic process models
JF  - The computer journal : a publication of the British Computer Society
N2  - This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models.
KW  - process modeling
KW  - structured process model
KW  - maximal structuring
KW  - model transformation
KW  - fully concurrent bisimulation
Y1  - 2014
U6  - https://doi.org/10.1093/comjnl/bxs126
SN  - 0010-4620
SN  - 1460-2067
VL  - 57
IS  - 1
SP  - 12
EP  - 35
PB  - Oxford Univ. Press
CY  - Oxford
ER  - 
TY  - JOUR
A1  - Baier, Thomas
A1  - Di Ciccio, Claudio
A1  - Mendling, Jan
A1  - Weske, Mathias
T1  - Matching events and activities by integrating behavioral aspects and label analysis
JF  - Software and systems modeling
N2  - Nowadays, business processes are increasingly supported by IT services that produce massive amounts of event data during the execution of a process. These event data can be used to analyze the process using process mining techniques to discover the real process, measure conformance to a given process model, or to enhance existing models with performance information. Mapping the produced events to activities of a given process model is essential for conformance checking, annotation and understanding of process mining results. In order to accomplish this mapping with low manual effort, we developed a semi-automatic approach that maps events to activities using insights from behavioral analysis and label analysis. The approach extracts Declare constraints from both the log and the model to build matching constraints to efficiently reduce the number of possible mappings. These mappings are further reduced using techniques from natural language processing, which allow for a matching based on labels and external knowledge sources. The evaluation with synthetic and real-life data demonstrates the effectiveness of the approach and its robustness toward non-conforming execution logs.
KW  - Process mining
KW  - Event mapping
KW  - Business process intelligence
KW  - Constraint satisfaction
KW  - Declare
KW  - Natural language processing
Y1  - 2018
U6  - https://doi.org/10.1007/s10270-017-0603-z
SN  - 1619-1366
SN  - 1619-1374
VL  - 17
IS  - 2
SP  - 573
EP  - 598
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - INPR
A1  - Dumas, Marlon
A1  - Recker, Jan
A1  - Weske, Mathias
T1  - Management and engineering of process-aware information systems:
 Introduction to the special issue
T2  - INFORMATION SYSTEMS
Y1  - 2012
U6  - https://doi.org/10.1016/j.is.2011.09.003
SN  - 0306-4379
VL  - 37
IS  - 2
SP  - 77
EP  - 79
PB  - PERGAMON-ELSEVIER SCIENCE LTD
CY  - OXFORD
ER  - 
TY  - JOUR
A1  - Decker, Gero
A1  - Weske, Mathias
T1  - Interaction-centric modeling of process choreographies
JF  - Information systems
N2  - With the rise of electronic integration between organizations, the need for a precise specification of interaction behavior increases. Information systems, replacing interaction previously carried out by humans via phone, faxes and emails, require a precise specification for handling all possible situations. Such interaction behavior is described in process choreographies. While many proposals for choreography languages have already been made, most of them fall into the category of interconnection models, where the observable behavior of the different partners is described and then related via message flow. As this article will show, this modeling approach fails to support fundamental design principles of choreographies and typically leads to modeling errors. This motivates an alternative modeling style, namely interaction modeling, for overcoming these limitations. While the main concepts are independent of a concrete modeling language, iBPMN is introduced as novel interaction modeling language. Formal execution semantics are provided and a comprehensive toolset implementing the approach is presented.
KW  - Choreographies
KW  - B2B process integration
KW  - Interaction modeling
KW  - Business Process Modeling Notation
Y1  - 2011
U6  - https://doi.org/10.1016/j.is.2010.06.005
SN  - 0306-4379
VL  - 36
IS  - 2
SP  - 292
EP  - 312
PB  - Elsevier
CY  - Oxford
ER  - 
TY  - JOUR
A1  - Decker, Gero
A1  - Kopp, Oliver
A1  - Leymann, Frank
A1  - Weske, Mathias
T1  - Interacting services : from specification to execution
N2  - Interacting services play a key role to realize business process integration among different business partners by means of electronic message exchange. In order to provide seamless integration of these services, the messages exchanged as well as their dependencies must be well-defined. Service choreographies are a means to describe the allowed conversations. This article presents a requirements framework for service choreography languages, along which existing choreography languages are assessed. The requirements framework provides the basis for introducing the language BPEL4Chor, which extends the industry standard WS-BPEL with choreography-specific concepts. A validation is provided and integration with executable service orchestrations is discussed.
Y1  - 2009
UR  - http://www.sciencedirect.com/science/journal/0169023X
U6  - https://doi.org/10.1016/j.datak.2009.04.003
SN  - 0169-023X
ER  - 
TY  - JOUR
A1  - Herzberg, Nico
A1  - Meyer, Andreas
A1  - Weske, Mathias
T1  - Improving business process intelligence by observing object state transitions
JF  - Data & knowledge engineering
N2  - During the execution of business processes several events happen that are recorded in the company's information systems. These events deliver insights into process executions so that process monitoring and analysis can be performed resulting, for instance, in prediction of upcoming process steps or the analysis of the run time of single steps. While event capturing is trivial when a process engine with integrated logging capabilities is used, manual process execution environments do not provide automatic logging of events, so that typically external devices, like bar code scanners, have to be used. As experience shows, these manual steps are error-prone and induce additional work. Therefore, we use object state transitions as additional monitoring information, so-called object state transition events. Based on these object state transition events, we reason about the enablement and termination of activities and provide the basis for process monitoring and analysis in terms of a large event log. In this paper, we present the concept to utilize information from these object state transition events for capturing process progress. Furthermore, we discuss a methodology to create the required design time artifacts that then are used for monitoring at run time. In a proof-of-concept implementation, we show how the design time and run time side work and prove applicability of the introduced concept of object state transition events. (C) 2015 Elsevier B.V. All rights reserved.
KW  - Business process management
KW  - Events
KW  - Data
KW  - Process Monitoring
KW  - BPMN
Y1  - 2015
U6  - https://doi.org/10.1016/j.datak.2015.07.008
SN  - 0169-023X
SN  - 1872-6933
VL  - 98
SP  - 144
EP  - 164
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Bazhenova, Ekaterina
A1  - Zerbato, Francesca
A1  - Oliboni, Barbara
A1  - Weske, Mathias
T1  - From BPMN process models to DMN decision models
JF  - Information systems
N2  - The interplay between process and decision models plays a crucial role in business process management, as decisions may be based on running processes and affect process outcomes. Often process models include decisions that are encoded through process control flow structures and data flow elements, thus reducing process model maintainability. The Decision Model and Notation (DMN) was proposed to achieve separation of concerns and to possibly complement the Business Process Model and Notation (BPMN) for designing decisions related to process models. Nevertheless, deriving decision models from process models remains challenging, especially when the same data underlie both process and decision models. In this paper, we explore how and to which extent the data modeled in BPMN processes and used for decision-making may be represented in the corresponding DMN decision models. To this end, we identify a set of patterns that capture possible representations of data in BPMN processes and that can be used to guide the derivation of decision models related to existing process models. Throughout the paper we refer to real-world healthcare processes to show the applicability of the proposed approach. (C) 2019 Elsevier Ltd. All rights reserved.
KW  - Business process models
KW  - Decision models
KW  - BPMN
KW  - DMN
KW  - Pattern
Y1  - 2019
U6  - https://doi.org/10.1016/j.is.2019.02.001
SN  - 0306-4379
SN  - 1873-6076
VL  - 83
SP  - 69
EP  - 88
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Haarmann, Stephan
A1  - Holfter, Adrian
A1  - Pufahl, Luise
A1  - Weske, Mathias
T1  - Formal framework for checking compliance of data-driven case management
JF  - Journal on data semantics : JoDS
N2  - Business processes are often specified in descriptive or normative models. Both types of models should adhere to internal and external regulations, such as company guidelines or laws. Employing compliance checking techniques, it is possible to verify process models against rules. While traditionally compliance checking focuses on well-structured processes, we address case management scenarios. In case management, knowledge workers drive multi-variant and adaptive processes. Our contribution is based on the fragment-based case management approach, which splits a process into a set of fragments. The fragments are synchronized through shared data but can, otherwise, be dynamically instantiated and executed. We formalize case models using Petri nets. We demonstrate the formalization for design-time and run-time compliance checking and present a proof-of-concept implementation. The application of the implemented compliance checking approach to a use case exemplifies its effectiveness while designing a case model. The empirical evaluation on a set of case models for measuring the performance of the approach shows that rules can often be checked in less than a second.
KW  - Compliance checking
KW  - Case management
KW  - Model verification
KW  - Data-centric
KW  - processes
Y1  - 2021
U6  - https://doi.org/10.1007/s13740-021-00120-3
SN  - 1861-2032
SN  - 1861-2040
VL  - 10
IS  - 1-2
SP  - 143
EP  - 163
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - BOOK
A1  - Herzberg, Nico
A1  - Weske, Mathias
T1  - Enriching raw events to enable process intelligence : research challenges
N2  - Business processes are performed within a company’s daily business. Thereby, valuable data about the process execution is produced. The quantity and quality of this data is very dependent on the process execution environment that reaches from predominantly manual to fullautomated. Process improvement is one essential cornerstone of business process management to ensure companies’ competitiveness and relies on information about the process execution. Especially in manual process environments data directly related to the process execution is rather sparse and incomplete. In this paper, we present an approach that supports the usage and enrichment of process execution data with context data – data that exists orthogonally to business process data – and knowledge from the corresponding process models to provide a high-quality event base for process intelligence subsuming, among others, process monitoring, process analysis, and process mining. Further, we discuss open issues and challenges that are subject to our future work.
N2  - Die wertschöpfenden Tätigkeiten in Unternehmen folgen definierten Geschäftsprozessen und werden entsprechend ausgeführt. Dabei werden wertvolle Daten über die Prozessausführung erzeugt. Die Menge und Qualität dieser Daten ist sehr stark von der Prozessausführungsumgebung abhängig, welche überwiegend manuell als auch vollautomatisiert sein kann. Die stetige Verbesserung von Prozessen ist einer der Hauptpfeiler des Business Process Managements, mit der Aufgabe die Wettbewerbsfähigkeit von Unternehmen zu sichern und zu steigern. Um Prozesse zu verbessern muss man diese analysieren und ist auf Daten der Prozessausführung angewiesen. Speziell bei manueller Prozessausführung sind die Daten nur selten direkt zur konkreten Prozessausführung verknüpft. In dieser Arbeit präsentieren wir einen Ansatz zur Verwendung und Anreicherung von Prozessausführungsdaten mit Kontextdaten – Daten die unabhängig zu den Prozessdaten existieren – und Wissen aus den dazugehörigen Prozessmodellen, um ein hochwertige Event- Datenbasis für Process Intelligence Anwendungen, wie zum Beispiel Prozessmonitoring, Prozessanalyse und Process Mining, sicherstellen zu können. Des Weiteren zeigen wir offene Fragestellungen und Herausforderungen auf, welche in Zukunft Gegenstand unserer Forschung sein werden.
T3  - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 73 
Y1  - 2013
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64012
SN  - 978-3-86956-241-4
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Weidlich, Matthias
A1  - Mendling, Jan
A1  - Weske, Mathias
T1  - Efficient consistency measurement based on behavioral profiles of process models
JF  - IEEE transactions on software engineering
N2  - Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap between business requirements and system specifications. However, diverging purposes of business process modeling initiatives have led to significant problems in aligning related models at different abstract levels and different perspectives. Checking the consistency of such corresponding models is a major challenge for process modeling theory and practice. In this paper, we take the inappropriateness of existing strict notions of behavioral equivalence as a starting point. Our contribution is a concept called behavioral profile that captures the essential behavioral constraints of a process model. We show that these profiles can be computed efficiently, i.e., in cubic time for sound free-choice Petri nets w.r.t. their number of places and transitions. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented to demonstrate the applicability of our approach. We also report the findings from checking consistency between partially overlapping models of the SAP reference model.
KW  - Process model analysis
KW  - process model alignment
KW  - behavioral abstraction
KW  - consistency checking
KW  - consistency measures
Y1  - 2011
U6  - https://doi.org/10.1109/TSE.2010.96
SN  - 0098-5589
VL  - 37
IS  - 3
SP  - 410
EP  - 429
PB  - Inst. of Electr. and Electronics Engineers
CY  - Los Alamitos
ER  - 
TY  - GEN
A1  - Haarmann, Stephan
A1  - Batoulis, Kimon
A1  - Nikaj, Adriatik
A1  - Weske, Mathias
T1  - DMN Decision Execution on the Ethereum Blockchain
T2  - Advanced Information Systems Engineering, CAISE 2018
N2  - Recently blockchain technology has been introduced to execute interacting business processes in a secure and transparent way. While the foundations for process enactment on blockchain have been researched, the execution of decisions on blockchain has not been addressed yet. In this paper we argue that decisions are an essential aspect of interacting business processes, and, therefore, also need to be executed on blockchain. The immutable representation of decision logic can be used by the interacting processes, so that decision taking will be more secure, more transparent, and better auditable. The approach is based on a mapping of the DMN language S-FEEL to Solidity code to be run on the Ethereum blockchain. The work is evaluated by a proof-of-concept prototype and an empirical cost evaluation.
KW  - Blockchain
KW  - Interacting processes
KW  - DMN
Y1  - 2018
SN  - 978-3-319-91563-0
SN  - 978-3-319-91562-3
U6  - https://doi.org/10.1007/978-3-319-91563-0_20
SN  - 0302-9743
SN  - 1611-3349
VL  - 10816
SP  - 327
EP  - 341
PB  - Springer
CY  - Cham
ER  - 
TY  - JOUR
A1  - Yousfi, Alaaeddine
A1  - Weske, Mathias
T1  - Discovering commute patterns via process mining
JF  - Knowledge and Information Systems
N2  - Ubiquitous computing has proven its relevance and efficiency in improving the user experience across a myriad of situations. It is now the ineluctable solution to keep pace with the ever-changing environments in which current systems operate. Despite the achievements of ubiquitous computing, this discipline is still overlooked in business process management. This is surprising, since many of today’s challenges, in this domain, can be addressed by methods and techniques from ubiquitous computing, for instance user context and dynamic aspects of resource locations. This paper takes a first step to integrate methods and techniques from ubiquitous computing in business process management. To do so, we propose discovering commute patterns via process mining. Through our proposition, we can deduce the users’ significant locations, routes, travel times and travel modes. This information can be a stepping-stone toward helping the business process management community embrace the latest achievements in ubiquitous computing, mainly in location-based service. To corroborate our claims, a user study was conducted. The significant places, routes, travel modes and commuting times of our test subjects were inferred with high accuracies. All in all, ubiquitous computing can enrich the processes with new capabilities that go beyond what has been established in business process management so far.
KW  - Commute pattern
KW  - Commute process
KW  - Process mining
KW  - Ubiquitous computing
KW  - Location-based services
Y1  - 2019
U6  - https://doi.org/10.1007/s10115-018-1255-1
SN  - 0219-1377
SN  - 0219-3116
VL  - 60
IS  - 2
SP  - 691
EP  - 713
PB  - Springer
CY  - London
ER  - 
TY  - JOUR
A1  - Luebbe, Alexander
A1  - Weske, Mathias
T1  - Determining the effect of tangible business process modeling
Y1  - 2012
ER  - 
TY  - GEN
A1  - Pufahl, Luise
A1  - Wong, Tsun Yin
A1  - Weske, Mathias
T1  - Design of an extensible BPMN process simulator
T2  - Business Process Management Workshops (BPM 2017)
N2  - Business process simulation is an important means for quantitative analysis of a business process and to compare different process alternatives. With the Business Process Model and Notation (BPMN) being the state-of-the-art language for the graphical representation of business processes, many existing process simulators support already the simulation of BPMN diagrams. However, they do not provide well-defined interfaces to integrate new concepts in the simulation environment. In this work, we present the design and architecture of a proof-of-concept implementation of an open and extensible BPMN process simulator. It also supports the simulation of multiple BPMN processes at a time and relies on the building blocks of the well-founded discrete event simulation. The extensibility is assured by a plug-in concept. Its feasibility is demonstrated by extensions supporting new BPMN concepts, such as the simulation of business rule activities referencing decision models and batch activities.
KW  - Business process simulation
KW  - Extensibility
KW  - BPMN
Y1  - 2018
SN  - 978-3-319-74030-0
SN  - 978-3-319-74029-4
U6  - https://doi.org/10.1007/978-3-319-74030-0_62
SN  - 1865-1348
VL  - 308
SP  - 782
EP  - 795
PB  - Springer
CY  - Berlin
ER  - 
TY  - GEN
A1  - Bazhenova, Ekaterina
A1  - Zerbato, Francesca
A1  - Weske, Mathias
T1  - Data-Centric Extraction of DMN Decision Models from BPMN Process Models
T2  - Business Process Management Workshops
N2  - Operational decisions in business processes can be modeled by using the Decision Model and Notation (DMN). The complementary use of DMN for decision modeling and of the Business Process Model and Notation (BPMN) for process design realizes the separation of concerns principle. For supporting separation of concerns during the design phase, it is crucial to understand which aspects of decision-making enclosed in a process model should be captured by a dedicated decision model. Whereas existing work focuses on the extraction of decision models from process control flow, the connection of process-related data and decision models is still unexplored. In this paper, we investigate how process-related data used for making decisions can be represented in process models and we distinguish a set of BPMN patterns capturing such information. Then, we provide a formal mapping of the identified BPMN patterns to corresponding DMN models and apply our approach to a real-world healthcare process.
KW  - Business process models
KW  - Process-related data
KW  - Decision models
Y1  - 2018
SN  - 978-3-319-74030-0
SN  - 978-3-319-74029-4
U6  - https://doi.org/10.1007/978-3-319-74030-0_43
SN  - 1865-1348
VL  - 308
SP  - 542
EP  - 555
PB  - Springer
CY  - Berlin
ER  - 
TY  - BOOK
A1  - Meyer, Andreas
A1  - Smirnov, Sergey
A1  - Weske, Mathias
T1  - Data in business processes
N2  - Process and data are equally important for business process management. Process data is especially relevant in the context of automated business processes, process controlling, and representation of organizations' core assets. One can discover many process modeling languages, each having a specific set of data modeling capabilities and the level of data awareness. The level of data awareness and data modeling capabilities vary significantly from one language to another. This paper evaluates several process modeling languages with respect to the role of data. To find a common ground for comparison, we develop a framework, which systematically organizes process- and data-related aspects of the modeling languages elaborating on the data aspects. Once the framework is in place, we compare twelve process modeling languages against it. We generalize the results of the comparison and identify clusters of similar languages with respect to data awareness.
N2  - Prozesse und Daten sind gleichermaßen wichtig für das Geschäftsprozessmanagement. Prozessdaten sind dabei insbesondere im Kontext der Automatisierung von Geschäftsprozessen, dem Prozesscontrolling und der Repräsentation der Vermögensgegenstände von Organisationen relevant. Es existieren viele Prozessmodellierungssprachen, von denen jede die Darstellung von Daten durch eine fest spezifizierte Menge an Modellierungskonstrukten ermöglicht. Allerdings unterscheiden sich diese Darstellungenund damit der Grad der Datenmodellierung stark untereinander. Dieser Report evaluiert verschiedene Prozessmodellierungssprachen bezüglich der Unterstützung von Datenmodellierung. Als einheitliche Grundlage entwickeln wir ein Framework, welches prozess- und datenrelevante Aspekte systematisch organisiert. Die Kriterien legen dabei das Hauptaugenmerk auf die datenrelevanten Aspekte. Nach Einführung des Frameworks vergleichen wir zwölf Prozessmodellierungssprachen gegen dieses. Wir generalisieren die Erkenntnisse aus den Vergleichen und identifizieren Cluster bezüglich des Grades der Datenmodellierung, in welche die einzelnen Sprachen eingeordnet werden.
T3  - Technische Berichte des Hasso-Plattner-Instituts für Digital Engineering an der Universität Potsdam - 50 
KW  - business process modeling
KW  - process modeling languages
KW  - data modeling
KW  - data in business processes
Y1  - 2011
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-53046
SN  - 978-3-86956-144-8
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Polyvyanyy, Artem
A1  - Weidlich, Matthias
A1  - Weske, Mathias
T1  - Connectivity of workflow nets the foundations of stepwise verification
JF  - Acta informatica
N2  - Behavioral models capture operational principles of real-world or designed systems. Formally, each behavioral model defines the state space of a system, i.e., its states and the principles of state transitions. Such a model is the basis for analysis of the system's properties. In practice, state spaces of systems are immense, which results in huge computational complexity for their analysis. Behavioral models are typically described as executable graphs, whose execution semantics encodes a state space. The structure theory of behavioral models studies the relations between the structure of a model and the properties of its state space. In this article, we use the connectivity property of graphs to achieve an efficient and extensive discovery of the compositional structure of behavioral models; behavioral models get stepwise decomposed into components with clear structural characteristics and inter-component relations. At each decomposition step, the discovered compositional structure of a model is used for reasoning on properties of the whole state space of the system. The approach is exemplified by means of a concrete behavioral model and verification criterion. That is, we analyze workflow nets, a well-established tool for modeling behavior of distributed systems, with respect to the soundness property, a basic correctness property of workflow nets. Stepwise verification allows the detection of violations of the soundness property by inspecting small portions of a model, thereby considerably reducing the amount of work to be done to perform soundness checks. Besides formal results, we also report on findings from applying our approach to an industry model collection.
Y1  - 2011
U6  - https://doi.org/10.1007/s00236-011-0137-8
SN  - 0001-5903
VL  - 48
IS  - 4
SP  - 213
EP  - 242
PB  - Springer
CY  - New York
ER  -