Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 28 for “"Graph grammars"”.
-
Regular Rooted Graph Grammars
… erkauft. Eine Typsprache zur Typisierung von Graph-strukturierten Daten im Web wird eingeführt. Modellierbare Graphen sind so genannte gewurzelte Graphen, welche aus einem Spannbaum und Querreferenzen aufgebaut sind. Die Typsprache basiert auf reguläre Baum Grammatiken, welche um typisierte …
-
Object-oriented graph grammars
Esta tese apresenta um modelo conceitual para modelagem e vericação de espe- cificações de sistemas orientados a objeto. Mais especificiamente, uma extensão da abordagem algébrica baseada em single-pushouts para gramáticas de grafos tipadas é desenvolvida, onde os morfismos de tipagem são …
-
Relational approach of graph grammars
Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes tipos de relações entre eles) e cujo comportamento é essencialmente orientado pelos dados, isto é, eventos são disparados por …
-
Module integration using graph grammars (MIGRATE)
… such as testing and versioning. We studied graph grammars to find a set of grammars (verification grammars) that represent how software modules integrate and leveraged existing graph grammar analysis, specifically critical pair analysis, to point out possible integration problems in such …
-
Occurrence graph grammars with negative application conditions
Graph Grammars are based on the application of rules that are able to modify graphs, as such, they provide a suitable formalism to model complex systems in an intuitive and precise manner, providing both a graphical language and a solid formal background for systems analysis. Therefore, they have …
-
Specification of concurrent systems using graph grammars
Existing textual programming languages support sequential programming well because there is a correlation between the one-dimensional nature of text and the one-dimensional nature of sequential programs, i.e. the single flow of control in a program. Textual notation does not support concurrent …
-
3D reconfiguration using graph grammars for modular robotics
… any pre-specified target configuration by using graph grammar rules that rely on local information only. Local in a sense that each module needs just information from neighboring modules in order to decide its next reconfiguration step. The advantage of this approach is that the modules do not …
-
Automated synthesis of fabrication sequence of MEMS components using graph grammars
The design of any MEMS component is subject to stringent manufacturing constraints. The knowledge about these constraints seems to be available to designers who have experienced the complexities of MEMS fabrication. In this thesis, we put forth the idea of automatically generating a fabrication …
-
Evolution of negative application conditions on second-order graph rewriting
Graph grammars are a suitable formalism to modeling computational systems. This formalism is based on rules and data-driven transformations capable of simulating real systems, rules have application conditions and post conditions that can change the system state. Moreover the use of graphs allows …
-
A graph grammar approach to concurrent programming
We propose the use of graph grammars as a theory to organize programming of highly-concurrent systems. To understand the interactions among components of a concurrent system it is useful to visualize the system as dynamically changing graphs where the nodes represent concurrent components and the …
-
Assembly sequencing through graph reasoning : graph grammar rules for assembly planning
… to automating assembly planning utilizing graph grammars. Computational geometric reasoning is used to produce a label rich graph from a CAD model. This graph is then modified by graph grammar rules to produce candidate assembly sequences which are run in conjunction with a tree search …
-
Rewriting context-free families of string diagrams
<p>String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, which is the standard way of reasoning about the morphisms of monoidal categories, rewriting string diagrams results in …
-
Using domain specific languages to capture design knowledge for model-based systems engineering
… for synthesizing hydraulic systems using graph grammars to generate system topologies. Also, a method using graph grammars for generating analysis models from the described structural system representations is presented. This approach fits in the context of Model-Based Systems Engineering …
-
Analysis of Generative Chemistries
… of chemistry we use undirected, labelled graphs as explicit models of molecules and graph transformation rules for modelling generalised chemical reactions. This is used to define artificial chemistries on the level of individual bonds and atoms, where formal graph grammars implicitly …
-
A graph grammar scheme for representing and evaluating planar mechanisms
… process that includes existence of similar graph grammar approaches. But few methods replicate the way humans’ design. An attempt is being made in the thesis in this direction and as a first step, we focus on representing and evaluating planar mechanisms designed using graph grammars. Graph …
-
Automated analysis of product disassembly to determine environmental impact
… as it is taken apart. This project suggests a graph-based method of representing product assemblies. Unlike many existing representation methods which are used in the field of automated disassembly, the method proposed here takes component connection methods into account. This, combined with a …
-
Visual programming for transputer systems
… in which programs are constructed using graphical representations, have much to offer concurrency. This thesis reports on work performed during the development of the visual programming language, GILT (Graphical Language for Transputers). GILT uses a mixed text-graphics paradigm to aid …
-
Random Graph Generation in Hyperedge Replacement Languages
… a novel approach for the random generation of graphs in context-free hypergraph languages. It is obtained by adapting both of Mairson's generation algorithms for context-free string grammars to the setting of hyperedge replacement grammars. It provides a concrete instrument for the generation …
-
Dependency graph-based statistical machine translation
… and trees. In this thesis, we build dependency graphs which are constructed from dependency trees and uniformly represent both dependency relations and sequential relations, including bigram relations and sibling relations. We propose translation models to translate these graphs into target …
Page 1 of 2