31,172 Hits in 3.7 sec

Efficient Modular Graph Transformation Rule Application [article]

Jakob L. Andersen, Rolf Fagerberg, Juri Kolčák, Christophe V.F.P. Laurent, Daniel Merkle, Nikolai Nøjgaard
2022 arXiv   pre-print
In this contribution, we develop a new method of enumerating graph matches during graph transformation rule application.  ...  We further extend the algorithm with an efficient heuristic based on local symmetries of the graphs, which allow us to detect and discard isomorphic applications early.  ...  Conclusion We design a new efficient algorithm for enumerating the matches of graph transformation rules in the application area of chemical reaction networks.  ... 
arXiv:2201.04360v2 fatcat:o2j2ecyl3jdzzfvxlhp3kxsiwm

The Graph Grammar Library - a generic framework for chemical graph rewrite systems [article]

Martin Mann, Heinz Ekker, Christoph Flamm
2013 arXiv   pre-print
Here, molecules are represented as undirected labeled graphs while chemical reactions are described by according graph grammar rules.  ...  Beside the graph transformation, the GGL offers advanced cheminformatics algorithms for instance to estimate energies ofmolecules or aromaticity perception.  ...  with a flexible and efficient rule application framework.  ... 
arXiv:1304.1356v1 fatcat:l25vhtojanhvzktvibfnfkggym

Modularized Constraint Management in Model Transformation Frameworks

2013 Acta Polytechnica Hungarica  
The precise definition of graph rewriting-based model transformation requires that beyond the topology of the rules, further textual constraints be added.  ...  These constraints often appear repetitively in a transformation; therefore, constraint concerns crosscut the transformation.  ...  A set of rewriting rules define a graph transformation system. The applications of these rules are the elementary operations of graphs.  ... 
doi:10.12700/aph.10.01.2013.1.6. fatcat:kdndtvrlp5f4je2lxmd46e3cmu

Constraint projection

Mikio Nakano
1991 Proceedings of the 29th annual meeting on Association for Computational Linguistics -  
Unification of disjunctive feature descriptions is important for efficient unification-based parsing.  ...  Constraint projection is a generalization of constraint unification, and is more efficient because constraint projection has a mechanism for abandoning information irrelevant to a goal specified by a list  ...  Since abandoning irrelevant information makes the resulting structure tighter, another application of phrase structure rules to it will be efficient.  ... 
doi:10.3115/981344.981384 dblp:conf/acl/Nakano91 fatcat:5kmzh4m7cnh5rjnah5peqczx4m

Issues in the practical use of graph rewriting [chapter]

