Michael Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Master's thesis, Technical University of Berlin, FB 13, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a visual specification is a sentence of the GENGED language consisting of all visual specifications which can be derived by the GENGEDrules. The manipulation of GENGED sentences, i.e. the visual specification of visual languages, is supported by the integrated graph transformation machine AGG ([11, 16]) together with the graphical constraint solver PARCON ( 9] AGG is responsible for the logical structure of a visual specification, i.e. the graph structure, and PARCON manages the visual structure the user works with. The paper is organized as follows: Section 2 treats our running example ....

....for rule application The RuleManager is the main component of the rule editor. It is the component responsible for all rules, i.e. for the generated alphabet rules and for the VL rules. Furthermore, this component supports on the logical level the application of rules by graph transformation (cf. [11, 16]) as well as it supports on the visual level graphical constraint solving (cf. 9] The RuleBuilder consists of two working graphs, one for the left hand side of a VL rule and one for the righthand side. Both sides can be edited. If a VL rule is complete the components of both sides must be ....

[Article contains additional citation context not shown here]

M. Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Diplomarbeit, FB 13, Technische Universitat Berlin, 1998.

....items of both sides. i.e. the RuleBuilder consists of two working graphs, one for the lhs and one for the rhs of a VL rule. It supports the application of one rule visualized by the RuleViewer in both sides. The application of rules is based on graph transformation implemented by the AGG system ( Rud97,TER99] and graphical constraint solving (cf. Section 4.3) This implies that each part of a VL rule is an algebra wrt. VISUALSPEC in all actual working states. Rule Manager. The RuleManager is the main component of the grammar editor. It is responsible for all rules, i.e. for the alphabet rules ....

....in all actual working states. Rule Manager. The RuleManager is the main component of the grammar editor. It is responsible for all rules, i.e. for the alphabet rules and for the VL rules. Especially, the rule manager generates the alphabet rules from the VL alphabet. AGG. The AGG system (cf. Rud97,TER99] supports the graph transformation on the logical level of each algebra. The transformation is done using the single pushout (SPO) approach as described in [EHK 97] Constraint Handling and Constraint Solver. These components are already discussed in Section 3. Using the grammar ....

[Article contains additional citation context not shown here]

M. Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Diplomarbeit, Informatik, TU Berlin, 1997.

....builder by itself consists of two working graphs, one for the lhs and one for the rhs of a VL rule. It supports the application of one rule visualized in the rule viewer in both sides. The application of rules is based on graph transformation (cf. section 4. 3) implemented by the AGG system (cf. Rud98] This implies that each part of a VL rule is an algebra wrt. VISUALSPEC in all actual working states. ffl The RuleManager is the main component of the rule editor. It is the component responsible for all rules, i.e. for the simple rules and for the VL rules. Especially, the rule manager ....

....in all actual working states. ffl The RuleManager is the main component of the rule editor. It is the component responsible for all rules, i.e. for the simple rules and for the VL rules. Especially, the rule manager generates the simple rules from the VL alphabet. ffl The AGG system (cf. Rud98] supports the graph transformation on the logical level of each algebra. ffl The constraint handling component (cf. section 3) ffl The graphical constraint solver PARCON (cf. section 3) 4.3 Generated Graphic Editor The GRAPHICEDITOR is the aimed editor allowing the manipulation of visual ....

M. Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Diplomarbeit, FB 13, Technische Universitat Berlin, 1998.

....re designing was necessary, with a stress on portability and modularity. Therefore, several system components are being developed simultaneously, communicating through slim, clearly defined interfaces: Graph Basis Graph model: internal graph and rule structures and their organization [Rud96, Rud97] Attribute Component Input, administration and transformation of attributes [Mel97] including application conditions, rule variables and parameters and distribution; Transformation The Colimit library [Wol97] is used for graph transformation. Its correctness implicitly proofs the system s ....

....graph transformation. Its correctness implicitly proofs the system s adherence to the theory of algebraic graph transformation; Application Match Expressed as a Constraint Satisfaction Problem [Pro93, Dec94] the match search keeps the actual algorithm from being bound to a concrete graph model [Rud97] Graphical Environment A graphical user interface (GUI) offering an interactive input of graphs and rules as well as a transformation control environment. The evolving tool offers the possibility of actually applying algebraic graph transformation in formal specifications. The system shall ....

Michael Rudolf. Konzeption und implementierung eines interpreters fur attributierte graphtransformation. Master's thesis, 1997.

....model and its implementation available in the abstract CSP representation. Note that all the ideas and concepts presented in the following sections have been successfully applied in the implementation of the matching subsystem of Agg, a graph transformation system developed at TU Berlin [AGG98, Rud97] which is implemented in Java. 2 Constraint Satisfaction Problems A lot of problems in computer science, most notably in artifical intelligence, can be interpreted as special cases of the constraint satisfaction problem (CSP) Research work in the CSP area is focussed on the theoretical as well ....

....listed in the left column of the table holds for a given pair of variables (x i ; x k ) the corresponding constraint is to be included in R. 4 It can be easily shown that the resulting CSP is equivalent to the original graph matching problem. For a straightforward proof of this proposition, cf. Rud97] 4 Variable Ordering Intelligent Backtracking In this section we give a brief sketch of some basic issues arising when it comes to solve a CSP algorithmically. These are issues well known to the CSP community, which are discussed in more detail in the literature on the subject. We recommend ....

[Article contains additional citation context not shown here]

M. Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Master's thesis, Technical University of Berlin, Dep. of Comp. Sci., 1997. http://tfs.cs.tu-berlin.de/ publikationen/public1997.html.

No context found.

Michael Rudolf. Konzeption und Implementierung eines Interpreters fur attributierte Graphtransformation. Master's thesis, Technical University of Berlin, FB 13, 1997.

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