Abstract

We present the first results in the development of a new declarative programming language called MGS. This language is devoted to the simulation of biological processes, especially those whose state space must be computed jointly with the current state of the system. MGS proposes a unified view on several computational mechanisms initially inspired by biological or chemical processes (Gamma and the CHAM, Lindenmayer systems, Paun systems and cellular automata). The basic computation step in MGS replaces in a collection A of elements, some subcollection B, by another collection C. The collection C only depends on B and its adjacent elements in A. The pasting of C into A B depends on the shape of the involved collections. This step is called a transformation. The specification of the collection to be substituted can be done in many ways. We propose here a pattern language based on the neighborhood relationship induced by the topology of the collection. Several features to control the transformation applications are then presented.

Citations