Filters








21,991 Hits in 3.0 sec

Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions

Hartmut Ehrig, Frank Hermann, Christoph Sartorius
2009 Electronic Communications of the EASST  
Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars.  ...  As a first main result we can extend the composition/decomposition result for triple graph grammars to the case with NACs.  ...  Triple Graph Grammars with NACs Many model transformations use the concept of negative application conditions (NACs) introduced in [HHT96] .  ... 
doi:10.14279/tuj.eceasst.18.270 dblp:journals/eceasst/EhrigHS09 fatcat:jsscgfifgfh4pdhelmpxy6hfqy

Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions (Long Version) [article]

Hartmut Ehrig, Frank Hermann, Christoph Sartorius, Technische Universität Berlin, Technische Universität Berlin
2020
Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars.  ...  As a first main result we can extend the composition/decomposition result for triple graph grammars to the case with NACs.  ...  Triple Graph Grammars with NACs Many model transformations use the concept of negative application conditions (NACs) introduced in [8] .  ... 
doi:10.14279/depositonce-10255 fatcat:a4cqgbj55vg2lfvvu22sgtvppq

On the expressive power of algebraic graph grammars with application conditions [chapter]

Annika Wagner
1995 Lecture Notes in Computer Science  
Introducing negative application conditions makes the formalism more powerful. Graph grammars over rules with conditional application conditions are on top of the hierarchy.  ...  Using a graph grammar notion without nonterminal graphs, i.e. each derivation step leads to a graph of the generated language, we prove a hierarchy: graph grammars over rules with positive application  ...  First we show that for each graph grammar over rules with negative application conditions there exists a graph grammar over rules with conditional application conditions which generates the same language  ... 
doi:10.1007/3-540-59293-8_210 fatcat:nbwuq4sxuvd7nikhednjpd3s4m

AGG: A Graph Transformation Environment for Modeling and Validation of Software [chapter]

Gabriele Taentzer
2004 Lecture Notes in Computer Science  
evolution of software, and the definition of visual languages based on graph grammars.  ...  AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression.  ...  The formal basis for graph grammars with negative application conditions (NACs) was introduced in [8] .  ... 
doi:10.1007/978-3-540-25959-6_35 fatcat:xxbpcrlcongwfpwg3scjkzjdi4

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems [chapter]

Paolo Baldan, Barbara König, Ingo Stürmer
2004 Lecture Notes in Computer Science  
Since the representation of code generators in terms of graph grammars typically makes use of rules with negative application conditions, the unfolding approach is extended to deal with this feature.  ...  This is done by formalising the behaviour of a code generator by means of graph transformation rules and exploiting unfolding-based techniques.  ...  The unfolding of a graph grammar with negative application conditions is defined as a Petri graph [5] , i.e., a graph with a Petri net "over it", using the edges of the graph as places.  ... 
doi:10.1007/978-3-540-30203-2_15 fatcat:fkiz5g2pebduzetj364is3dbda

Defining Models - Meta Models versus Graph Grammars

Berthold Hoffmann, Mark Minas
2010 Electronic Communications of the EASST  
Metamodelling and graph grammars are apparent choices for such specifications.  ...  This is demonstrated by defining program graphs, a language-independent model of object-oriented programs, with a focus on shape (static structure) rather than behavior.  ...  A further extension, by positive and negative application conditions, extended their power, however with rather complicated rules [Hof10] .  ... 
doi:10.14279/tuj.eceasst.29.411 dblp:journals/eceasst/HoffmannM10 fatcat:64uvaxjerjgszieifdngvs2g5e

Page 3875 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
grammars with negative application conditions.  ...  The authors show that context-free graph grammars with application conditions are more powerful than those without these conditions, besides investigating other problems such as local confluence and the  ... 

Conditional Adaptive Star Grammars

Berthold Hoffmann
2010 Electronic Communications of the EASST  
It turns out that conditional adaptive star grammars are powerful enough to generate program graphs, a software model with rather complicated contextual properties.  ...  So we extend adaptive star rules by positive and negative application conditions to overcome these deficiencies without sacrificing parsing algorithms.  ...  So we extend adaptive star grammars further, by rules with positive and negative application conditions, in Section 5.  ... 
doi:10.14279/tuj.eceasst.26.349 dblp:journals/eceasst/Hoffmann10 fatcat:vjmhmcnn7ngtnotuc4eejh7rja

A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams

