Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of variables, conventional (or object) constraints and connecting arrows, such that the graph and the variable assignments not only satisfy the conventional constraints (such as an Action Resource Constraint) but also the structural constraints. The formalism is based on algebraic graph grammars [Rozenberg 1997]. Figure 5 shows an example of a structural constraint that checks if every Action Task is linked to an Action Resource Constraint with the same ResourceType variable. This prevents invalid Action Task assignments, e.g. the Action Task of walking being scheduled by the Action Resource ....

Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.

....left hand side represents the message or signal received by one component, and the right hand side represents the reaction to this message. As reactive systems are naturally parallel (all components may evolve independently) specification methods that allows for parallelism, like graph grammars [Ehr79, Roz97], are better suited for them. The basic idea of graph grammars for the specification of concurrent systems is to use graphs to represent a (possibly distributed) state, and rules to represent the state changes. Parallelism is described by the parallel application of rules to a graph representing ....

G. Rozenberg (ed.) The handbook of graph grammars, volume 1: Foundations. World Scientific, 1997. 4

....of variables, conventional (or object) constraints and connecting arrows, such that the graph and the variable assignments not only satisfy the conventional constraints (such as an Action Resource Constraint) but also the structural constraints. The formalism is based on algebraic graph grammars [Rozenberg 1997]. Figure 4 shows an example of a structural constraint that checks if every Action Task is linked to an Action Resource Constraint with the same ResourceType variable. This prevents invalid Action Task assignments, e.g. the Action Task of walking being scheduled by the Action Resource ....

Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.

....projection. Structural Constraint Satisfaction This section describes the concept of structural constraint satisfaction. For a more detailed presentation, please refer to (Nareyek 1999a) and (Nareyek 1999b) The concept is based on algebraic graph grammars (Ehrig, Pfender Schneider 1973; Rozenberg 1997). A structural constraint satisfaction problem can be used to overcome the deficiencies of conventional CSPs with respect to structural variety. In an SCSP, the constraint graph is not explicitly given. Only the types of constraints (together with their possible connections) and structural ....

Rozenberg, G. ed. 1997. The Handbook of Graph Grammars.

....is generically produced using the problem definition. Structural constraints allow to formulate restrictions on admissible constraint graphs. 2.1 Graph Grammars This section provides a more or less informal introduction in algebraic graph grammars. Please have a look at [ Ehrig et al. 1973; Rozenberg et al. 1997; Habel et al. 1996 ] for a detailed overview. Algebraic graph grammars are a generalization of Chomsky grammars. A graph signature GSig consists of the sorts of vertices V , edges E, and a label alphabet L. The operations of GSig provide source and target vertices for every edge, s; t : E V , ....

G. Rozenberg (ed.). The Handbook of Graph Grammars. Volume I: Foundations, Reading, 1997. World Scientific.

....graph grammar, which is generically produced using the problem definition. Structural constraints allow us to formulate restrictions on admissible constraint graphs. 2. 1 Graph Grammars This section gives a fairly informal introduction to algebraic graph grammars (see [ Ehrig et al. 1973; Rozenberg et al. 1997; Habel et al. 1996 ] for a detailed overview) Algebraic graph grammars are a generalization of Chomsky grammars. A graph signature GSig consists of the sorts of vertices V , edges E, and a label alphabet L. The operations of GSig provide source and target vertices for every edge, s; t : E V ....

G. Rozenberg (ed.). The Handbook of Graph Grammars. Volume I: Foundations, Reading, 1997. World Scientific.

....rule to apply and where to apply it on the graph are similar to conventional CSPs variable and valueordering decisions. Graph Grammars This section provides a fairly informal introduction to algebraic graph grammars (see (Ehrig, Pfender Schneider 1973; Habel, Heckel Taentzer 1996; Rozenberg 1997) for a detailed overview) Algebraic graph grammars are a generalization of Chomsky grammars. A graph signature GSig consists of the sorts of vertices V , edges E, and a label alphabet L. The operations of GSig provide source and target vertices for every edge, s; t : E V , and map a label to ....

Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.

....on graph grammars at the end of the 60 s, a rich variety of theoretical approaches have been developed, including, e.g. NLC grammars, algebraic approaches, hyperedge replacement, and logic based approaches. An excellent survey of the current state of the art is given in a recent handbook [32]. However, there is wide discrepancy between theory and practice of graph rewriting. Rather than operating in paper and pencil mode , we are using a full fledged development environment which is based on a sophisticated language and supports rapid prototyping. The family of development ....

G. Rozenberg et al. Handbook on Graph Grammars, volume 1. World Scientific, Singapore, 1996.

....: E V , and map a label to every vertex and edge, l v : V L and l e : E L. A variable of the CSP is represented by a vertex with the label Variable. It is graphically depicted by a circular vertex ( Constraints could be represented by 1 For details on graph grammars languages refer to (Rozenberg 1997). edges, but there are constraint types that allow a variable number of variables to be included. These constraint types will be called extensible constraints (C e ) in contrast to non extensible constraints (Cn ) such that C e [ Cn = C. As the number of variables incorporated for extensible ....

Rozenberg, G. ed. 1997. The Handbook of Graph Grammars. Volume I: Foundations. Reading, World Scientific.

No context found.

G. Rozenberg, editor. The Handbook of Graph Grammars, volume 3. World Scientific, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC