09.02.2014 Views

A Toy Model of Chemical Reaction Networks - TBI - Universität Wien

A Toy Model of Chemical Reaction Networks - TBI - Universität Wien

A Toy Model of Chemical Reaction Networks - TBI - Universität Wien

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 4<br />

<strong>Chemical</strong> reactions<br />

A molecule is composed <strong>of</strong> atoms that are tied together by aid<br />

<strong>of</strong> the electrons. Atomic nuclei and electrons are not at rest but<br />

are constantly moving. The paths <strong>of</strong> the electrons are usually<br />

called orbitals. The forms <strong>of</strong> these orbitals are determining the<br />

bonds between the atoms. In a reaction molecules are impinging<br />

against each other. During the collision the electrons are influenced<br />

by new atomic nuclei and the orbitals are changed. Some<br />

<strong>of</strong> the bonds are broken and others are created. Afterwards, new<br />

molecules have been formed.<br />

The Nobel Prize in Chemistry 1981. Presentation Speech<br />

by Pr<strong>of</strong>essor Inga Fischer-Hjalmars <strong>of</strong> the Swedish Royal<br />

Academy <strong>of</strong> Sciences<br />

4.1 Graph rewriting<br />

This section summarizes the work <strong>of</strong> Dörr [29] and [37] and explains how it<br />

can be applied to the problem <strong>of</strong> implementing chemical reactions.<br />

As we represented molecules as graphs, it is natural to simulate the set<br />

<strong>of</strong> reactions by generic reactions (see sect. 2.2) in the framework <strong>of</strong> a graph<br />

grammar [82, 97]. A graph grammar is a finite set <strong>of</strong> rules operating on<br />

edge and vertex labeled graphs. The term “graph grammar” is rather used<br />

for graph-generating applications. In our context, the similar term “graph<br />

rewriting system” used for graph-transforming application is more appropriate.<br />

Graph transformations have been studied first 30 years ago [84] for the<br />

generation, manipulation, recognition <strong>of</strong> graphs. Four types <strong>of</strong> applications<br />

35

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!