Logo des Repositoriums

Auflistung nach Autor:in "Polyvyanyy, Artem"

1 - 6 von 6
  • Zeitschriftenartikel
    Monotone Precision and Recall Measures for Comparing Executions and Specifications of Dynamic Systems.
    (EMISA Forum: Vol. 40, No. 1, 2020) Polyvyanyy, Artem; Solti, Andreas; Weidlich, Matthias; Ciccio, Claudio Di; Mendling, Jan
  • Konferenzbeitrag
    On application of structural decomposition for process model abstraction
    (Business process, services – computing and intelligent service management, 2009) Polyvyanyy, Artem; Smirnov, Sergey; Weske, Mathias
    Real world business process models may consist of hundreds of elements and have sophisticated structure. Although there are tasks where such models are valuable and appreciated, in general complexity has a negative influence on model comprehension and analysis. Thus, means for managing the complexity of process models are needed. One approach is abstraction of business process models-creation of a process model which preserves the main features of the initial elaborate process model, but leaves out insignificant details. In this paper we study the structural aspects of process model abstraction and introduce an abstraction approach based on process structure trees (PST). The developed approach assures that the abstracted process model preserves the ordering constraints of the initial model. It surpasses pattern-based process model abstraction approaches, allowing to handle graph-structured process models of arbitrary structure. We also provide an evaluation of the proposed approach.
  • Konferenzbeitrag
    On separation of concurrency and conflicts in acyclic process models
    (EMISA 2010. Einflussfaktoren auf die Entwicklung flexibler, integrierter Informationssysteme. Beiträge des Workshops der GI-Fachgruppe EMISA (Entwicklungsmethoden für Informationssysteme und deren Anwendung), 2010) Elliger, Felix; Polyvyanyy, Artem; Weske, Mathias
    Recently, a new approach for structuring acyclic process models has been introduced. The algorithm is based on a transformation between the Refined Process Structure Tree (RPST) of a control flow graph and the Modular Decomposition Tree (MDT) of ordering relations. In this paper, an extension of the algorithm is presented that allows to partially structure process models in the case when a process model cannot be structured completely. We distinguish four different types of unstructuredness of process models and show that only two are possible in practice. For one of these two types of unstructuredness an algorithm is proposed that returns the maximally structured representation of a process model.
  • Konferenzbeitrag
    Reducing complexity of large EPCs
    (Modellierung betrieblicher Informationssysteme (MobIS 2008), 2008) Polyvyanyy, Artem; Smirnov, Sergey; Weske, Mathias
    Business processes are an important instrument for understanding and improving how companies provide goods and services to customers. Therefore, many companies have documented their business processes well, often in the Event-driven Process Chains (EPC). Unfortunately, in many cases the resulting EPCs are rather complex, so that the overall process logic is hidden in low level process details. This paper proposes abstraction mechanisms for process models that aim to reduce their complexity, while keeping the overall process structure. We assume that functions are marked with efforts and splits are marked with probabilities. This information is used to separate important process parts from less important ones. Real world process models are used to validate the approach.
  • Zeitschriftenartikel
    Robotic Process Mining: Vision and Challenges
    (Business & Information Systems Engineering: Vol. 63, No. 3, 2021) Leno, Volodymyr; Polyvyanyy, Artem; Dumas, Marlon; La Rosa, Marcello; Maggi, Fabrizio Maria
    Robotic process automation (RPA) is an emerging technology that allows organizations automating repetitive clerical tasks by executing scripts that encode sequences of fine-grained interactions with Web and desktop applications. Examples of clerical tasks include opening a file, selecting a field in a Web form or a cell in a spreadsheet, and copy-pasting data across fields or cells. Given that RPA canÿautomate a wide range of routines, thisÿraises the question of which routines should be automated in the first place. This paper presents a vision towards a family of techniques, termed robotic process mining (RPM), aimed at filling this gap. The core idea of RPM is that repetitive routines amenable for automation can be discovered from logs of interactions between workers and Web and desktop applications, also known as user interactions (UI) logs. The paper defines a set of basic concepts underpinning RPM and presents a pipeline of processing steps that would allow an RPM tool to generate RPA scripts from UI logs. The paper also discusses research challenges to realize the envisioned pipeline. (**encoding or data invalid**)
  • Konferenzbeitrag
    Supporting Process Model Validation through Natural Language Generation
    (Software Engineering 2016, 2016) Leopold, Henrik; Mendling, Jan; Polyvyanyy, Artem