Korff, M. (1996). Generalized graph structure grammars with applications to concurrent object-oriented systems. PhD thesis, TU Berlin.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for modeling attributed structures, where the attribute space is dependent on the attributed object itself. This ideas have been influenced and motivated by comma categories and their use for the attribution of graphs [Schied, 1992] as well as by the work on generalized graph structures by Korff [Korff, 1996]. We relate our approach to these other categorical ones at the end of this subsection. A so called supplement category is constructed from two given categories CAT1 and CAT2 using families of functors F and G. Category CAT1 is the base category. In our specific application it is intended to be ....

....attributed structure and attribution. This continues in the notion of a morphism and leads to a result where in contrast to comma categories a pushout in a category with dependent attribute space is not necessarily a pushout on the attributes. Generalized graph structures have been introduced in [Korff, 1996] to deal with complex attributions. But in contrast to our approach graphical structuring operations (such as the source and target operations for edges) and attributions are dealt equally. This leads to a splitting of the graphical representation, which cannot be used for the generation of ....

Korff, M. (1996). Generalized graph structure grammars with applications to concurrent object-oriented systems. PhD thesis, TU Berlin.

....of static and dynamic aspects. This goes much further than an integration which is restricted to names of operations. Nevertheless, it shall be noted that graph transformations in its pure form are not object oriented. There are, however, class based extensions of graph transformations (see e.g. Kor96,Tae96] 3 reference model view1 rename embed embed embed embed rename view2 system model define views integrate views integrate views rename rename Figure 1: A view oriented approach to system modelling. This paper extends typed graph transformation systems by the definition of ....

M. Korff. Generalized graph structure grammars with applications to concurrent objectoriented systems. PhD thesis, TU Berlin, 1996.

.... in high level replacement (HLR) systems (mainly in the DPO approach [23] see [42] for corresponding concepts in the SPO approach) The SPO approach has been developed for graph structures from the very beginning [43,5] which have recently been extended to generalized graph structures in [44]. 3 Graph Transformation Based on the DPO Construction Following the outline of Section 2.1, in this section we introduce the formal definition of the very basic concepts of the double pushout approach to graph transformation. This theory has been started in [1] comprehensive tutorials can be ....

M. Korff. Generalized graph structure grammars with applications to object-oriented systems. PhD thesis, Technical University of Berlin, 1995.

....of the old algorithms were released. Low93b] already presents a description of an algorithm for pushouts in graph structures. But this algorithm is very complex and hard to implement. The first ideas how colimit computations in graph structures may be modularised were shown by M. Korff in [Kor96] They had some influence on the theory presented here, but this work is at a much higher level of abstraction and has no relation to a concrete implementation. In contrast to the related developments we present an object oriented library for arbitrary colimits for signatures and graph ....

....hints, comments and corrections. Thanks to Sebastian Erdmann, Michael Rudolf and Claudia Ermel for their cooperation integrating the colimit library into their software projects. Finally I thank Martin Grosse Rhode for proof reading parts of this thesis and his numerous suggestions. 4 [Low93a, Kor96] restrict their cocompletess proofs to hierarchical graph structures. Since this constraint has negative consequences for practical applications, we generalise the proof for arbitrary graph structures. 2 Theoretical Foundations After a brief introduction in category theory we will present the ....

[Article contains additional citation context not shown here]

M. Korff. Generalized Graph Structure Grammars with Applications to Concurrent Object-Oriented Systems. PhD thesis, TU Berlin, 1996.

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