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  - 
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  - 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  -