Synchronization Process

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 32703 Experts worldwide ranked by ideXlab platform

Gabriele Taentzer - One of the best experts on this subject based on the ideXlab platform.

  • Avoiding unnecessary information loss: correct and efficient model Synchronization based on triple graph grammars
    International Journal on Software Tools for Technology Transfer, 2020
    Co-Authors: Lars Fritsche, Jens Kosiol, Andy Schürr, Gabriele Taentzer
    Abstract:

    Model Synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple graph grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models. These rules can be used to automatically derive further rules, which describe how to propagate changes from one model to the other or how to change one model in such a way that propagation is guaranteed to be possible. Restricting model Synchronization to these derived rules, however, may lead to unnecessary deletion and recreation of model elements during change propagation. This is inefficient and may cause unnecessary information loss, i.e., when deleted elements contain information that is not represented in the second model, this information cannot be recovered easily. Short-cut rules have recently been developed to avoid unnecessary information loss by reusing existing model elements. In this paper, we show how to automatically derive (short-cut) repair rules from short-cut rules to propagate changes such that information loss is avoided and model Synchronization is accelerated. The key ingredients of our rule-based model Synchronization Process are these repair rules and an incremental pattern matcher informing about suitable applications of them. We prove the termination and the correctness of this Synchronization Process and discuss its completeness. As a proof of concept, we have implemented this Synchronization Process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality. Our evaluation shows that repair Processes based on (short-cut) repair rules have considerably decreased information loss and improved performance compared to former model Synchronization Processes based on TGGs.

Paul Woafo - One of the best experts on this subject based on the ideXlab platform.

Lars Fritsche - One of the best experts on this subject based on the ideXlab platform.

  • Avoiding unnecessary information loss: correct and efficient model Synchronization based on triple graph grammars
    International Journal on Software Tools for Technology Transfer, 2020
    Co-Authors: Lars Fritsche, Jens Kosiol, Andy Schürr, Gabriele Taentzer
    Abstract:

    Model Synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple graph grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models. These rules can be used to automatically derive further rules, which describe how to propagate changes from one model to the other or how to change one model in such a way that propagation is guaranteed to be possible. Restricting model Synchronization to these derived rules, however, may lead to unnecessary deletion and recreation of model elements during change propagation. This is inefficient and may cause unnecessary information loss, i.e., when deleted elements contain information that is not represented in the second model, this information cannot be recovered easily. Short-cut rules have recently been developed to avoid unnecessary information loss by reusing existing model elements. In this paper, we show how to automatically derive (short-cut) repair rules from short-cut rules to propagate changes such that information loss is avoided and model Synchronization is accelerated. The key ingredients of our rule-based model Synchronization Process are these repair rules and an incremental pattern matcher informing about suitable applications of them. We prove the termination and the correctness of this Synchronization Process and discuss its completeness. As a proof of concept, we have implemented this Synchronization Process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality. Our evaluation shows that repair Processes based on (short-cut) repair rules have considerably decreased information loss and improved performance compared to former model Synchronization Processes based on TGGs.

Sandip Roy - One of the best experts on this subject based on the ideXlab platform.

  • vulnerability of network Synchronization Processes a minimum energy perspective
    IEEE Transactions on Automatic Control, 2016
    Co-Authors: Rahul Dhal, Sandip Roy
    Abstract:

    We study the vulnerability of a linear network Synchronization Process to intrusion at a single network component, from a graph-theoretic perspective. Specifically, we model the intruder as seeking to move the state of the Synchronization Process to an undesirable value or set via a local actuation. We measure the network vulnerability in terms of the minimum or expected minimum actuation energy required of the adversary to achieve the goal, which is related to the inverse of the controllability Gramian for the Process and statistics defined thereof (e.g., its trace and determinant). Using explicit formulas for the Gramian inverse and its associated statistics together with algebraic graph-theory concepts, we then develop structural and graph-theoretic characterizations of the energy-based vulnerability measures.

  • CDC - Vulnerability of continuous-time network Synchronization Processes: A minimum energy perspective
    52nd IEEE Conference on Decision and Control, 2013
    Co-Authors: Rahul Dhal, Sandip Roy
    Abstract:

    We characterize the vulnerability of a linear network Synchronization Process to intrusion by an adversary that can actuate a single network component. Specifically, we model the intruder as seeking to move the state of the Synchronization Process to an undesirable value or set (which may or may not be known to system operators) via a local actuation. We evaluate the network vulnerability in terms of the whether or not the intruder can achieve its goal, and also the minimum actuation energy (or expected minimum energy, if the goal is unknown) required of the adversary to achieve the goal. We formalize that the required energy is related to the inverse of the controllability Gramian for the Process, and statistics defined thereof (e.g., its trace and determinant). We then obtain explicit formulas for the Gramian inverse and its associated statistics. These explicit formulae yield interesting structural and graph-theoretic characterizations of the energy-based vulnerability measures.

Roberto André Kraenkel - One of the best experts on this subject based on the ideXlab platform.

  • Synchronization: stability and duration time.
    Physical review. E Statistical nonlinear and soft matter physics, 2002
    Co-Authors: Paul Woafo, Roberto André Kraenkel
    Abstract:

    We consider the problem of stability and duration of the Synchronization Process between self-excited oscillators, both in their regular and chaotic states. Making use of the properties of Hill equation describing the deviation between the slave and the master, we derive the stability conditions and expressions of the Synchronization time. A fairly good agreement is obtained between the analytical and numerical results.

Related terms

Synchronization Process - 15 days free trial to Access Experts & Abstracts