Process Structure

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 17700 Experts worldwide ranked by ideXlab platform

Jana Koehler - One of the best experts on this subject based on the ideXlab platform.

  • the refined Process Structure tree
    Data and Knowledge Engineering, 2009
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider a workflow graph as a model for the control flow of a business Process and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. We call it the refined Process Structure tree. It is based on and extends similar work for sequential programs by Tarjan and Valdes [ACM POPL '80, 1980, pp. 95-105]. We give two independent characterizations of the refined Process Structure tree which we prove to be equivalent: (1) a simple descriptive characterization that justifies our particular choice of the decomposition and (2) a constructive characterization that allows us to compute the decomposition in linear time. The latter is based on the tree of triconnected components (elsewhere also known as the SPQR tree) of a biconnected graph.

  • the refined Process Structure tree
    Business Process Management, 2008
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider workflow graphs as a model for the control flow of a business Process model and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modularand as fine as possible, where modularmeans that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph.

Hagen Volzer - One of the best experts on this subject based on the ideXlab platform.

  • simplified computation and generalization of the refined Process Structure tree
    International Conference on Web Services, 2010
    Co-Authors: Artem Polyvyanyy, Jussi Vanhatalo, Hagen Volzer
    Abstract:

    A business Process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the Structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

  • the refined Process Structure tree
    Data and Knowledge Engineering, 2009
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider a workflow graph as a model for the control flow of a business Process and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. We call it the refined Process Structure tree. It is based on and extends similar work for sequential programs by Tarjan and Valdes [ACM POPL '80, 1980, pp. 95-105]. We give two independent characterizations of the refined Process Structure tree which we prove to be equivalent: (1) a simple descriptive characterization that justifies our particular choice of the decomposition and (2) a constructive characterization that allows us to compute the decomposition in linear time. The latter is based on the tree of triconnected components (elsewhere also known as the SPQR tree) of a biconnected graph.

  • the refined Process Structure tree
    Business Process Management, 2008
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider workflow graphs as a model for the control flow of a business Process model and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modularand as fine as possible, where modularmeans that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph.

Jussi Vanhatalo - One of the best experts on this subject based on the ideXlab platform.

  • simplified computation and generalization of the refined Process Structure tree
    International Conference on Web Services, 2010
    Co-Authors: Artem Polyvyanyy, Jussi Vanhatalo, Hagen Volzer
    Abstract:

    A business Process is often modeled using some kind of a directed flow graph, which we call a workflow graph. The Refined Process Structure Tree (RPST) is a technique for workflow graph parsing, i.e., for discovering the Structure of a workflow graph, which has various applications. In this paper, we provide two improvements to the RPST. First, we propose an alternative way to compute the RPST that is simpler than the one developed originally. In particular, the computation reduces to constructing the tree of the triconnected components of a workflow graph in the special case when every node has at most one incoming or at most one outgoing edge. Such graphs occur frequently in applications. Secondly, we extend the applicability of the RPST. Originally, the RPST was applicable only to graphs with a single source and single sink such that the completed version of the graph is biconnected. We lift both restrictions. Therefore, the RPST is then applicable to arbitrary directed graphs such that every node is on a path from some source to some sink. This includes graphs with multiple sources and/or sinks and disconnected graphs.

  • the refined Process Structure tree
    Data and Knowledge Engineering, 2009
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider a workflow graph as a model for the control flow of a business Process and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modular and as fine as possible, where modular means that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. We call it the refined Process Structure tree. It is based on and extends similar work for sequential programs by Tarjan and Valdes [ACM POPL '80, 1980, pp. 95-105]. We give two independent characterizations of the refined Process Structure tree which we prove to be equivalent: (1) a simple descriptive characterization that justifies our particular choice of the decomposition and (2) a constructive characterization that allows us to compute the decomposition in linear time. The latter is based on the tree of triconnected components (elsewhere also known as the SPQR tree) of a biconnected graph.

  • the refined Process Structure tree
    Business Process Management, 2008
    Co-Authors: Jussi Vanhatalo, Hagen Volzer, Jana Koehler
    Abstract:

    We consider workflow graphs as a model for the control flow of a business Process model and study the problem of workflow graph parsing, i.e., finding the Structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of control. Such a decomposition is the crucial step, for example, to translate a Process modeled in a graph-based language such as BPMN into a Process modeled in a block-based language such as BPEL. For this and other applications, it is desirable that the decomposition be unique, modularand as fine as possible, where modularmeans that a local change of the workflow graph can only cause a local change of the decomposition. In this paper, we provide a decomposition that is unique, modular and finer than in previous work. It is based on and extends similar work for sequential programs by Tarjan and Valdes [11]. We show that our decomposition can be computed in linear time based on an algorithm by Hopcroft and Tarjan [3] that finds the triconnected components of a biconnected graph.

Zhou Jiang Bo - One of the best experts on this subject based on the ideXlab platform.

  • ICEBE - Research on workflow Process Structure verification
    IEEE International Conference on e-Business Engineering (ICEBE'05), 2005
    Co-Authors: Ling Hong, Zhou Jiang Bo
    Abstract:

    To solve the verification problem of workflow Process Structure, after reviewing related research papers, semantic deduce-based workflow verification method is proposed. Through Process Structure verification equal theorem, the proposed method firstly transforms a cyclic workflow Process into an acyclic one; and then generates all instance graphs of the workflow Process; lastly decides whether the workflow Process is correct or not according to semantic tables and the acyclic workflow verification theorem. Comparison with related workflow verification methods is presented in the end

  • Research on workflow Process Structure verification
    IEEE International Conference on e-Business Engineering (ICEBE'05), 2005
    Co-Authors: Ling Hong, Zhou Jiang Bo
    Abstract:

    To solve the verification problem of workflow Process Structure, after reviewing related research papers, semantic deduce-based workflow verification method is proposed. Through Process Structure verification equal theorem, the proposed method firstly transforms a cyclic workflow Process into an acyclic one; and then generates all instance graphs of the workflow Process; lastly decides whether the workflow Process is correct or not according to semantic tables and the acyclic workflow verification theorem. Comparison with related workflow verification methods is presented in the end

Surya R Kalidindi - One of the best experts on this subject based on the ideXlab platform.

  • ProcessStructure Linkages
    Hierarchical Materials Informatics, 2020
    Co-Authors: Surya R Kalidindi
    Abstract:

    In this chapter, we extend the framework described in the previous chapter to explore ProcessStructure (evolution) linkages. Once again, the linkages of interest are expressed at the higher length scale as well as the lower length scale. These novel data-driven approaches are illustrated using several case studies. As a special application, the development of a spectral database approach for speeding up crystal plasticity computations is also described.

  • Extraction of Process-Structure Evolution Linkages from X-ray Scattering Measurements Using Dimensionality Reduction and Time Series Analysis
    Integrating Materials and Manufacturing Innovation, 2017
    Co-Authors: David B. Brough, Abhiram Kannan, Benjamin Haaland, David G. Bucknall, Surya R Kalidindi
    Abstract:

    The rapid development of robust, reliable, and reduced-order Process-Structure evolution linkages that take into account hierarchical Structure are essential to expedite the development and manufacturing of new materials. Towards this end, this paper lays a theoretical framework that injects the established time series analysis into the recently developed materials knowledge systems (MKS) framework. This new framework is first presented and then demonstrated on an ensemble dataset obtained using small-angle X-ray scattering on semi-crystalline linear low density polyethylene films from a synchrotron X-ray scattering experiment.

  • Process-Structure Linkages Using a Data Science Approach: Application to Simulated Additive Manufacturing Data
    Integrating Materials and Manufacturing Innovation, 2017
    Co-Authors: Evdokia Popova, Theron M. Rodgers, Xinyi Gong, Jonathan D. Madison, Ahmet Cecen, Surya R Kalidindi
    Abstract:

    A novel data science workflow is developed and demonstrated to extract Process-Structure linkages (i.e., reduced-order model) for microStructure evolution problems when the final microStructure depends on (simulation or experimental) Processing parameters. This workflow consists of four main steps: data pre-Processing, microStructure quantification, dimensionality reduction, and extraction/validation of Process-Structure linkages. Methods that can be employed within each step vary based on the type and amount of available data. In this paper, this data-driven workflow is applied to a set of synthetic additive manufacturing microStructures obtained using the Potts-kinetic Monte Carlo (kMC) approach. Additive manufacturing techniques inherently produce complex microStructures that can vary significantly with Processing conditions. Using the developed workflow, a low-dimensional data-driven model was established to correlate Process parameters with the predicted final microStructure. Additionally, the modular workflows developed and presented in this work facilitate easy dissemination and curation by the broader community.

  • development of high throughput assays for establishing Process Structure property linkages in multiphase polycrystalline metals application to dual phase steels
    Acta Materialia, 2017
    Co-Authors: Ali Khosravani, Ahmet Cecen, Surya R Kalidindi
    Abstract:

    Abstract Process-Structure-property (PSP) linkages are central to the development and deployment of advanced materials in emerging technologies. Conventional approaches for establishing these are generally highly customized, qualitative, and demand major investments of time and effort. In this paper, we formulate novel, data-driven, high throughput, assays for exploring PSP linkages in structural metals. These assays are built on recent advances in low-dimensional quantification of material Structure using spatial correlations and principal component analyses, as well as in the mechanical characterization using spherical nanoindentation. These novel protocols are demonstrated on a dual phase (DP) steel that exhibits rich multiphase polycrystalline microStructures.