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 5 of 5 for “"graph grammars"”.

  1. 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 …

    uiuc Repository record for Specification of concurrent systems using graph grammars (opens in a new tab)

  2. Robot Graph Grammars: Towards Custom Robots for Every Task

    … topologies they can explore, however. Current graph-based robot representations can expand the space of possible designs, but it is not always clear how the resulting designs can be fabricated. To enable efficient design exploration and ensure fabricability, we propose graph grammars as a …

    mit Repository record for Robot Graph Grammars: Towards Custom Robots for Every Task (opens in a new tab)

  3. 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 …

    uiuc Repository record for A graph grammar approach to concurrent programming (opens in a new tab)

  4. 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 …

    texas Repository record for Assembly sequencing through graph reasoning : graph grammar rules for assembly planning (opens in a new tab)

  5. Design of genetic regulatory networks

    … by preferential attachment and generative graph grammars, we present new generative models that can incorporate both growth processes and “if-then"" statement rules. These generative models are used as an abstract design representation of genetic regulatory networks. Genetic algorithms …

    uiuc Repository record for Design of genetic regulatory networks (opens in a new tab)