A graph grammar approach to artificial life.
We present the high-level language of relational growth grammars (RGGs) as a formalism designed for the specification of ALife models. RGGs can be seen as an extension of the well-known parametric Lindenmayer systems and contain rule-based, procedural, and object-oriented features. They are defined as rewriting systems operating on graphs with the edges coming from a set of user-defined relations, whereas the nodes can be associated with objects. We demonstrate their ability to represent genes, regulatory networks of metabolites, and morphologically structured organisms, as well as developmental aspects of these entities, in a common formal framework. Mutation, crossing over, selection, and the dynamics of a network of gene regulation can all be represented with simple graph rewriting rules. This is demonstrated in some detail on the classical example of Dawkins' biomorphs and the ABC model of flower morphogenesis: other applications are briefly sketched. An interactive program was implemented, enabling the execution of the formalism and the visualization of the results.
Brandenburgische Technische Universität Cottbus, Department of Computer Science, Chair for Practical Computer Science/Graphics Systems, P.O. Box 101344, D-03013 Cottbus, Germany. okn@informatik.tu-cottbus.de
Ole
O
Kniemeyer
Gerhard H
GH
Buck-Sorlin
Winfried
W
Kurth
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D003434:Crossing Over, Genetic; D035264:Flowers / Q000254:growth & development; D008037:Linguistics; D008954:Models, Biological; D008957:Models, Genetic