The rule-based language XL and the modelling environment GroIMP illustrated with simulated tree competition
R Hemmerling, O Kniemeyer, D Lanwert… - Functional plant …, 2008 - CSIRO Publishing
The programming language XL ('eXtended L-system language') is an extension of Java,
which supports the specification and execution of relational growth grammars, a variant of …
which supports the specification and execution of relational growth grammars, a variant of …
Design and implementation of a graph grammar based language for functional-structural plant modelling
O Kniemeyer - 2008 - opus4.kobv.de
Increasing biological knowledge requires more and more elaborate methods to translate the
knowledge into executable model descriptions, and increasing computational power allows …
knowledge into executable model descriptions, and increasing computational power allows …
The Train Benchmark: cross-technology performance evaluation of continuous model queries
In model-driven development of safety-critical systems (like automotive, avionics or
railways), well-formedness of models is repeatedly validated in order to detect design flaws …
railways), well-formedness of models is repeatedly validated in order to detect design flaws …
Grgen. net: The expressive, convenient and fast graph rewrite system
E Jakumeit, S Buchwald, M Kroll - International Journal on Software Tools …, 2010 - Springer
GrGen. NET is a generative programming system for graph rewriting, transforming intuitive
and expressive rewrite rule specifications into highly efficient. NET code. The user is …
and expressive rewrite rule specifications into highly efficient. NET code. The user is …
The graph programming language GP
D Plump - International Conference on Algebraic Informatics, 2009 - Springer
GP (for Graph Programs) is a rule-based, nondeterministic programming language for
solving graph problems at a high level of abstraction, freeing programmers from handling …
solving graph problems at a high level of abstraction, freeing programmers from handling …
Human Purkinje cells outperform mouse Purkinje cells in dendritic complexity and computational capacity
Purkinje cells in the cerebellum are among the largest neurons in the brain and have been
extensively investigated in rodents. However, their morphological and physiological …
extensively investigated in rodents. However, their morphological and physiological …
[HTML][HTML] A survey and comparison of transformation tools based on the transformation tool contest
E Jakumeit, S Buchwald, D Wagelaar, L Dan… - Science of computer …, 2014 - Elsevier
Abstract Model transformation is one of the key tasks in model-driven engineering and relies
on the efficient matching and modification of graph-based data structures; its sibling graph …
on the efficient matching and modification of graph-based data structures; its sibling graph …
Improved flexibility and scalability by interpreting story diagrams
H Giese, S Hildebrandt, A Seibel - Electronic Communications of the …, 2009 - eceasst.org
In this paper, we present an interpreter for Story Diagrams working on Eclipse Modeling
Framework (EMF) models. The interpreter provides a more flexible and, under certain …
Framework (EMF) models. The interpreter provides a more flexible and, under certain …
GP 2: efficient implementation of a graph programming language
C Bak - 2015 - etheses.whiterose.ac.uk
The graph programming language GP (Graph Programs) 2 and its implementation is the
subject of this thesis. The language allows programmers to write visual graph programs at a …
subject of this thesis. The language allows programmers to write visual graph programs at a …
Efficient analysis and execution of correct and complete model transformations based on triple graph grammars
Triple Graph Grammars are a well-established, formal and intuitive concept for the
specification and analysis of bidirectional model transformations. In previous work we have …
specification and analysis of bidirectional model transformations. In previous work we have …