R. Betschko. Parallele Graphgrammatiken mit Synchronisation. Studienarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computing by Graph Transformation II (COMPUGRAPH II) - Ehrig, (eds.) (1996) (Correct)
....been investigated from the beginning of the algebraic approach to graph grammars The Berlin group continues an intense research activity on parallel and distributed graph grammars. Parallel graph grammars are defined for HLR systems based on the DPO approach [ET92] and are also considered in [Bet92] Distributed SPO derivations are studied in [EL93] Parallel replacement on graphs and high level structures is defined on the DPO approach in [Tae96b] Different types of replacement are compared with each other and also with sequential graph grammars. In [Tae96] synchronous and asynchronous ....
R. Betschko. Parallele Graphgrammatiken mit Synchronisation. Studienarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1992.
Computing by Graph Transformation - A Survey and Annotated.. - Ehrig, (eds.) (1996) (3 citations) (Correct)
....and classified with respect to these conditions. Parallel replacement on graphs and high level structures is defined on the DPO approach in [Tae96] Different types of replacement are compared with each other and also with sequential graph grammars. Parallel graph grammars are also considered in [Bet92] Distributed SPOderivations are studied in [EL93] In [Tae96b] synchronous and asynchronous graph transformations are considered on the basis of distributed transformations in the SPO approach. Some criteria are given there preserve synchrony according to the definition proposed. The ....
R. Betschko. Parallele Graphgrammatiken mit Synchronisation. Studienarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1992.
Amalgamated Graph Transformations and Their Use for.. - Gabriele Taentzer.. (1994) (2 citations) (Correct)
....p i and p j in P being applicable to G. Their occurrences g i and g j can overlap either in the occurrence of their subproduction or their gluing graphs. First g i ffi g ij = g j ffi g ji and the second case does not destroy the applicability, anyway. For the proofs of these two propositions see [Bet92]. The amalgamated graph transformations can be used to describe production sets which have a certain regularity. Using elementary productions for the generation of a production suitable for the given graph large sets of similar productions building a production family can be avoided. See also ....
R. Betschko, Parallele Graphgrammatiken mit Synchronisation, Studienarbeit, Technical University of Berlin, Dep. of Comp. Sci., 1992.
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