BibSonomy publications for /user/minas/GraGraFri Aug 12 22:06:13 CEST 2011ECEASSTSymbolic Attributed Graphs for Attributed Graph Transformation.3020102010 GraGra Fri Aug 12 22:05:48 CEST 2011J. Symb. Comput.3294-315Symbolic graphs for attributed graph constraints.4620112011 GraGra Fri Apr 08 08:29:03 CEST 2011Graph Transformations and Model Driven Enginering -- Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday34-59Lecture Notes in Computer ScienceGraph Transformation by Computational Category Theory576520102010 DiaPlan GraGra myown The categorical approach is well-suited for concise definitions of graph transformation concepts. At the same time, it allows for elegant proofs of their properties. We show that these categorical concepts also allow for a similarly simple and modular implementation of graphs and graph transformations by following first present an implementation of some categorical definitions and constructions, e.g., colimits, in Java, and we demonstrate how this language supports the genericity of the categorical approach. We then show that applying the constructions to the category of sets as well as the category of graphs already provides an implementation of graph transformations that can be used as the foundation of an extensible graph transformation language.Wed Sep 01 09:20:58 CEST 2010Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, CyprusElectronic Communications of the EASSTSpecifying and Generating Editing Environments for Interactive Animated Visual Models2920102010 Animation ConferencePaper DiaGen GraGra myown The behavior of a dynamic system is most easily understood if it is illustrated by a visual model that is animated over time. Graphs are a widely accepted approach for representing such dynamic models in an abstract way. System behavior and, therefore, model behavior corresponds to modifications of its representing graph over time. Graph transformations are an obvious choice for specifying these graph modifications and, hence, model behavior. Existing approaches use a graph to represent the static state of a model whereas modifications of this graph are described by graph transformations that happen instantaneously, but whose durations are stretched over time in order to allow for smooth animations. However, long-running and simultaneous animations of different parts of a model as well as interactions during animations are difficult to specify and realize that way. This paper describes a different approach. A graph does not necessarily represent the static aspect of a model, but rather represents the currently changing model. Graph transformations, when triggered at specific points of time, modify such graphs and thus start, change, or stop animations. Several concurrent animations may simultaneously take place in a model. Graph transformations can easily describe interactions within the model or between user and model, too. This approach has been integrated into the DiaMeta framework that now allows for specifying and generating editing environments for interactive animated visual models. The approach is demonstrated using the game Avalanche where many parallel and interacting movements take place.Wed Sep 01 09:19:41 CEST 2010Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, CyprusElectronic Communications of the EASSTDefining Models - Meta Models versus Graph Grammars2920102010 ConferencePaper DiaPlan GraGra metamodel myown The precise specification of software models is a major concern in model-driven design of object-oriented software. In this paper, we investigate how program graphs, a language-independent model of object-oriented programs, can be specified precisely, with a focus on shape (static structure) rather than behavior. The metamodel-based approach is an apparent choice for such a specification; graph grammars are another natural candidate for specifying the shape of a class of graphs. However, star grammars (equivalent to the well-known hyperedge replacement grammars) do not allow all properties of program graphs to be specified. So we propose contextual star grammars as an extension of this mechanism. We discuss the specifications of program graphs by metamodels and by contextual star grammars.Thu Aug 19 10:07:23 CEST 2010Software and System Modeling3403-422Towards an integrated graph-based semantics for {UML}820092009 GraGra UML Sun Jul 11 12:43:09 CEST 2010Software and System Modeling4479-500Generating Instance Models from Meta Models820092009 GraGra metamodel Sun Jul 11 12:40:19 CEST 2010Proc. Fundamental Approaches to Software Engineering (FASE'04)214--228Lecture Notes in Computer ScienceIntegrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation298420042004 GraGra metamodel Visual languages (VLs) play a central role in modelling various system aspects. Besides standard languages like UML, a variety of domain-specific languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional language properties. Defining a VL by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the language grammar. In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for language definition and model manipulation. Two concrete approaches, the GenGED and the AToM 3 approach, illustrate how VLs can be defined and models can be manipulated by the techniques described above. ER -Mon May 10 18:19:53 CEST 2010Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, Sept. 17--23, 200630--45Lecture Notes in Computer ScienceSesqui-Pushout Rewriting417820062006 GraGra Sesqui-pushout (SqPO) rewriting—“sesqui” means “one and a half” in Latin—is a new algebraic approach to abstract rewriting in any category. SqPO rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model “deletion in unknown context”, a typical feature of single-pushout (spo) rewriting, as well as cloning.Thu May 06 13:20:09 CEST 2010Proc. of the 1st International Workshop on Visual Formalisms for Patterns, satellite of VL/HCC'09, Corvallis, OR, USA, September 24, 2009Electronic Communications of the EASSTPattern-Based Layout Specifications for Visual Language Editors2520102010 ConferencePaper DiaGen GraGra Layout SonjaMaier myown Thu Apr 15 20:54:57 CEST 2010Applications of Graph Transformation with Industrial Relevance, Proc. 2nd Intl. Workshop AGTIVE'03, Charlottesville, USA, 2003, Revised and Invited PapersAGTIVE:03413-419Lecture Notes in Computer Science{GenGED} - A Visual Definition Tool for Visual Modeling Environments.306220042003 GraGra In this paper, we give a brief overview on GenGED that allows for the visual definition and generation of visual modeling environments. Depending on the underlying visual modeling language, different components are suitable in a visual modeling environment. GenGED supports the definition and generation of editors, parsers, and simulators. Sat Mar 13 18:05:59 CET 2010Lecture Notes in Computer ScienceFormal Methods in Software and Systems Modeling339320052005 GraGra Mon Mar 08 11:09:58 CET 2010Orlando, FL, USAJournal of Computer and System Sciences2-3377--408Amalgamation of graph transformations: a synchronization mechanism3419871987 GraGra The authors generalize the well-known Parallelism Theorem for graph derivations to the Amalgamation Theorem. In this theorem the assumption of "parallel independence" is dropped. For each pair of productions together with a relational production (allowing productions to be associated with each other) they construct a single "amalgamated" production. The Amalgamation Theorem states that graph derivations which respect the given associations can be amalgamated to a single derivation via the "amalgamated" production. The amalgamation concept is applied to synchronization of graph manipulations in a simplified railway control system as well as to a graph grammar formalism for distributed systems (GDS). Thu Mar 04 18:20:28 CET 2010Proc. VL/HCC 08 Workshop on Sketch Tools for Diagramming, Herrsching, Germany, September 15, 2008A Model-Based Recognition Engine for Sketched Diagrams20082008 ConferencePaper DiaGen GraGra myown sketching Thu Mar 04 18:18:30 CET 2010Proc. IUI Workshop on Sketch Recognition, Sanibel Island, Florida, February 8, 2009On-line Recognition of Hatched and Filled Regions in Hand-drawings20092009 ConferencePaper DiaGen GraGra myown sketching Fri Feb 26 15:36:24 CET 2010Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. ProceedingsICGT:08411--425Lecture Notes in Computer Science15 Years of Triple Graph Grammars521420082008 GraGra TripleGraphGrammars Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and theexpressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arisethereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars intoforward and backward graph translation functions is given. Regarding these properties an interpretation and implementationof negative application conditions is derived that does not destroy the benefits of the original approach. Additionally anew demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automaticallya correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.Sat Feb 13 14:42:29 CET 2010Theoretical Computer Science34-363090 - 3109Adaptive Star Grammars and Their Languages41120102010 Article DiaPlan GraGra myown Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties are studied. In adaptive star grammars, rules are actually schemata which, via the cloning of so-called multiple nodes, may adapt to potentially infinitely many contexts when they are applied. This mechanism makes adaptive star grammars more powerful than context-free graph grammars. Nevertheless, they turn out to be restricted enough to share some of the basic characteristics of context-free devices. In particular, the underlying substitution operator enjoys associativity and confluence properties quite similar to those of context-free graph grammars, and the membership problem for adaptive star grammars is decidable. Tue Dec 22 10:44:27 CET 2009Workshop on Visual Languages and Logic, satellite of 2009 IEEE Symposium on Visual Languages and Human-Centric Computing, Corvallis, OR, USA, September 20, 2009CEUR Workshop ProceedingsImplementing an Animated Lambda-Calculus51020092009 Animation ConferencePaper DiaGen GraGra myown Mon Dec 14 11:25:51 CET 2009Graph-Grammars and Their Application to Computer Science, 3rd International Workshop Warrenton, Virginia, USA, December 2–6, 1986 216--231Lecture Notes in Computer ScienceGraph grammars and diagram editing2911987GraGra This paper reports on an ongoing work which started in 1981 and is aiming at developing a general, computer-aided method which would help to considerably reduce the time necessary to develop a syntax-directed editor for any given diagram technique. The main idea behind the approach is to represent diagrams by (formal) graphs whose nodes are enriched with attributes. Then, any manipulation of a diagram (typically the insertion of an arrow, a box, text, coloring, etc.) can be expressed in terms of the manipulation of its underlying attributed representation graph. The formal description of the manipulation is done by programmed attributed graph grammars. Fri Dec 11 09:35:27 CET 2009Graph Transformations in Computer Science, International Workshop Dagstuhl Castle, Germany, January 4-8, 1993380--394Lecture Notes in Computer ScienceAmalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system7761994GraGra The Agg-system is a prototype implementation of the algebraic approach to graph transformation. It consists of a flexible graph editor and a transformation component. The editor allows the graphical representation of production rules, occurrences and transformation results. The transformation component performs direct transformation steps for user-selected production rules and occurrences. First steps towards a graph specification of an abstract version of the Agg-system are possible by using amalgamated graph transformations. Agg-states are modelled by graphs whereas Agg-operations are described by amalgamated graph transformations combining parallel and sequential rewriting of graphs.