@article{journals/eceasst/OrejasL10,
  added-at = {2011-08-12T22:06:13.000+0200},
  author = {Orejas, Fernando and Lambers, Leen},
  biburl = {http://www.bibsonomy.org/bibtex/22ae169e1fe6394ac8b5526db97aa492b/minas},
  ee = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/405},
  interhash = {ada54f8a30c9e7676575a90fdad15c6c},
  intrahash = {2ae169e1fe6394ac8b5526db97aa492b},
  journal = {ECEASST},
  keywords = {2010 GraGra},
  timestamp = {2011-08-12T22:06:13.000+0200},
  title = {Symbolic Attributed Graphs for Attributed Graph Transformation.},
  url = {http://dblp.uni-trier.de/db/journals/eceasst/eceasst30.html#OrejasL10},
  volume = 30,
  year = 2010
}

@article{journals/jsc/Orejas11,
  added-at = {2011-08-12T22:05:48.000+0200},
  author = {Orejas, Fernando},
  biburl = {http://www.bibsonomy.org/bibtex/254353fea273de5c8855918826c4ecfac/minas},
  ee = {http://dx.doi.org/10.1016/j.jsc.2010.09.009},
  interhash = {fce63c99f0c15fc556ff330e3b923ce6},
  intrahash = {54353fea273de5c8855918826c4ecfac},
  journal = {J. Symb. Comput.},
  keywords = {2011 GraGra},
  number = 3,
  pages = {294-315},
  timestamp = {2011-08-12T22:05:48.000+0200},
  title = {Symbolic graphs for attributed graph constraints.},
  url = {http://dblp.uni-trier.de/db/journals/jsc/jsc46.html#Orejas11},
  volume = 46,
  year = 2011
}

@incollection{Minas-Schneider:10,
  abstract = {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.},
  added-at = {2011-04-08T08:29:03.000+0200},
  author = {Minas, Mark and Schneider, Hans Jürgen},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAcgAAAAAAcgAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAAAtsixNmbW4wOS1zdWJtaXR0ZWQucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC2yNxw3y+QAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAEMjAwOQAQAAgAAMare/YAAAARAAgAAMcN5OkAAAABABwAC2yLAAtrpQALJIwACx2vAAhMrgAH+XEAAJDnAAIATk1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOlBTOjIwMDk6Zm1uMDktc3VibWl0dGVkLnBkZgAOACgAEwBmAG0AbgAwADkALQBzAHUAYgBtAGkAdAB0AGUAZAAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAQVVzZXJzL21pbmFzL0VpZ2VuZSBEYXRlaWVuL1RleHQvUGFwZXIvUFMvMjAwOS9mbW4wOS1zdWJtaXR0ZWQucGRmAAATAAEvAAAVAAIADP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxAsLi4vLi4vVGV4dC9QYXBlci9QUy8yMDA5L2ZtbjA5LXN1Ym1pdHRlZC5wZGbSHB0kJaIlIVxOU0RpY3Rpb25hcnkSAAGGoF8QD05TS2V5ZWRBcmNoaXZlcgAIABEAFgAfACgAMgA1ADoAPABFAEsAUgBdAGUAbABvAHEAcwB2AHgAegB8AIYAkwCYAKACbAJuAnMCfAKHAosCmQKgAqkC2ALdAuAC7QLyAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAwQ=},
  bdsk-file-2 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAjYAAAAAAjYAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAAAs0Bx9mbW4yMDA5X3N1Ym1pc3Npb25fMiMzQ0I1NzIucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPLVyx9aIvQAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAVRmVzdHNjaHJpZnQtTmFnbC0yMDA5AAAQAAgAAMare/YAAAARAAgAAMfWbJ0AAAABABwACzQHAAs0BQALJIwACx2vAAhMrgAH+XEAAJDnAAIAbU1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOjIwMDk6RmVzdHNjaHJpZnQtTmFnbC0yMDA5OmZtbjIwMDlfc3VibWlzc2lvbl8yIzNDQjU3Mi5wZGYAAA4ARAAhAGYAbQBuADIAMAAwADkAXwBzAHUAYgBtAGkAcwBzAGkAbwBuAF8AMgAzACAAcgBlAHYAaQBzAGUAZAAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIAYlVzZXJzL21pbmFzL0VpZ2VuZSBEYXRlaWVuL1RleHQvUGFwZXIvMjAwOS9GZXN0c2NocmlmdC1OYWdsLTIwMDkvZm1uMjAwOV9zdWJtaXNzaW9uXzIzIHJldmlzZWQucGRmABMAAS8AABUAAgAM//8AAIAF0hwdHh9YJGNsYXNzZXNaJGNsYXNzbmFtZaMfICFdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfEE0uLi8uLi9UZXh0L1BhcGVyLzIwMDkvRmVzdHNjaHJpZnQtTmFnbC0yMDA5L2ZtbjIwMDlfc3VibWlzc2lvbl8yMyByZXZpc2VkLnBkZtIcHSQloiUhXE5TRGljdGlvbmFyeRIAAYagXxAPTlNLZXllZEFyY2hpdmVyAAgAEQAWAB8AKAAyADUAOgA8AEUASwBSAF0AZQBsAG8AcQBzAHYAeAB6AHwAhgCTAJgAoALaAtwC4QLqAvUC+QMHAw4DFwNnA2wDbwN8A4EAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAADkw==},
  biburl = {http://www.bibsonomy.org/bibtex/2f335d61255862b1220512e4d21095315/minas},
  booktitle = {Graph Transformations and Model Driven Enginering -- Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday},
  date-added = {2009-10-29 18:45:57 +0100},
  date-modified = {2010-09-30 21:08:08 +0200},
  editor = {Engels, Gregor and Lewerentz, Claus and Sch{\"a}fer, Wilhelm and Sch{\"u}rr, Andy and Westfechtel, Bernhard},
  interhash = {5e4d45cea4941d945e79ac2b12f95d5a},
  intrahash = {f335d61255862b1220512e4d21095315},
  keywords = {2010 DiaPlan GraGra myown},
  pages = {34-59},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  timestamp = {2011-04-08T08:29:03.000+0200},
  title = {Graph Transformation by Computational Category Theory},
  url = {http://dx.doi.org/10.1007/978-3-642-17322-6_3},
  volume = 5765,
  year = 2010
}

@inproceedings{Strobl-Minas-GTVMT:10,
  abstract = {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.},
  added-at = {2010-09-01T09:20:58.000+0200},
  author = {Strobl, Torsten and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQIEAAAAAAIEAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADD8WucSCsAAAC5554YZ3R2bXQxMF9zdWJtaXNzaW9uXzUucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALy4hsddBJsAAAAAAAAAAAACAAUAAAkgAAAAAAAAAAAAAAAAAAAAEEdULVZNVCAoVG9yc3RlbikAEAAIAADD8V2MAAAAEQAIAADHXPaLAAAAAQAcALnnngCuMZQAC+tSAAvlIwAK1uUACqT4AAB62wACAGFNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46VGV4dDpQYXBlcjoyMDEwOkdULVZNVCAoVG9yc3Rlbik6Z3R2bXQxMF9zdWJtaXNzaW9uXzUucGRmAAAOADIAGABnAHQAdgBtAHQAMQAwAF8AcwB1AGIAbQBpAHMAcwBpAG8AbgBfADUALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAFRVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyLzIwMTAvR1QtVk1UIChUb3JzdGVuKS9ndHZtdDEwX3N1Ym1pc3Npb25fNS5wZGYAEwABLwAAFQACAAz//wAA0h4fICFYJGNsYXNzZXNaJGNsYXNzbmFtZaMhIiNdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfED8uLi8uLi9UZXh0L1BhcGVyLzIwMTAvR1QtVk1UIChUb3JzdGVuKS9ndHZtdDEwX3N1Ym1pc3Npb25fNS5wZGbSHh8mJ6InI1xOU0RpY3Rpb25hcnkACAARABoAHwApADIANwA6AD8AQQBTAFwAYgBpAHAAeACDAIUAiACKAIwAjwCRAJMAnQCqAK8AtwC5AsECxgLPAtoC3gLsAvMC/AM+A0MDRgAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAANT},
  biburl = {http://www.bibsonomy.org/bibtex/2dd03d09eae3d4c7cffcff85656c811b2/minas},
  booktitle = {Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, Cyprus},
  date-added = {2010-01-28 10:27:45 +0100},
  date-modified = {2010-01-28 10:31:44 +0100},
  editor = {Küster, Jochen and Tuosto, Emilio},
  interhash = {e3e2ef8adec335a5d284fa4dd1d01572},
  intrahash = {dd03d09eae3d4c7cffcff85656c811b2},
  keywords = {2010 Animation ConferencePaper DiaGen GraGra myown},
  series = {Electronic Communications of the EASST},
  timestamp = {2010-09-01T09:20:58.000+0200},
  title = {Specifying and Generating Editing Environments for Interactive Animated Visual Models},
  url = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/409/387},
  volume = 29,
  year = 2010
}

@inproceedings{Hoffmann-Minas-GTVMT:10,
  abstract = {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.},
  added-at = {2010-09-01T09:19:41.000+0200},
  author = {Hoffmann, Berthold and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQHQAAAAAAHQAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADD8WucSCsAAADKJgYVR1RWTVQxMC1NZXRhbW9kZWwucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPvGOsf7f2kAAAAAAAAAAAACAAUAAAkgAAAAAAAAAAAAAAAAAAAABDIwMTAAEAAIAADD8V2MAAAAEQAIAADH+2NJAAAAAQAcAMomBgAL+dsAC+tSAAvlIwAK1uUACqT4AAB62wACAFBNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46VGV4dDpQYXBlcjpQUzoyMDEwOkdUVk1UMTAtTWV0YW1vZGVsLnBkZgAOACwAFQBHAFQAVgBNAFQAMQAwAC0ATQBlAHQAYQBtAG8AZABlAGwALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAENVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyL1BTLzIwMTAvR1RWTVQxMC1NZXRhbW9kZWwucGRmAAATAAEvAAAVAAIADP//AADSHh8gIVgkY2xhc3Nlc1okY2xhc3NuYW1loyEiI11OU011dGFibGVEYXRhVk5TRGF0YVhOU09iamVjdF8QLi4uLy4uL1RleHQvUGFwZXIvUFMvMjAxMC9HVFZNVDEwLU1ldGFtb2RlbC5wZGbSHh8mJ6InI1xOU0RpY3Rpb25hcnkACAARABoAHwApADIANwA6AD8AQQBTAFwAYgBpAHAAeACDAIUAiACKAIwAjwCRAJMAnQCqAK8AtwC5Ao0CkgKbAqYCqgK4Ar8CyAL5Av4DAQAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAMO},
  bdsk-url-1 = {http://www.cs.le.ac.uk/events/gtvmt10/},
  biburl = {http://www.bibsonomy.org/bibtex/286a2afdf366e35e267ebd901a8c225de/minas},
  booktitle = {Proceedings of the 9th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), March 20-21 2010, Paphos, Cyprus},
  date-added = {2010-01-28 10:23:17 +0100},
  date-modified = {2010-08-05 10:37:53 +0200},
  editor = {Küster, Jochen and Tuosto, Emilio},
  interhash = {774a673416ad8c992f7e1c1652442d43},
  intrahash = {86a2afdf366e35e267ebd901a8c225de},
  keywords = {2010 ConferencePaper DiaPlan GraGra metamodel myown},
  series = {Electronic Communications of the EASST},
  timestamp = {2010-09-01T09:19:41.000+0200},
  title = {Defining Models - Meta Models versus Graph Grammars},
  url = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/411/385},
  volume = 29,
  year = 2010
}

@article{journals/sosym/KuskeGKZ09,
  added-at = {2010-08-19T10:07:23.000+0200},
  author = {Kuske, Sabine and Gogolla, Martin and Kreowski, Hans-Jörg and Ziemann, Paul},
  biburl = {http://www.bibsonomy.org/bibtex/268301c9d3e31e87cc734cc7865baa9e5/minas},
  description = {dblp},
  ee = {http://dx.doi.org/10.1007/s10270-008-0101-4},
  interhash = {4c08c5031cffeae73be205362d09545d},
  intrahash = {68301c9d3e31e87cc734cc7865baa9e5},
  journal = {Software and System Modeling},
  keywords = {2009 GraGra UML},
  number = 3,
  pages = {403-422},
  timestamp = {2010-08-19T10:07:23.000+0200},
  title = {Towards an integrated graph-based semantics for {UML}},
  url = {http://dblp.uni-trier.de/db/journals/sosym/sosym8.html#KuskeGKZ09},
  volume = 8,
  year = 2009
}

@article{Ehrig-Kuester-Taentzer:09,
  added-at = {2010-07-11T12:43:09.000+0200},
  author = {Ehrig, Karsten and K{\"u}ster, Jochen Malte and Taentzer, Gabriele},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAeIAAAAAAeIAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAAAl2Qg9Tb1N5TS1FS1QwOS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALQGqx6No4QAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAORWhyaWcsIEthcnN0ZW4AEAAIAADGq3v2AAAAEQAIAADHo1rRAAAAAQAcAAl2QgAJdi4ACXYsAAhMsgAITK4AB/lxAACQ5wACAFpNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46RG9jdW1lbnRzOlBhcGVyczpkYjpFaHJpZywgS2Fyc3RlbjpTb1N5TS1FS1QwOS5wZGYADgAgAA8AUwBvAFMAeQBNAC0ARQBLAFQAMAA5AC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgBNVXNlcnMvbWluYXMvRWlnZW5lIERhdGVpZW4vRG9jdW1lbnRzL1BhcGVycy9kYi9FaHJpZywgS2Fyc3Rlbi9Tb1N5TS1FS1QwOS5wZGYAABMAAS8AABUAAgAM//8AAIAF0hwdHh9YJGNsYXNzZXNaJGNsYXNzbmFtZaMfICFdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfEDguLi8uLi9Eb2N1bWVudHMvUGFwZXJzL2RiL0VocmlnLCBLYXJzdGVuL1NvU3lNLUVLVDA5LnBkZtIcHSQloiUhXE5TRGljdGlvbmFyeRIAAYagXxAPTlNLZXllZEFyY2hpdmVyAAgAEQAWAB8AKAAyADUAOgA8AEUASwBSAF0AZQBsAG8AcQBzAHYAeAB6AHwAhgCTAJgAoAKGAogCjQKWAqECpQKzAroCwwL+AwMDBgMTAxgAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAADKg==},
  bdsk-file-2 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAeYAAAAAAeYAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAAAl2QhBTb1N5TS1FS1RXMDkucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALFaux5spuAAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAORWhyaWcsIEthcnN0ZW4AEAAIAADGq3v2AAAAEQAIAADHmxuoAAAAAQAcAAl2QgAJdi4ACXYsAAhMsgAITK4AB/lxAACQ5wACAFtNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46RG9jdW1lbnRzOlBhcGVyczpkYjpFaHJpZywgS2Fyc3RlbjpTb1N5TS1FS1RXMDkucGRmAAAOACIAEABTAG8AUwB5AE0ALQBFAEsAVABXADAAOQAuAHAAZABmAA8AGgAMAE0AYQBjAGkAbgB0AG8AcwBoACAASABEABIATlVzZXJzL21pbmFzL0VpZ2VuZSBEYXRlaWVuL0RvY3VtZW50cy9QYXBlcnMvZGIvRWhyaWcsIEthcnN0ZW4vU29TeU0tRUtUVzA5LnBkZgATAAEvAAAVAAIADP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxA5Li4vLi4vRG9jdW1lbnRzL1BhcGVycy9kYi9FaHJpZywgS2Fyc3Rlbi9Tb1N5TS1FS1RXMDkucGRm0hwdJCWiJSFcTlNEaWN0aW9uYXJ5EgABhqBfEA9OU0tleWVkQXJjaGl2ZXIACAARABYAHwAoADIANQA6ADwARQBLAFIAXQBlAGwAbwBxAHMAdgB4AHoAfACGAJMAmACgAooCjAKRApoCpQKpArcCvgLHAwMDCAMLAxgDHQAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAMv},
  bdsk-url-1 = {http://dx.doi.org/10.1007/s10270-008-0095-y},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  biburl = {http://www.bibsonomy.org/bibtex/2418d9e3ccc4f3c70927c7f54ac415120/minas},
  date-added = {2010-02-12 15:51:08 +0100},
  date-modified = {2010-07-01 16:32:33 +0200},
  interhash = {dd48d470edb50fa800ae1283f68e4498},
  intrahash = {418d9e3ccc4f3c70927c7f54ac415120},
  journal = {Software and System Modeling},
  keywords = {2009 GraGra metamodel},
  number = 4,
  pages = {479-500},
  timestamp = {2010-07-11T12:43:09.000+0200},
  title = {Generating Instance Models from Meta Models},
  url = {http://dx.doi.org/10.1007/s10270-008-0095-y},
  volume = 8,
  year = 2009
}

@inproceedings{bardohl-ehrig-deLara:04,
  abstract = {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  -},
  added-at = {2010-07-11T12:40:19.000+0200},
  author = {Bardohl, Roswitha and Ehrig, Hartmut and de Lara, Juan and Taentzer, Gabriele},
  biburl = {http://www.bibsonomy.org/bibtex/27b42b9b55969acfce759de615f0710df/minas},
  booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'04)},
  description = {SpringerLink - Buchkapitel},
  interhash = {a25a834bcf1d92fac4fdfda989aaaa08},
  intrahash = {7b42b9b55969acfce759de615f0710df},
  keywords = {2004 GraGra metamodel},
  pages = {214--228},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-07-11T12:40:19.000+0200},
  title = {Integrating Meta-modelling Aspects with Graph Transformation for Efficient Visual Language Definition and Model Manipulation},
  url = {http://dx.doi.org/10.1007/978-3-540-24721-0_16},
  volume = 2984,
  year = 2004
}

@inproceedings{corradini:06,
  abstract = {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.},
  added-at = {2010-05-10T18:19:53.000+0200},
  author = {Corradini, Andrea and Heindel, Tobias and Hermann, Frank and König, Barbara},
  biburl = {http://www.bibsonomy.org/bibtex/2f8364bad1753676b0b47ddc7a09c8ae7/minas},
  booktitle = {Graph Transformations, Third International Conference, ICGT 2006, Natal, Rio Grande do Norte, Brazil, Sept. 17--23, 2006},
  description = {SpringerLink - Buchkapitel},
  editor = {Corradini, Andrea and Ehrig, Hartmut and Montanari, Ugo and Ribeiro, Leila and Rozenberg, Grzegorz},
  interhash = {c881f63dcd5057a67f67c80701e4352d},
  intrahash = {f8364bad1753676b0b47ddc7a09c8ae7},
  keywords = {2006 GraGra},
  pages = {30--45},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-05-10T18:19:53.000+0200},
  title = {Sesqui-Pushout Rewriting},
  url = {http://dx.doi.org/10.1007/11841883_4},
  volume = 4178,
  year = 2006
}

@inproceedings{maier-minas-VFfP:09,
  added-at = {2010-05-06T13:20:09.000+0200},
  author = {Maier, Sonja and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAcQAAAAAAcQAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAACx0mRJWRmZQMDkgZWNlYXNzdC5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQROhyAhvNwAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAEMjAxMAAQAAgAAMare/YAAAARAAgAAMgIUxcAAAABABwALHSZAAtrpQALJIwACx2vAAhMrgAH+XEAAJDnAAIATU1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOlBTOjIwMTA6VkZmUDA5IGVjZWFzc3QucGRmAAAOACYAEgBWAEYAZgBQADAAOQAgAGUAYwBlAGEAcwBzAHQALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAEBVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyL1BTLzIwMTAvVkZmUDA5IGVjZWFzc3QucGRmABMAAS8AABUAAgAM//8AAIAF0hwdHh9YJGNsYXNzZXNaJGNsYXNzbmFtZaMfICFdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfECsuLi8uLi9UZXh0L1BhcGVyL1BTLzIwMTAvVkZmUDA5IGVjZWFzc3QucGRm0hwdJCWiJSFcTlNEaWN0aW9uYXJ5EgABhqBfEA9OU0tleWVkQXJjaGl2ZXIACAARABYAHwAoADIANQA6ADwARQBLAFIAXQBlAGwAbwBxAHMAdgB4AHoAfACGAJMAmACgAmgCagJvAngCgwKHApUCnAKlAtMC2ALbAugC7QAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAL/},
  bdsk-file-2 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAcQAAAAAAcQAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAAAtsixJWRmZQMDkgcHJlcHJvYy5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAC2yVxpzbWAAAAAAAAAAAAAIABQAACSAAAAAAAAAAAAAAAAAAAAAEMjAwOQAQAAgAAMare/YAAAARAAgAAMacvzgAAAABABwAC2yLAAtrpQALJIwACx2vAAhMrgAH+XEAAJDnAAIATU1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOlBTOjIwMDk6VkZmUDA5IHByZXByb2MucGRmAAAOACYAEgBWAEYAZgBQADAAOQAgAHAAcgBlAHAAcgBvAGMALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAEBVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyL1BTLzIwMDkvVkZmUDA5IHByZXByb2MucGRmABMAAS8AABUAAgAM//8AAIAF0hwdHh9YJGNsYXNzZXNaJGNsYXNzbmFtZaMfICFdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfECsuLi8uLi9UZXh0L1BhcGVyL1BTLzIwMDkvVkZmUDA5IHByZXByb2MucGRm0hwdJCWiJSFcTlNEaWN0aW9uYXJ5EgABhqBfEA9OU0tleWVkQXJjaGl2ZXIACAARABYAHwAoADIANQA6ADwARQBLAFIAXQBlAGwAbwBxAHMAdgB4AHoAfACGAJMAmACgAmgCagJvAngCgwKHApUCnAKlAtMC2ALbAugC7QAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAL/},
  bdsk-url-1 = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/351},
  biburl = {http://www.bibsonomy.org/bibtex/2ec497f2395c3075765e6e1c2e87771d9/minas},
  booktitle = {Proc. of the 1st International Workshop on Visual Formalisms for Patterns, satellite of VL/HCC'09, Corvallis, OR, USA, September 24, 2009},
  date-added = {2009-09-10 12:55:54 +0200},
  date-modified = {2011-03-12 19:10:08 +0100},
  editor = {Bottoni, Paolo and Guerra, Esther and de Lara, Juan},
  interhash = {6977eb2b52b7c2cf76e4f4f33d0d7cff},
  intrahash = {ec497f2395c3075765e6e1c2e87771d9},
  keywords = {2010 ConferencePaper DiaGen GraGra Layout SonjaMaier myown},
  series = {Electronic Communications of the EASST},
  timestamp = {2010-05-06T13:20:09.000+0200},
  title = {Pattern-Based Layout Specifications for Visual Language Editors},
  url = {http://journal.ub.tu-berlin.de/index.php/eceasst/article/view/351},
  volume = 25,
  year = 2010
}

@inproceedings{BardohlEW:03,
  abstract = {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.
},
  added-at = {2010-04-15T20:54:57.000+0200},
  author = {Bardohl, Roswitha and Ermel, Claudia and Weinhold, Ingo},
  biburl = {http://www.bibsonomy.org/bibtex/2f1e249c55c21086bb13857d9a917c263/minas},
  booktitle = {Applications of Graph Transformation with Industrial Relevance, Proc. 2nd Intl. Workshop AGTIVE'03, Charlottesville, USA, 2003, Revised and Invited Papers},
  crossref = {AGTIVE:03},
  date = {2004-07-29},
  description = {dbl},
  doi = {10.1007/b98116},
  editor = {Pfaltz, John L. and Nagl, Manfred and Böhlen, Boris},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3062&spage=413},
  interhash = {c7b3590d9b6fd0e4bcd0fdb37c6e5dc7},
  intrahash = {f1e249c55c21086bb13857d9a917c263},
  isbn = {3-540-22120-4},
  keywords = {2003 GraGra},
  pages = {413-419},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-04-15T20:54:57.000+0200},
  title = {{GenGED} - A Visual Definition Tool for Visual Modeling Environments.},
  url = {http://dx.doi.org/10.1007/b98116},
  volume = 3062,
  year = 2004
}

@book{festschrift-ehrig:05,
  added-at = {2010-03-13T18:05:59.000+0100},
  biburl = {http://www.bibsonomy.org/bibtex/2cf07a816710caf24f9dfbc4414ac4aa0/minas},
  description = {SpringerLink - Buch},
  editor = {Kreowski, Hans-Jörg and Montanari, Ugo and Orejas, Fernando and Rozenberg, Grzegorz and Taentzer, Gabriele},
  interhash = {9ad5e1fe2be90791c4653d678990f13a},
  intrahash = {cf07a816710caf24f9dfbc4414ac4aa0},
  keywords = {2005 GraGra},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-03-13T18:05:59.000+0100},
  title = {Formal Methods in Software and Systems Modeling},
  url = {http://dx.doi.org/10.1007/b106390},
  volume = 3393,
  year = 2005
}

@article{29888,
  abstract = {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). },
  added-at = {2010-03-08T11:09:58.000+0100},
  address = {Orlando, FL, USA},
  author = {B\"{o}hm, Paul and Fonio, Harald-Reto and Habel, Annegret},
  biburl = {http://www.bibsonomy.org/bibtex/21f8e57ec4eb5d54508f0f745176e301e/minas},
  description = {Amalgamation of graph transformations: a synchronization mechanism},
  doi = {http://dx.doi.org/10.1016/0022-0000(87)90030-4},
  interhash = {0ff3132f4e31855eeb3cd1df890e5e30},
  intrahash = {1f8e57ec4eb5d54508f0f745176e301e},
  issn = {0022-0000},
  journal = {Journal of Computer and System Sciences},
  keywords = {1987 GraGra},
  number = {2-3},
  pages = {377--408},
  publisher = {Academic Press, Inc.},
  timestamp = {2010-03-08T11:09:58.000+0100},
  title = {Amalgamation of graph transformations: a synchronization mechanism},
  url = {http://portal.acm.org/citation.cfm?id=29880.29888},
  volume = 34,
  year = 1987
}

@inproceedings{brieler-minas-skwtchws:08,
  added-at = {2010-03-04T18:20:28.000+0100},
  author = {Brieler, Florian and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQHkAAAAAAHkAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADDYhqFSCsAAABEZegaVkxIQ0MtU2tldGNoV29ya3Nob3AwOC5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANpmP8Tbe6UAAAAAAAAAAAADAAUAAAkgAAAAAAAAAAAAAAAAAAAABDIwMDgAEAAIAADDYgx1AAAAEQAIAADE21+FAAAAAQAcAERl6AAOqFoADpnRAA6TowAN64QAC7DaAAB5awACAFVNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46VGV4dDpQYXBlcjpQUzoyMDA4OlZMSENDLVNrZXRjaFdvcmtzaG9wMDgucGRmAAAOADYAGgBWAEwASABDAEMALQBTAGsAZQB0AGMAaABXAG8AcgBrAHMAaABvAHAAMAA4AC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgBIVXNlcnMvbWluYXMvRWlnZW5lIERhdGVpZW4vVGV4dC9QYXBlci9QUy8yMDA4L1ZMSENDLVNrZXRjaFdvcmtzaG9wMDgucGRmABMAAS8AABUAAgAM//8AANIeHyAhWCRjbGFzc2VzWiRjbGFzc25hbWWjISIjXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxA2Li4vLi4vLi4vVGV4dC9QYXBlci9QUy8yMDA4L1ZMSENDLVNrZXRjaFdvcmtzaG9wMDgucGRm0h4fJieiJyNcTlNEaWN0aW9uYXJ5AAgAEQAaAB8AKQAyADcAOgA/AEEAUwBcAGIAaQBwAHgAgwCFAIgAigCMAI8AkQCTAJ0AqgCvALcAuQKhAqYCrwK6Ar4CzALTAtwDFQMaAx0AAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAADKg==},
  biburl = {http://www.bibsonomy.org/bibtex/243a52c05c17f177562db9a231192262e/minas},
  booktitle = {Proc. VL/HCC 08 Workshop on Sketch Tools for Diagramming, Herrsching, Germany, September 15, 2008},
  date-added = {2009-05-25 15:07:43 +0200},
  date-modified = {2009-09-10 18:06:01 +0200},
  interhash = {f9bb964158d4dbd63613a31a1ad27393},
  intrahash = {43a52c05c17f177562db9a231192262e},
  keywords = {2008 ConferencePaper DiaGen GraGra myown sketching},
  p.authors = {minas#DiaGen},
  p.directories = {DiaGen gg},
  p.year = {2008},
  timestamp = {2010-03-04T18:20:28.000+0100},
  title = {A Model-Based Recognition Engine for Sketched Diagrams},
  url = {https://www.cs.auckland.ac.nz/research/conferences/skekchws/proceedings/vlhcc_stws_p19.pdf},
  year = 2008
}

@inproceedings{thierjung-brieler-minas:09,
  added-at = {2010-03-04T18:18:30.000+0100},
  author = {Thierjung, Raphael and Brieler, Florian and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQHEAAAAAAHEAAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADDYhqFSCsAAADaZFISSVVJLVdvcmtzaG9wMDkucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANpmHMWxOHwAAAAAAAAAAAADAAUAAAkgAAAAAAAAAAAAAAAAAAAABDIwMDkAEAAIAADDYgx1AAAAEQAIAADFsSpsAAAAAQAcANpkUgAOqFoADpnRAA6TowAN64QAC7DaAAB5awACAE1NYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46VGV4dDpQYXBlcjpQUzoyMDA5OklVSS1Xb3Jrc2hvcDA5LnBkZgAADgAmABIASQBVAEkALQBXAG8AcgBrAHMAaABvAHAAMAA5AC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgBAVXNlcnMvbWluYXMvRWlnZW5lIERhdGVpZW4vVGV4dC9QYXBlci9QUy8yMDA5L0lVSS1Xb3Jrc2hvcDA5LnBkZgATAAEvAAAVAAIADP//AADSHh8gIVgkY2xhc3Nlc1okY2xhc3NuYW1loyEiI11OU011dGFibGVEYXRhVk5TRGF0YVhOU09iamVjdF8QLi4uLy4uLy4uL1RleHQvUGFwZXIvUFMvMjAwOS9JVUktV29ya3Nob3AwOS5wZGbSHh8mJ6InI1xOU0RpY3Rpb25hcnkACAARABoAHwApADIANwA6AD8AQQBTAFwAYgBpAHAAeACDAIUAiACKAIwAjwCRAJMAnQCqAK8AtwC5AoEChgKPApoCngKsArMCvALtAvIC9QAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAMC},
  biburl = {http://www.bibsonomy.org/bibtex/26549058d22400722dd652ffae67b11e3/minas},
  booktitle = {Proc. IUI Workshop on Sketch Recognition, Sanibel Island, Florida, February 8, 2009},
  date-added = {2009-05-24 10:25:25 +0200},
  date-modified = {2009-09-10 18:05:52 +0200},
  interhash = {92a7653cff3a104c3586ec56dc909dda},
  intrahash = {6549058d22400722dd652ffae67b11e3},
  keywords = {2009 ConferencePaper DiaGen GraGra myown sketching},
  p.authors = {minas#DiaGen},
  p.directories = {DiaGen gg},
  p.year = {2009},
  timestamp = {2010-03-04T18:18:30.000+0100},
  title = {On-line Recognition of Hatched and Filled Regions in Hand-drawings},
  url = {http://srl.csdl.tamu.edu/workshops/2009/iui/finalPapers/Thierjung.pdf},
  year = 2009
}

@inproceedings{schuerr-klar:08,
  abstract = {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.},
  added-at = {2010-02-26T15:36:24.000+0100},
  author = {Schürr, Andy and Klar, Felix},
  biburl = {http://www.bibsonomy.org/bibtex/2bcb50f527cf6588ffad9ad56933f8dfc/minas},
  booktitle = {Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings},
  crossref = {ICGT:08},
  description = {SpringerLink - Buchkapitel},
  editor = {Ehrig, Hartmut and Heckel, Reiko and Rozenberg, Grzegorz and Taentzer, Gabriele},
  interhash = {3a55d925776c5de6711d94160bbf7510},
  intrahash = {bcb50f527cf6588ffad9ad56933f8dfc},
  keywords = {2008 GraGra TripleGraphGrammars},
  pages = {411--425},
  series = {Lecture Notes in Computer Science},
  timestamp = {2010-02-26T15:36:24.000+0100},
  title = {15 Years of Triple Graph Grammars},
  url = {http://dx.doi.org/10.1007/978-3-540-87405-8_28},
  volume = 5214,
  year = 2008
}

@article{DHJM10,
  abstract = {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.
},
  added-at = {2010-02-13T14:42:29.000+0100},
  author = {Drewes, Frank and Hoffmann, Berthold and Janssens, Dirk and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAaQAAAAAAaQAAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAMarmBZIKwAAACx0mQpESEpNMTAucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALHozx5xWTyBGRFBPUkFDAAIABQAACSAAAAAAAAAAAAAAAAAAAAAEMjAxMAAQAAgAAMare/YAAAARAAgAAMecSD8AAAABABwALHSZAAtrpQALJIwACx2vAAhMrgAH+XEAAJDnAAIARU1hY2ludG9zaCBIRDpVc2VyczptaW5hczpFaWdlbmUgRGF0ZWllbjpUZXh0OlBhcGVyOlBTOjIwMTA6REhKTTEwLnBkZgAADgAWAAoARABIAEoATQAxADAALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASADhVc2Vycy9taW5hcy9FaWdlbmUgRGF0ZWllbi9UZXh0L1BhcGVyL1BTLzIwMTAvREhKTTEwLnBkZgATAAEvAAAVAAIADP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxAjLi4vLi4vVGV4dC9QYXBlci9QUy8yMDEwL0RISk0xMC5wZGbSHB0kJaIlIVxOU0RpY3Rpb25hcnkSAAGGoF8QD05TS2V5ZWRBcmNoaXZlcgAIABEAFgAfACgAMgA1ADoAPABFAEsAUgBdAGUAbABvAHEAcwB2AHgAegB8AIYAkwCYAKACSAJKAk8CWAJjAmcCdQJ8AoUCqwKwArMCwALFAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAtc=},
  biburl = {http://www.bibsonomy.org/bibtex/22a56feb5a82a3374c06b04d8517dcf9b/minas},
  date-added = {2010-02-13 12:54:34 +0100},
  date-modified = {2010-02-13 14:31:55 +0100},
  interhash = {d97b1dd724a841f58043cfa304f34a87},
  intrahash = {2a56feb5a82a3374c06b04d8517dcf9b},
  journal = {Theoretical Computer Science},
  keywords = {2010 Article DiaPlan GraGra myown},
  number = {34-36},
  pages = {3090 - 3109},
  timestamp = {2010-02-13T14:42:29.000+0100},
  title = {Adaptive Star Grammars and Their Languages},
  url = {http://www2.cs.unibw.de/publ/minas/DHJM10.pdf},
  volume = 411,
  year = 2010
}

@inproceedings{strobl-minas-VLL:09,
  added-at = {2009-12-22T10:44:27.000+0100},
  author = {Strobl, Torsten and Minas, Mark},
  bdsk-file-1 = {YnBsaXN0MDDUAQIDBAUGCQpYJHZlcnNpb25UJHRvcFkkYXJjaGl2ZXJYJG9iamVjdHMSAAGGoNEHCFRyb290gAFfEA9OU0tleWVkQXJjaGl2ZXKoCwwXGBkdJCVVJG51bGzTDQ4PEBEUViRjbGFzc1dOUy5rZXlzWk5TLm9iamVjdHOAB6ISE4ACgAOiFRaABIAGWWFsaWFzRGF0YVxyZWxhdGl2ZVBhdGjSDRobHFdOUy5kYXRhgAVPEQG8AAAAAAG8AAIAAAxNYWNpbnRvc2ggSEQAAAAAAAAAAAAAAAAAAADD8WucSCsAAACSOoMQVkxMMDkgKENFVVIpLnBkZgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJkcM8au4JMAAAAAAAAAAAACAAUAAAkgAAAAAAAAAAAAAAAAAAAABDIwMDkAEAAIAADD8V2MAAAAEQAIAADGrsRzAAAAAQAcAJI6gwAL+dsAC+tSAAvlIwAK1uUACqT4AAB62wACAEtNYWNpbnRvc2ggSEQ6VXNlcnM6bWluYXM6RWlnZW5lIERhdGVpZW46VGV4dDpQYXBlcjpQUzoyMDA5OlZMTDA5IChDRVVSKS5wZGYAAA4AIgAQAFYATABMADAAOQAgACgAQwBFAFUAUgApAC4AcABkAGYADwAaAAwATQBhAGMAaQBuAHQAbwBzAGgAIABIAEQAEgA+VXNlcnMvbWluYXMvRWlnZW5lIERhdGVpZW4vVGV4dC9QYXBlci9QUy8yMDA5L1ZMTDA5IChDRVVSKS5wZGYAEwABLwAAFQACAAz//wAA0h4fICFYJGNsYXNzZXNaJGNsYXNzbmFtZaMhIiNdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3RfECkuLi8uLi9UZXh0L1BhcGVyL1BTLzIwMDkvVkxMMDkgKENFVVIpLnBkZtIeHyYnoicjXE5TRGljdGlvbmFyeQAIABEAGgAfACkAMgA3ADoAPwBBAFMAXABiAGkAcAB4AIMAhQCIAIoAjACPAJEAkwCdAKoArwC3ALkCeQJ+AocCkgKWAqQCqwK0AuAC5QLoAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAvU=},
  bdsk-url-1 = {http://www.youtube.com/watch?v=K-p3ddhwVrg},
  bdsk-url-2 = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/},
  biburl = {http://www.bibsonomy.org/bibtex/2c2c31ea735550fbd8d320773cba15715/minas},
  booktitle = {Workshop on Visual Languages and Logic, satellite of 2009 IEEE Symposium on Visual Languages and Human-Centric Computing, Corvallis, OR, USA, September 20, 2009},
  date-added = {2009-09-10 12:58:16 +0200},
  date-modified = {2009-12-22 10:43:14 +0100},
  interhash = {d287caa2d8c028d4a72bae366edc04c7},
  intrahash = {c2c31ea735550fbd8d320773cba15715},
  keywords = {2009 Animation ConferencePaper DiaGen GraGra myown},
  series = {CEUR Workshop Proceedings},
  timestamp = {2009-12-22T10:44:27.000+0100},
  title = {Implementing an Animated Lambda-Calculus},
  url = {http://CEUR-WS.org/Vol-510/paper6.pdf},
  volume = 510,
  year = 2009
}

@inproceedings{herbert1987graph,
  abstract = {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.
},
  added-at = {2009-12-14T11:25:51.000+0100},
  author = {Göttler, Herbert},
  biburl = {http://www.bibsonomy.org/bibtex/2dd61638e7ebe7d1013c8c83208998b34/minas},
  booktitle = {Graph-Grammars and Their Application to Computer Science, 3rd International Workshop Warrenton, Virginia, USA, December 2–6, 1986 },
  description = {SpringerLink - Buchkapitel},
  editor = {Ehrig, H. and Nagl, M. and Rozenberg, G. and Rosenfeld, A.},
  interhash = {d20bb5a23bc42d496b0f2429bc1cbf8d},
  intrahash = {dd61638e7ebe7d1013c8c83208998b34},
  keywords = {GraGra},
  pages = {216--231},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2009-12-14T11:25:51.000+0100},
  title = {Graph grammars and diagram editing},
  url = {http://dx.doi.org/10.1007/3-540-18771-5_55},
  volume = 291,
  year = 1987
}

@inproceedings{gabriele1994amalgamated,
  abstract = {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.

},
  added-at = {2009-12-11T09:35:27.000+0100},
  author = {Taentzer, Gabriele and Beyer, Martin},
  biburl = {http://www.bibsonomy.org/bibtex/288808c9184e9ea0953bdd389c21855a6/minas},
  booktitle = {Graph Transformations in Computer Science, International Workshop  Dagstuhl Castle, Germany, January 4-8, 1993},
  description = {amalgamation},
  editor = {Schneider, Hans-Jpürgen and Ehrig, Hartmut},
  interhash = {e0e7b53412af8aeb9f5f49819600a5bd},
  intrahash = {88808c9184e9ea0953bdd389c21855a6},
  keywords = {GraGra},
  pages = {380--394},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2009-12-11T09:35:27.000+0100},
  title = {Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system},
  url = {http://dx.doi.org/10.1007/3-540-57787-4_24},
  volume = 776,
  year = 1994
}