|
Modelling Of General Systems
MGS (a General Model of Simulation) is a domain-specific language used for specification and simulation of dynamical systems with dynamical structure, developed at IBISC (Computer Science, Integrative Biology and Complex Systems) at '' Université d'Évry Val-d'Essonne'' (University of Évry). MGS is particularly aimed at modelling biological systems. The MGS computational model is a generalisation of cellular automata, Lindenmayer systems, Paun systems and other computational formalisms inspired by chemistry and biology. It manipulates ''collections'' - sets of positions, filled with some values, in a lattice with a user-defined topology In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such .... External linksProject home page Simulation programming languages {{compu-lang-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domain-specific Language
A domain-specific language (DSL) is a computer language specialized to a particular application domain. This is in contrast to a general-purpose language (GPL), which is broadly applicable across domains. There are a wide variety of DSLs, ranging from widely used languages for common domains, such as HTML for web pages, down to languages used by only one or a few pieces of software, such as MUSH soft code. DSLs can be further subdivided by the kind of language, and include domain-specific ''markup'' languages, domain-specific ''modeling'' languages (more generally, specification languages), and domain-specific ''programming'' languages. Special-purpose computer languages have always existed in the computer age, but the term "domain-specific language" has become more popular due to the rise of domain-specific modeling. Simpler DSLs, particularly ones used by a single application, are sometimes informally called mini-languages. The line between general-purpose languages and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Évry, Essonne
Évry () is a former commune in the southern suburbs of Paris, France, prefecture of the department of Essonne. On 1 January 2019, it was merged into the new commune Évry-Courcouronnes. It is located from the center of Paris, in the "new town" of Évry Ville Nouvelle, created in the 1960s, of which it is the central and most populated commune. Significant nearby communes include Courcouronnes, Corbeil-Essonnes, Ris-Orangis, Brétigny-sur-Orge, and Draveil. Name Originally the commune was called ''Évry-sur-Seine'' (meaning "Évry upon Seine"). The name "Évry" comes from the Gallic name ''Eburacon'' or ''Eburiacos'', meaning "land of Eburos" (a Gallic patronym), perhaps the leader of a Gallic tribe in the area before the conquest of Gaul by the Romans. After the conquest, the name was corrupted into Latin ''Apriacum'', then Medieval Latin ''Avriacum'', and later ''Evriacum''. In 1881 the name of the commune was changed into ''Évry-Petit-Bourg'' at the request of entr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cellular Automata
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. Cellular automata have found application in various areas, including physics, theoretical biology and microstructure modeling. A cellular automaton consists of a regular grid of ''cells'', each in one of a finite number of '' states'', such as ''on'' and ''off'' (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its ''neighborhood'' is defined relative to the specified cell. An initial state (time ''t'' = 0) is selected by assigning a state for each cell. A new ''generation'' is created (advancing ''t'' by 1), according to some fixed ''rule'' (generally, a mathematical function) that determines the new state of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lindenmayer System
An L-system or Lindenmayer system is a parallel rewriting system and a type of formal grammar. An L-system consists of an alphabet of symbols that can be used to make strings, a collection of production rules that expand each symbol into some larger string of symbols, an initial "axiom" string from which to begin construction, and a mechanism for translating the generated strings into geometric structures. L-systems were introduced and developed in 1968 by Aristid Lindenmayer, a Hungarian theoretical biologist and botanist at the University of Utrecht. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes of plant development. L-systems have also been used to model the morphology of a variety of organisms and can be used to generate self-similar fractals. Origins As a biologist, Lindenmayer worked with yeast and filamentous fungi and studied the growth patterns of various types of bacteria, such as the cyanobacteria '' Anabae ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paun System
: ''For the computer p-System, see UCSD p-System.'' A P system is a computational model in the field of computer science that performs calculations using a biologically inspired process. They are based upon the structure of biological cells, abstracting from the way in which chemicals interact and cross cell membranes. The concept was first introduced in a 1998 report by the computer scientist Gheorghe Păun, whose last name is the origin of the letter P in 'P Systems'. Variations on the P system model led to the formation of a branch of research known as 'membrane computing.' Although inspired by biology, the primary research interest in P systems is concerned with their use as a computational model, rather than for biological modeling, although this is also being investigated. Informal description A P system is defined as a series of membranes containing chemicals (in finite quantities), catalysts and rules which determine possible ways in which chemicals may react with one ano ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Space
In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called points, along with an additional structure called a topology, which can be defined as a set of neighbourhoods for each point that satisfy some axioms formalizing the concept of closeness. There are several equivalent definitions of a topology, the most commonly used of which is the definition through open sets, which is easier than the others to manipulate. A topological space is the most general type of a mathematical space that allows for the definition of limits, continuity, and connectedness. Common types of topological spaces include Euclidean spaces, metric spaces and manifolds. Although very general, the concept of topological spaces is fundamental, and used in virtually every branch of modern mathematics. The study of topologi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