Frank Hermann, Hartmut Ehrig, Gabriele Taentzer
2008 Electronical Notes in Theoretical Computer Science  
and application conditions.  ...  The graph grammar is validated by well-established benchmarks showing that all important features of the MOF definition of UML are covered.  ...  Application conditions in positive, negative, and general form restrict the application of a rule to graphs, which either have to contain a demanded pattern or are not allowed to.  ... 
doi:10.1016/j.entcs.2008.04.048 fatcat:qqp25ynv4jblfjk5qacby4rpp4

Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars

Jessica Winkelmann, Gabriele Taentzer, Karsten Ehrig, Jochen M. Küster
2008 Electronical Notes in Theoretical Computer Science  
In our approach, an instance-generating graph grammar is automatically created from a given meta model.  ...  This graph grammar ensures correct typing and cardinality constraints, but OCL constraints for the meta model are not supported yet.  ...  project "Application of graph transformation to visual modeling languages".  ... 
doi:10.1016/j.entcs.2008.04.038 fatcat:hdauvydf7fcyvkmwz2kgidxkjy

Improving design grammar development and application through network-based analysis of transition graphs

Corinna Königseder, Tino Stanković, Kristina Shea
2016 Design Science  
In this paper, a novel method is presented that supports the development and application of design grammars using transition graphs.  ...  Rather than using a tree structure to represent the possible application of rules, transition graphs are automatically generated and used to help designers better understand the developed grammar.  ...  Figure 9 shows the transition graphs for rule sequences with two rules using negative application conditions (Figure 9 , top) and positive application conditions (Figure 9 , bottom) for the LHS matching  ... 
doi:10.1017/dsj.2016.5 fatcat:4gpq34b67vgpnapyeoctttsu6a

A Graph Grammar to Transform a Dataflow Graph into a Multithread Graph and its Application in Task Scheduling

Cícero Augusto de S. Camargo, Simone André da Costa Cavalheiro, Luciana Foss, Gerson Geraldo H. Cavalheiro
2013 Revista de Informática Teórica e Aplicada  
A graph grammar has been developed to perform the proposed transformation and case studies using DAGs found in the literature validate the transformation process.  ...  The Dominant Sequence Clustering (DSC) [9] also presents optimal performance considering special classes of applications.  ...  Definition 12 [Conditional productions and typed attributed graph grammar] A typed attributed graph production with application and negative application conditions, or simply A Graph Grammar to Transform  ... 
doi:10.22456/2175-2745.25210 fatcat:lsfdkyc5krgexhvzjlng3tz2km

Termination Criteria for Model Transformation [chapter]

Hartmut Ehrig, Karsten Ehrig, Juan de Lara, Gabriele Taentzer, Dániel Varró, Szilvia Varró-Gyapay
2005 Lecture Notes in Computer Science  
In this work, we show termination criteria for model transformation based on graph transformation.  ...  Previous results on graph transformation are extended by proving the termination of a transformation if the rules applied meet certain criteria.  ...  Although termination is undecidable for graph grammars in general [21] , in this paper we show that if graph grammars with negative application conditions (see [14] ) meet suitable termination criteria  ... 
doi:10.1007/978-3-540-31984-9_5 fatcat:xxbfmr2x4fdy7ij3wxs7elboae

Instance Generation from Type Graphs with Arbitrary Multiplicities

Gabriele Taentzer
2012 Electronic Communications of the EASST  
In this paper, we formalize a restricted form of meta-models by type graphs with multiplicities and introduce instance-generating graph grammars for creating instance graphs representing the abstract syntax  ...  This disadvantage poses a severe limitation on certain applications.  ...  For controlling a rule application, simple negative application conditions and atomic application conditions are defined which are needed in Section 4.  ... 
doi:10.14279/tuj.eceasst.47.727 dblp:journals/eceasst/Taentzer12 fatcat:dttu6yxnmbf5nos7zdqccnglli

Constructing VEGGIE: Machine Learning for Context-Sensitive Graph Grammars

Keven Ates, Kang Zhang
2007 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007)  
The system is extended with novel work to infer contextsensitive graph grammars.  ...  Using existing technologies for graph grammars, a tool for the construction and parsing of context-sensitive graph grammars is combined with a tool for inducing context-free graph grammars.  ...  It also performs as a supervised machine learner with the specification of a negative graph dataset.  ... 
doi:10.1109/ictai.2007.59 dblp:conf/ictai/AtesZ07 fatcat:hxb5d4a2hzcwlpiy3lumlnsbm4
« Previous Showing results 1 — 15 out of 21,991 results