Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen
OPUS4-35755 Wissenschaftlicher Artikel Yang, Yong; Dumas, Marlon; Garcia-Banuelos, Luciano; Polyvyanyy, Artem; Zhang, Liang Generalized aggregate quality of service computation for composite services 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. New York Elsevier 2012 13 The journal of systems and software 85 8 1818 1830 10.1016/j.jss.2012.03.005 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-37186 Wissenschaftlicher Artikel Weidlich, Matthias; Polyvyanyy, Artem; Mendling, Jan; Weske, Mathias Causal behavioural profiles - efficient computation, applications, and evaluation Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets. We also elaborate on the findings of applying our technique to three industry model collections. Amsterdam IOS Press 2011 37 Fundamenta informaticae 113 3-4 399 435 10.3233/FI-2011-614 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-36542 Wissenschaftlicher Artikel Weidlich, Matthias; Polyvyanyy, Artem; Desai, Nirmit; Mendling, Jan; Weske, Mathias Process compliance analysis based on behavioural profiles Process compliance measurement is getting increasing attention in companies due to stricter legal requirements and market pressure for operational excellence. In order to judge on compliance of the business processing, the degree of behavioural deviation of a case, i.e., an observed execution sequence, is quantified with respect to a process model (referred to as fitness, or recall). Recently, different compliance measures have been proposed. Still, nearly all of them are grounded on state-based techniques and the trace equivalence criterion, in particular. As a consequence, these approaches have to deal with the state explosion problem. In this paper, we argue that a behavioural abstraction may be leveraged to measure the compliance of a process log - a collection of cases. To this end, we utilise causal behavioural profiles that capture the behavioural characteristics of process models and cases, and can be computed efficiently. We propose different compliance measures based on these profiles, discuss the impact of noise in process logs on our measures, and show how diagnostic information on non-compliance is derived. As a validation, we report on findings of applying our approach in a case study with an international service provider. Oxford Elsevier 2011 17 Information systems 36 7 1009 1025 10.1016/j.is.2011.04.002 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-3097 Buch (Monographie) Polyvyanyy, Artem; Smirnov, Sergey; Weske, Mathias The triconnected abstraction of process models Contents: Artem Polyvanny, Sergey Smirnow, and Mathias Weske The Triconnected Abstraction of Process Models 1 Introduction 2 Business Process Model Abstraction 3 Preliminaries 4 Triconnected Decomposition 4.1 Basic Approach for Process Component Discovery 4.2 SPQR-Tree Decomposition 4.3 SPQR-Tree Fragments in the Context of Process Models 5 Triconnected Abstraction 5.1 Abstraction Rules 5.2 Abstraction Algorithm 6 Related Work and Conclusions Potsdam Universitätsverlag Potsdam 2008 17 978-3-940793-65-2 urn:nbn:de:kobv:517-opus-32847 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-3121 Buch (Monographie) Polyvyanyy, Artem; Smirnov, Sergey; Weske, Mathias Reducing the complexity of large EPCs Inhalt: 1 Introduction 2 Motivation and Goal 3 Fundamentals 4 Elementary Abstractions 5 Real World Example 6 Conclusions 2008 urn:nbn:de:kobv:517-opus-32959 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-3202 Buch (Monographie) Polyvyanyy, Artem; Kuropka, Dominik A quantitative evaluation of the enhanced topic-based vector space model This contribution presents a quantitative evaluation procedure for Information Retrieval models and the results of this procedure applied on the enhanced Topic-based Vector Space Model (eTVSM). Since the eTVSM is an ontology-based model, its effectiveness heavily depends on the quality of the underlaying ontology. Therefore the model has been tested with different ontologies to evaluate the impact of those ontologies on the effectiveness of the eTVSM. On the highest level of abstraction, the following results have been observed during our evaluation: First, the theoretically deduced statement that the eTVSM has a similar effecitivity like the classic Vector Space Model if a trivial ontology (every term is a concept and it is independet of any other concepts) is used has been approved. Second, we were able to show that the effectiveness of the eTVSM raises if an ontology is used which is only able to resolve synonyms. We were able to derive such kind of ontology automatically from the WordNet ontology. Third, we observed that more powerful ontologies automatically derived from the WordNet, dramatically dropped the effectiveness of the eTVSM model even clearly below the effectiveness level of the Vector Space Model. Fourth, we were able to show that a manually created and optimized ontology is able to raise the effectiveness of the eTVSM to a level which is clearly above the best effectiveness levels we have found in the literature for the Latent Semantic Index model with compareable document sets. 2007 978-3-939469-95-7 urn:nbn:de:kobv:517-opus-33816 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-38351 Wissenschaftlicher Artikel Polyvyanyy, Artem; Garcia-Banuelos, Luciano; Fahland, Dirk; Weske, Mathias Maximal structuring of acyclic process models 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. Oxford Oxford Univ. Press 2014 24 The computer journal : a publication of the British Computer Society 57 1 12 35 10.1093/comjnl/bxs126 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-35691 Wissenschaftlicher Artikel Polyvyanyy, Artem; Garcia-Banuelos, Luciano; Dumas, Marlon Structuring acyclic process models 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. Oxford Elsevier 2012 21 Information systems 37 6 518 538 10.1016/j.is.2011.10.005 Hasso-Plattner-Institut für Digital Engineering gGmbH
OPUS4-5705 Dissertation Polyvyanyy, Artem Structuring process models One can fairly adopt the ideas of Donald E. Knuth to conclude that process modeling is both a science and an art. Process modeling does have an aesthetic sense. Similar to composing an opera or writing a novel, process modeling is carried out by humans who undergo creative practices when engineering a process model. Therefore, the very same process can be modeled in a myriad number of ways. Once modeled, processes can be analyzed by employing scientific methods. Usually, process models are formalized as directed graphs, with nodes representing tasks and decisions, and directed arcs describing temporal constraints between the nodes. Common process definition languages, such as Business Process Model and Notation (BPMN) and Event-driven Process Chain (EPC) allow process analysts to define models with arbitrary complex topologies. The absence of structural constraints supports creativity and productivity, as there is no need to force ideas into a limited amount of available structural patterns. Nevertheless, it is often preferable that models follow certain structural rules. A well-known structural property of process models is (well-)structuredness. A process model is (well-)structured if and only if every node with multiple outgoing arcs (a split) has a corresponding node with multiple incoming arcs (a join), and vice versa, such that the set of nodes between the split and the join induces a single-entry-single-exit (SESE) region; otherwise the process model is unstructured. The motivations for well-structured process models are manifold: (i) Well-structured process models are easier to layout for visual representation as their formalizations are planar graphs. (ii) Well-structured process models are easier to comprehend by humans. (iii) Well-structured process models tend to have fewer errors than unstructured ones and it is less probable to introduce new errors when modifying a well-structured process model. (iv) Well-structured process models are better suited for analysis with many existing formal techniques applicable only for well-structured process models. (v) Well-structured process models are better suited for efficient execution and optimization, e.g., when discovering independent regions of a process model that can be executed concurrently. Consequently, there are process modeling languages that encourage well-structured modeling, e.g., Business Process Execution Language (BPEL) and ADEPT. However, the well-structured process modeling implies some limitations: (i) There exist processes that cannot be formalized as well-structured process models. (ii) There exist processes that when formalized as well-structured process models require a considerable duplication of modeling constructs. Rather than expecting well-structured modeling from start, we advocate for the absence of structural constraints when modeling. Afterwards, automated methods can suggest, upon request and whenever possible, alternative formalizations that are "better" structured, preferably well-structured. In this thesis, we study the problem of automatically transforming process models into equivalent well-structured models. The developed transformations are performed under a strong notion of behavioral equivalence which preserves concurrency. The findings are implemented in a tool, which is publicly available. 2012 urn:nbn:de:kobv:517-opus-59024 Institut für Informatik und Computational Science
OPUS4-4009 Buch (Monographie) Alnemr, Rehab; Polyvyanyy, Artem; AbuJarour, Mohammed; Appeltauer, Malte; Hildebrandt, Dieter; Thomas, Ivonne; Overdick, Hagen; Schöbel, Michael; Uflacker, Matthias; Kluth, Stephan; Menzel, Michael; Schmidt, Alexander; Hagedorn, Benjamin; Pascalau, Emilian; Perscheid, Michael; Vogel, Thomas; Hentschel, Uwe; Feinbube, Frank; Kowark, Thomas; Trümper, Jonas; Vogel, Tobias; Becker, Basil Meinel, Christoph; Plattner, Hasso; Döllner, Jürgen; Weske, Mathias; Polze, Andreas; Hirschfeld, Robert; Naumann, Felix; Giese, Holger Proceedings of the 4th Ph.D. Retreat of the HPI Research School on Service-oriented Systems Engineering Potsdam Universitätsverlag Potsdam 2010 Getr. Zählung 978-3-86956-036-6 urn:nbn:de:kobv:517-opus-40838 Hasso-Plattner-Institut für Digital Engineering gGmbH