| R. Heckel, A. Corradini, H. Ehrig, and M. Lowe. Horizontal and Vertical Structuring of Graph Transformation Systems. Mathematical Structures in Computer Science, 6(6):613-- 648, 1996. |
....: OGG GG. Starting from this negative result some possible ways of solving the problem are singled out. Because of space limitations we are forced to defer to the full version the detailed comparison with the related work in the literature, comprising different notions of graph grammar morphisms [6, 12, 17, 4] as well as the unfolding construction for SPO grammars in [17] For the same reason also the proofs of our statements are omitted. 2 Typed graph grammars and their morphisms This section first summarizes the basic definitions about typed graph grammars [8] a variation of classical DPO graph ....
R. Heckel, A. Corradini, H. Ehrig, and M. Lowe. Horizontal and Vertical Structuring of Graph Transformation Systems. Mathematical Structures in Computer Science, 6(6):613-- 648, 1996.
....have been introduced in [33] Structuring Systems usually consists of a number of subsystems, which are specified separately and have some meaning in their own right. Structuring mechanisms for graph transformation systems based on colimits in the category of graph grammars are investigated in [34,35], and are shown to be compatible with the functorial semantics introduced in [36] Analysis A main advantage of formal specification methods is the possibility of formal reasoning about properties of the specified systems. ffl Consistency conditions describe properties of all derived graphs. ....
R. Heckel, A. Corradini, H. Ehrig, and M. Lowe. Horizontal and Vertical Structuring of Graph Transformation Systems. Mathematical Structures in Computer Science, 1996. To appear.
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