*banner
 

Model Transformation with Hierarchical Discrete-Event Control
Thomas Huining Feng

Citation
Thomas Huining Feng. "Model Transformation with Hierarchical Discrete-Event Control". Talk or presentation, 6, May, 2009; Dissertation Talk.

Abstract
A flexible and efficient model transformation technique is developed in this work.

A basic transformation is defined with a transformation rule, which describes the relationship between an input model and the result of the transformation. The syntax for transformation rules is close to the modeling language that designers use to build the input models. The semantics is defined based on graph transformation theory.

A transformation workflow consists of basic transformations controlled in a control language. Existing control languages include state machines and variants of dataflow diagrams. Realizing their limitation in expressiveness and efficiency, we create the Ptera (Ptolemy event relationship actor) model of computation based on event graphs. Ptera is shown to be an appropriate control language for transformation workflows. It allows transformation tasks to be composed hierarchically. The event queue and the notion of model time enables scheduling of future tasks. The use of a local variable to represent the model under transformation eliminates the overhead caused by communication with transient data packages.

Electronic downloads

Citation formats  
  • HTML
    Thomas Huining Feng. <a
    href="http://chess.eecs.berkeley.edu/pubs/583.html"
    ><i>Model Transformation with Hierarchical
    Discrete-Event Control</i></a>, Talk or
    presentation,  6, May, 2009; Dissertation Talk.
  • Plain text
    Thomas Huining Feng. "Model Transformation with
    Hierarchical Discrete-Event Control". Talk or
    presentation,  6, May, 2009; Dissertation Talk.
  • BibTeX
    @presentation{Feng09_ModelTransformationWithHierarchicalDiscreteEventControl,
        author = {Thomas Huining Feng},
        title = {Model Transformation with Hierarchical
                  Discrete-Event Control},
        day = {6},
        month = {May},
        year = {2009},
        note = {Dissertation Talk},
        abstract = {A flexible and efficient model transformation
                  technique is developed in this work. <p> A basic
                  transformation is defined with a transformation
                  rule, which describes the relationship between an
                  input model and the result of the transformation.
                  The syntax for transformation rules is close to
                  the modeling language that designers use to build
                  the input models. The semantics is defined based
                  on graph transformation theory. <p> A
                  transformation workflow consists of basic
                  transformations controlled in a control language.
                  Existing control languages include state machines
                  and variants of dataflow diagrams. Realizing their
                  limitation in expressiveness and efficiency, we
                  create the Ptera (Ptolemy event relationship
                  actor) model of computation based on event graphs.
                  Ptera is shown to be an appropriate control
                  language for transformation workflows. It allows
                  transformation tasks to be composed
                  hierarchically. The event queue and the notion of
                  model time enables scheduling of future tasks. The
                  use of a local variable to represent the model
                  under transformation eliminates the overhead
                  caused by communication with transient data
                  packages.},
        URL = {http://chess.eecs.berkeley.edu/pubs/583.html}
    }
    

Posted by Thomas Huining Feng on 6 May 2009.
Groups: ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

You are not logged in 
©2002-2014 Chess