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  - Mendling, Jan
A1  - Weber, Ingo
A1  - van der Aalst, Wil
A1  - Brocke, Jan Vom
A1  - Cabanillas, Cristina
A1  - Daniel, Florian
A1  - Debois, Soren
A1  - Di Ciccio, Claudio
A1  - Dumas, Marlon
A1  - Dustdar, Schahram
A1  - Gal, Avigdor
A1  - Garcia-Banuelos, Luciano
A1  - Governatori, Guido
A1  - Hull, Richard
A1  - La Rosa, Marcello
A1  - Leopold, Henrik
A1  - Leymann, Frank
A1  - Recker, Jan
A1  - Reichert, Manfred
A1  - Reijers, Hajo A.
A1  - Rinderle-Ma, Stefanie
A1  - Solti, Andreas
A1  - Rosemann, Michael
A1  - Schulte, Stefan
A1  - Singh, Munindar P.
A1  - Slaats, Tijs
A1  - Staples, Mark
A1  - Weber, Barbara
A1  - Weidlich, Matthias
A1  - Weske, Mathias
A1  - Xu, Xiwei
A1  - Zhu, Liming
T1  - Blockchains for Business Process Management
BT  - Challenges and Opportunities
JF  - ACM Transactions on Management Information Systems
N2  - Blockchain technology offers a sizable promise to rethink the way interorganizational business processes are managed because of its potential to realize execution without a central party serving as a single point of trust (and failure). To stimulate research on this promise and the limits thereof, in this article, we outline the challenges and opportunities of blockchain for business process management (BPM). We first reflect how blockchains could be used in the context of the established BPM lifecycle and second how they might become relevant beyond. We conclude our discourse with a summary of seven research directions for investigating the application of blockchain technology in the context of BPM.
KW  - Blockchain
KW  - business process management
KW  - research challenges
Y1  - 2018
U6  - https://doi.org/10.1145/3183367
SN  - 2158-656X
SN  - 2158-6578
VL  - 9
IS  - 1
SP  - 1
EP  - 16
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Polyvyanyy, Artem
A1  - Garcia-Banuelos, Luciano
A1  - Dumas, Marlon
T1  - Structuring acyclic process models
JF  - Information systems
N2  - This article studies the problem of transforming a process model with an arbitrary topology into an equivalent well-structured process model. While this problem has received significant attention, there is still no full characterization of the class of unstructured process models that can be transformed into well-structured ones, nor an automated method for structuring any process model that belongs to this class. This article fills this gap in the context of acyclic process models. The article defines a necessary and sufficient condition for an unstructured acyclic process model to have an equivalent well-structured process model under fully concurrent bisimulation, as well as a complete structuring method. The method has been implemented as a tool that takes process models captured in the BPMN and EPC notations as input. The article also reports on an empirical evaluation of the structuring method using a repository of process models from commercial practice.
KW  - Process modeling
KW  - Structured modeling
KW  - Structuring
KW  - Model equivalence
KW  - Petri net unfolding
KW  - Modular decomposition
Y1  - 2012
U6  - https://doi.org/10.1016/j.is.2011.10.005
SN  - 0306-4379
VL  - 37
IS  - 6
SP  - 518
EP  - 538
PB  - Elsevier
CY  - Oxford
ER  - 
TY  - JOUR
A1  - Yang, Yong
A1  - Dumas, Marlon
A1  - Garcia-Banuelos, Luciano
A1  - Polyvyanyy, Artem
A1  - Zhang, Liang
T1  - Generalized aggregate quality of service computation for composite services
JF  - The journal of systems and software
N2  - This article addresses the problem of estimating the Quality of Service (QoS) of a composite service given the QoS of the services participating in the composition. Previous solutions to this problem impose restrictions on the topology of the orchestration models, limiting their applicability to well-structured orchestration models for example. This article lifts these restrictions by proposing a method for aggregate QoS computation that deals with more general types of unstructured orchestration models. The applicability and scalability of the proposed method are validated using a collection of models from industrial practice.
KW  - Service-oriented computing
KW  - Service composition
KW  - Service orchestration
KW  - Quality of service
Y1  - 2012
U6  - https://doi.org/10.1016/j.jss.2012.03.005
SN  - 0164-1212
VL  - 85
IS  - 8
SP  - 1818
EP  - 1830
PB  - Elsevier
CY  - New York
ER  -