MGS MGS: a declara ve spa al compu g programming language

Jean-Louis Giavitto

Description

MGS MGS:  a  declara?ve     spa?al  compu?g  programming  language   1 Jean-??Louis  Giavi?  a   Antoine  Spicher  b a IRCAM  –  CNRS   b LACL  –  Université  de  Paris  Est   We sketch the rationals of the MGS programming language. MGS is an experimental programming language developed to study the application of several spatial computing concepts to the specification and simulation of dynamical systems with a dynamical structure. MGS extends the notion of rewriting by considering more general structure than terms. The basic computation step in MGS replaces in a topological collection A, some subcollection B, by another topological collection C. A topological collection is a set of element structured by a neighborhood relationships describing an underlying space rep- resenting a data structure or constraints that must be fulfilled by the computation. This process 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). h?:// mgs.spa?al-??compu?ng.org  

•  for  dynamical


• dynamical  systems


•  a  declara


• statet


• statet  


• mgs


• jean-??louis  giavi?


• al  compu?g


•  –  cnrs  


• space rep- resenting

Informations

• Publié par: pefav
• Nombre de lectures: 16
• Langue: English
• Poids de l'ouvrage: 5 Mo

Extrait

MGS:adeclara ve MGS
spa al compu ng programminglanguage
aJean-LouisGiavi o
bAntoineSpicher
a IRCAM–CNRS
b LACL–UniversitédeParisEst
h p:// mgs.spa al-compu,ng.org
We sketch the rationals of the MGS programming language. MGS is an experimental programming language developed to
study the application of several spatial computing concepts to the specification and simulation of dynamical systems with a
dynamical structure. MGS extends the notion of rewriting by considering more general structure than terms. The basic
computation step in MGS replaces in a topological collection A, some subcollection B, by another topological collection C.
A topological collection is a set of element structured by a neighborhood relationships describing an underlying space rep-
resenting a data structure or constraints that must be fulfilled by the computation. This process 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). 1 MGS
21.  (DS)
2.  Gamma,Psystems,Lsystems,cellular
automata…
3.  Spa algeneraliza on
4.  MGS
5.  Algorithmicexamples
6.  Biologicalmodeling
2 MGS
Dynamicalsystems
and
DynamicalStructuresSpecifyingadynamicalsystem(forsimula on) MGS
H H
H*
statestate statet-1 t t+1 N
state state statet-dt t t+dt R
∫H(t)dt
state Specifica onof
•stru  ctureofstate evolution
• structureof me
•evo  lu onfunc on
time
4FormalismforDynamicalSystem
MGS
•  State:o en structuredbyspace(e.g.fields)
•  Time
•  Evolu on func on
C : continuous, Coupled Iteration of Cellular
PDE …
ODE functions automata D: discrete
state C C C D …
time C C D D …
space C D D D …
5 Themedium/processproblem
MGS
afallingball
•(p  ,p )  ,p )xx yy
• (v ,v )  ,v )xx yy
atany&meastateisaposi&onandaspeed
Adynamicalsystem(DS)
6````Themedium/processproblem
MGS
afallingball adevelopingembryo
•(p  ,p )x y
• (v ,v )x y
atany&meastateisaposi&onandaspeed thestructureofthestateischangingin&me
(chemicalandmechanicalstateofeachcell)
Adynamicalsystem(DS) Adynamicalsystem
withadynamicalstructure
2 7(DS)````MGS
2Bio-inspiredmodelsof(DS)CellularAutomata MGS
• VonNeumann
• Avoidsthedynamicstructureproblems
– Predefinedunderlying(unbounded)space
• ReplaceacellX
inanNEWSgrid
byanotherone(withanewstate)
9 Lindenmayersystems
MGS
Lindenmayersystems
•  Thestructureofatreecanbecodedbyastringof
parenthe,sed symbols
•  Asymbolisanelementarypartoftheplant
•  Thesymbolbetween[and]representsasub-tree
•  Addi,onal conven,onsare usedtorepresentmain
axis,orienta on, depth,etc.
•  Arule
s →s s s …0 1 2 3
representstheevolu,on ofs 0
10
P. Prusinkiewicz