Dorothea Blostein, Hoda Fahmy, Ann Grbavec
1996 Lecture Notes in Computer Science  
Efficiency considerations and the limited availability of development tools further limit practical use of graph rewriting.  ...  Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notation.  ...  Host-graph triggers This method of modularization is proposed for an unordered graph-rewriting system (wherein a host-graph is nondeterministically transformed by a set of graph-rewrite rules, with no  ... 
doi:10.1007/3-540-61228-9_78 fatcat:pgenioqkgbebjk4bpjvhzltham

Page 5263 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
(D-MPI-1; Saarbriicken Modularity of termination in term graph rewriting. (English summary) Rewriting techniques and applications 230-244, Lecture Notes in Comput.  ...  Sci 1996 New Brunswick, NJ, 1996 , 1103, Springer, Berlin Summary: “Term rewriting is generally implemented using graph rewriting for efficiency reasons.  ... 

Modularizing Triple Graph Grammars Using Rule Refinement [chapter]

Anthony Anjorin, Karsten Saller, Malte Lochau, Andy Schürr
2014 Lecture Notes in Computer Science  
Triple Graph Grammars (TGGs) are a formally founded, bidirectional transformation language, which has been used successfully in various case studies from different applications domains.  ...  In this paper, we present and formalize a novel modularity concept for TGGs: Rule refinement, which generalizes existing modularity concepts, solves the problem of pattern duplication, and enables concise  ...  Modularity Concepts for Graph Transformations: There are numerous modularity concepts in the mature field of graph transformation.  ... 
doi:10.1007/978-3-642-54804-8_24 fatcat:fzzfep3onberxcxmp2mo5kym7y

Page 42 of Automation and Remote Control Vol. 54, Issue 6 [page]

1993 Automation and Remote Control  
The present methods of synthesis of modular systems (MSs) can be subdivided into two types: a) methods which, according to some heuristical rules, enable one to design rational MSs and to estimate the  ...  This graph is constructed by “overlapping” technological graphs and is based on the overlap of identical levels of each graph and the identical vertices on each level, which results in an integrated graph  ... 

Automated Termination Proofs with AProVE [chapter]

Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke
2004 Lecture Notes in Computer Science  
In particular, it contains many new improvements of the dependency pair approach that make automated termination proving more powerful and efficient.  ...  For this system, we have developed and implemented efficient algorithms based on classical simplification orders, dependency pairs, and the size-change principle.  ...  DP Graph For TRSs with many rules, (innermost) termination proofs should be performed in a modular way.  ... 
doi:10.1007/978-3-540-25979-4_15 fatcat:kg7bso7vkjezbe4qxfmeilkmpu

Page 6951 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
(English summary) Graph transformations in computer science (Dagstuhl Castle, 1993), 358-379, Lecture Notes in Comput. Sci., 776, Springer, Berlin, 1994.  ...  Almost all methods for proving termination yield, when applicable, simple termination. We show that simple termination is an undecidable property, even for one-rule systems.  ... 

The Graph Grammar Library - A Generic Framework for Chemical Graph Rewrite Systems [chapter]

Martin Mann, Heinz Ekker, Christoph Flamm
2013 Lecture Notes in Computer Science  
Besides the efficient handling of chemical transformation the GGL offers advanced cheminformatics algorithms.  ...  An extensive system of wildcards, degree and adjacency constraints, and negative application conditions (NAC), such as the non-existence of edges, makes it easy to formulate very specific graph transformation  ... 
doi:10.1007/978-3-642-38883-5_5 fatcat:a6njuspuijdknjnsrc7wtyjkom

The esprit basic research working group compugraph "computing by graph transformation": a survey

H. Ehrig, M. Löwe
1993 Theoretical Computer Science  
Especially, high-level rewriting on algebraic specifications has led to a new development, the rule-based design of modular software systems.  ...  Lowe, eds., Computing by graph transformation: overall aims and new results, in: Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, Vol. 532 (Springer, Berlin,  ... 
doi:10.1016/0304-3975(93)90062-x fatcat:ae5x4dsjy5cl5dvnbscakgbxeq

Model transformation in the large

Felix Klar, Alexander Königs, Andy Schürr
2007 Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07  
Current rule-based model transformation approaches as the Query / View / Transformation (QVT) standard or Triple Graph Grammars (TGGs) disregard means for structuring model transformation specifications  ...  As a result large scale model transformation specifications are hard to understand and to maintain.  ...  In order to develop and maintain such systems efficiently developers need appropriate modeling languages that allow for the modularization of the systems into smaller and more manageable subsystems as  ... 
doi:10.1145/1287624.1287664 dblp:conf/sigsoft/KlarKS07 fatcat:akv6pwpfnngqdi4urjfcuathbi

Page 2431 of Mathematical Reviews Vol. , Issue 2004c [page]

2004 Mathematical Reviews  
approach to graph transformation.  ...  Summary: “This paper presents an efficient fully dynamic graph al- gorithm for maintaining the transitive closure of a directed graph.  ... 

Detection of Syntactic Aspect Interaction in UML State Diagrams Using Critical Pair Analysis in Graph Transformation [article]

Zaid Altahat, Tzilla Elrad, Luay Tahat, Nada Almasri
2013 arXiv   pre-print
This identified problem is similar to a phenomenon that exists in graph transformation systems where multiple Graph Transformation rules share some conflicting elements, it is referred to as Critical Pair  ...  The proposed framework transforms Aspects modeled in UML State Diagram to Graph Transformation Rules, and then it applies Critical Pair Analysis to detect unintended interactions among aspects.  ...  P may also have a set of Negative Application Conditions (NAC), which are elements that may not exist for a rule to apply. A GT rule replaces graph L with R in host graph G.  ... 
arXiv:1312.6939v1 fatcat:otbjg7ry3rfodh3qhyvujzp5yu
« Previous Showing results 1 — 15 out of 31,172 results