@article{PolyvyanyyGarciaBanuelosDumas2012,
  author    = {Polyvyanyy, Artem and Garcia-Banuelos, Luciano and Dumas, Marlon},
  title     = {Structuring acyclic process models},
  series = {Information systems},
  volume    = {37},
  journal   = {Information systems},
  number    = {6},
  publisher = {Elsevier},
  address   = {Oxford},
  issn      = {0306-4379},
  doi       = {10.1016/j.is.2011.10.005},
  pages     = {518 -- 538},
  year      = {2012},
  abstract  = {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.},
  language  = {en}
}
@article{PolyvyanyyGarciaBanuelosFahlandetal.2014,
  author    = {Polyvyanyy, Artem and Garcia-Banuelos, Luciano and Fahland, Dirk and Weske, Mathias},
  title     = {Maximal structuring of acyclic process models},
  series = {The computer journal : a publication of the British Computer Society},
  volume    = {57},
  journal   = {The computer journal : a publication of the British Computer Society},
  number    = {1},
  publisher = {Oxford Univ. Press},
  address   = {Oxford},
  issn      = {0010-4620},
  doi       = {10.1093/comjnl/bxs126},
  pages     = {12 -- 35},
  year      = {2014},
  abstract  = {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.},
  language  = {en}
}
@article{YangDumasGarciaBanuelosetal.2012,
  author    = {Yang, Yong and Dumas, Marlon and Garcia-Banuelos, Luciano and Polyvyanyy, Artem and Zhang, Liang},
  title     = {Generalized aggregate quality of service computation for composite services},
  series = {The journal of systems and software},
  volume    = {85},
  journal   = {The journal of systems and software},
  number    = {8},
  publisher = {Elsevier},
  address   = {New York},
  issn      = {0164-1212},
  doi       = {10.1016/j.jss.2012.03.005},
  pages     = {1818 -- 1830},
  year      = {2012},
  abstract  = {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.},
  language  = {en}
}
@article{MendlingWebervanderAalstetal.2018,
  author    = {Mendling, Jan and Weber, Ingo and van der Aalst, Wil and Brocke, Jan Vom and Cabanillas, Cristina and Daniel, Florian and Debois, Soren and Di Ciccio, Claudio and Dumas, Marlon and Dustdar, Schahram and Gal, Avigdor and Garcia-Banuelos, Luciano and Governatori, Guido and Hull, Richard and La Rosa, Marcello and Leopold, Henrik and Leymann, Frank and Recker, Jan and Reichert, Manfred and Reijers, Hajo A. and Rinderle-Ma, Stefanie and Solti, Andreas and Rosemann, Michael and Schulte, Stefan and Singh, Munindar P. and Slaats, Tijs and Staples, Mark and Weber, Barbara and Weidlich, Matthias and Weske, Mathias and Xu, Xiwei and Zhu, Liming},
  title     = {Blockchains for Business Process Management},
  series = {ACM Transactions on Management Information Systems},
  volume    = {9},
  journal   = {ACM Transactions on Management Information Systems},
  number    = {1},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {2158-656X},
  doi       = {10.1145/3183367},
  pages     = {1 -- 16},
  year      = {2018},
  abstract  = {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.},
  language  = {en}
}