MGS: a Programming Language for the Transformations of Topological Collections

摘要: We present the first results in development of a new declarative programming language called MGS. This is devoted to simulation biological processes, especially those whose state space must be computed jointly with running system (for instance, morphogenesis). MGS proposes unified view on several computational mechanisms. Some them are initially inspired by or chemical processes (Gamma and CHAM, Lindenmayer systems, Paun systems cellular automata). They share property specifying local transformations time. The basic computation step replaces collection A elements, some subcollection B, another C. C function solely B its adjacent elements A. pasting into A−B depends shape involved collections. transformation. organisation collections viewed from topological viewpoint. formal framework specify this notion proposed. By changing structure collection, underlying model changed. specification substituted can done many ways. propose here pattern based neighborhood relationship induced topology collection. Several features control transformation applications then presented.