<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Parameter Engineering vs. Parameter Tuning: the Case of Biochemical Coordination in MoK</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefano Mariani</string-name>
          <email>a@x</email>
          <email>a@y</email>
          <email>s.mariani@unibo.it</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>ALMA MATER STUDIORUM-Universita` di Bologna</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>-To cope with nowadays MAS complexity, natureinspired coordination models and languages gained increasing attention: in particular, biochemical coordination models. Being intrinsically stochastic and self-organising, the effectiveness of their outcome likely depends on a correct parameter tuning stage. In this paper, we focus on chemical reactions rates, showing that simply imitating chemistry “as it is” may be not enough for the purpose of effectively engineer complex, self-organising coordinated systems such as MoK .</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>I. INTRODUCTION</title>
      <p>Nowadays MAS are demanding new paradigms and
abstractions to deal with their increasing complexity [1]. Such
complexity is mostly due to the number and nature of
interactions happening within and between MAS [2], [3].
Coordination models and languages – whose main goal is to govern
such interactions [4] – have historically drawn inspiration
from self-organising coordination in natural phenomena—
e.g., pheromone-based [5] and chemical [6] coordination.
Among the many, biochemical coordination has been shown
to be particularly effective [7], [8]. Here, there is no central
authority ruling the interaction space. Instead, a number of
local, stochastic coordination rules, to which all the interacting
agents “implicitly” obey – as they are the “laws of nature” –
drive MAS coordination. Thus, it happens by emergence as
a consequence of the self-organisation between MAS
coordinated entities. Being a self-organising process, coordination
effectiveness likely depends on a correct parameter tuning
stage, often performed in loop with a simulation stage [9].</p>
      <p>In the case of biochemical coordination, being the “laws
of nature” the (artificial) chemical reactions installed in the
coordination medium, such parameters are, e.g., the rate of
application of a chemical reaction, the concentration of the
chemicals participating the reaction and their stoichiometry—
the “extent” to which chemicals participate. In this paper, we
focus on rates, aiming at a twofold goal:
on one hand, showing that the law of mass action
for rate expressions may be not enough to effectively
engineer a biochemical coordination middleware
on the other hand, highlighting that designing arbitrary
functional rates demands for a disciplined and
principled approach different from “parameter tuning”,
which we call parameter engineering.</p>
      <p>In particular, such goals are defined w.r.t. the MoK model
and the BioPEPA tool, used as the subject and the means
of investigation, respectively. Nevertheless, a generalisation
of such goals suitable for any kind of nature-inspired MAS
is possible. First of all, the fact that a given natural system
works properly relying on a given set of parameters, each of
which has a given set of functional dependencies with others,
doesn’t necessarily mean that the same sets of parameters
and functional dependencies will work for an artificial system
drawing inspiration from the natural one. Then, to proficiently
identify the relevant parameters and engineer their (possibly
reciprocal) functional dependencies, a proper methodology is
needed—which will likely rely on simulations.</p>
      <p>Accordingly, the remainder of the paper is organized as
follows: Section II explains what biochemical coordination
is (Subsection II-A) and reminds the importance of
simulation tools for self-organising systems development
(Subsection II-B), also describing the MoK model (Subsection II-A1)
as well as the BioPEPA tool (Subsection II-B1); Section III
conveys the main contribution of the paper, introducing and
motivating the notion of parameter engineering through a
number of functional rates engineering examples; finally,
Section IV concludes also giving some hints about further works.</p>
      <p>II.</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND</title>
      <sec id="sec-2-1">
        <title>A. Biochemical Coordination</title>
        <p>The chemical metaphor appears particularly appealing for
MAS coordination due to the simplicity of its foundation
[6]. The idea is to coordinate any MAS entity (agents as
well as information) as “molecules” floating in a chemical
“solution”, whose evolution is driven by chemical “reactions”
continuously and spontaneously consuming and producing
molecules. As many chemical reactions can occur at a given
time, chemical solution evolution is driven by race conditions
among their rates, which means certain reactions are
stochastically executing over others—as in chemistry actually is [10].</p>
        <p>Biochemical tuple spaces [7] enhance such metaphor by
adding a spatial abstraction: the compartment. A compartment
is a tuple space equipped with biochemical reactions, driving
the evolution of the molecules floating in it. Compartments
may be networked in “neighbourhoods” as in chemistry
happens through membranes, so as to shape more complex spatial
structures—such as tissues and organs. Computationally,
biochemical tuple spaces are a stochastic extension of the LINDA
model [11]: the idea is to equip each tuple with a
“concentration” value, representing a measure of the pertinency/activity
of the tuple (molecule) within the space (compartment)—
the higher it is, the more likely and frequently the tuple
will influence system coordination [7]. Such concentration is
evolved by biochemical rules installed into the compartment,
affecting concentration values over time exactly in the same
way chemical substances evolve into chemical solutions [10]—
that is, according to the law of mass action [12], [10].</p>
        <p>The law of mass action is1 a mathematical model that
explains and predicts the behaviour of solutions in dynamic
equilibrium. It can be described with respect to two aspects:
(i) the equilibrium aspect, concerning the composition of a
reaction mixture at equilibrium and (ii) the kinetic aspect,
concerning the rate equations for elementary reactions. The
law states that the rate of an elementary reaction (rf ) – a
reaction that proceeds through only one transition state, that is
one mechanistic step – is proportional (kf ) to the product of
the concentrations of the participating molecules (R1; R2):
rf = kf [R1][R2]
kf is called rate constant and, in chemistry, is a function of
participating molecules affinity—to learn more, please refer to
[12] and therein cited bibliography.</p>
        <p>The MoK model, briefly described in next section, models
MAS coordinated entities as well as coordination processes
by (i) adopting the chemical metaphor abstractions and (ii)
borrowing (to some extent) from biochemical tuple spaces the
computational model.</p>
        <p>1) The MoK Model: M olecules of K nowledge [13]
(MoK for short) is a model for knowledge self-organisation
in MAS. The main goals of MoK are:
to let information chunks autonomously aggregate into
heaps of knowledge
to let knowledge autonomously flow toward the
interested agents—rather than be searched
Here follows a brief summary of MoK model components—
consider reading [13] and [14] for MoK formalisation and
early application respectively:</p>
        <p>MoK atoms — produced by a given source to convey
an “atomic piece of information”, atoms should also
store some metadata to ease semantic characterisation
MoK molecules — “heaps” for information
aggregation, they cluster together semantically related atoms
MoK enzymes — enzymes reify knowledge-oriented
(inter-)actions made by agents and are meant to
influence molecules’ concentration2
FM oK function — as a knowledge-driven model,
MoK must have a way to determine the
semantic correlation between information, therefore, the
MoK function FM oK should be defined, taking two
molecules and returning a value m 2 [0; 1].</p>
        <p>MoK reactions — the behaviour of a MoK system is
determined by biochemical reactions, which
stochastically – according to their rate – drive molecules
aggregation, reinforcement, decay, and diffusion:
Aggregation3 — bounds together semantically
related molecules
Reinforcement — consumes an enzyme to
reinforce the related molecule
enzyme(Molecule1) + Moleculec1 7 !rreinf</p>
        <p>Moleculec1+1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Decay — enforcing time situatedness, molecules should fade away as time passes</title>
      <p>Moleculec 7 !rdecay Moleculec 1</p>
    </sec>
    <sec id="sec-4">
      <title>Diffusion — space situatedness is inspired by biology, therefore based upon diffusion to neighbouring compartments (tuple spaces)</title>
      <p>fMolefcMuloel1ecSulMeso1lgeciul+esf1Mgoil+ecuflMeso2leScuMleosl2egcuilie17g!iridi usion
These four biochemical reactions are the minimum set of
coordination mechanisms believed (at the moment) to be
necessary and sufficient to properly drive a MoK -coordinated
MAS toward the desired behaviour regarding knowledge
selforganisation. Nevertheless, this set may be refined and
extended if its lack of expressiveness w.r.t. MoK desiderata
becomes evident. Anyway, having a well-defined set of primitives
is a necessary step to start distinguishing what sorts of
selforganising behaviours can and cannot be achieved with MoK .</p>
      <p>In fact, once such primitives are fixed, we can focus on the
issue of properly engineering their rate expressions—rreinf ,
rdecay, rdiffusion. In particular: is it sufficient to stick with the
law of mass action to achieve MoK goals, or should we build
our “custom” functional dependencies? If so, which parameters
and which kind of dependencies (direct, inverse, etc.) are to
be used in each rate expression? And how can MAS designers
make such decisions?</p>
      <p>Section III answers these questions through a number of
examples exploiting the BioPEPA simulation tool – briefly
described in next section – to analyse different alternatives
regarding MoK reactions rate expressions.</p>
      <sec id="sec-4-1">
        <title>B. Biochemical Simulation</title>
        <p>Simulation has been widely recognized as a fundamental
development stage in the process of designing and
implementing both MAS as well as biochemical processes [16], [9]. This
is mostly due to the high number of system parameters needed,
the huge number of local interactions between components, the
influence of randomness and probability on system evolution.
A number of different simulation tools capable of modeling
biochemical-like processes exist, either born in the
biochemistry field (see [17] for a survey) or in the (Multi-)Agent Based
Simulation research area (survey in [18]). Among the many,
ALCHEMIST [19], PRISM [20], and BioPEPA [12] at least,
are worth to be mentioned. Our choice fell on the latter for its
appealing features – briefly described in next section – which
perfectly suit the purpose of the paper.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>1From http://en.wikipedia.org/wiki/Law of mass action.</title>
      <p>2Please, notice that an atom is a “singleton molecule”, hence the term
“molecule” will be used also for “atom” from now on.</p>
      <p>3Aggregation reaction formalisation is not shown here because it has been
left out from BioPEPA simulations for the lack of expressiveness of the tool.
To learn more, please refer to the technical report [15].</p>
      <p>1) The Bio-PEPA Tool: BioPEPA [12] is a language for
modeling and analysis of biochemical processes. It is based on
PEPA [21], a process algebra originally aimed at performance
analysis of software systems, extending it to deal with some
features of biochemical networks, such as stoichiometry and
different kinds of kinetic laws—including the law of mass
action. The most appealing features of BioPEPA are:
custom kinetic laws represented by means of
functional rates
definition of stoichiometry (“how many” molecules of
a given kind participate) and role played by the species
(reactant, product, enzyme, . . . ) in a given reaction
theoretical roots in CTMC semantics—behind any
BioPEPA specification lies a stochastic labelled
transition system modeling a CTMC
In BioPEPA, rate expressions are defined as mathematical
equations involving reactants’ concentrations (denoted with
the reactant name and dynamically computed at run-time)
and supporting mathematical operators (e.g. exp and log
functions) as well as built-in kinetic laws (e.g. the law of mass
action, denoted with the keyword fMA) and time dependency
(through the variable time, changing value dynamically
according to the current simulation time step)4. The BioPEPA
Eclipse plugin5 is the tool used in next section to investigate
MoK reactions’ rates influence on system behaviour.</p>
      <p>III.</p>
    </sec>
    <sec id="sec-6">
      <title>PARAMETER ENGINEERING IN RATE EXPRESSIONS</title>
      <p>As far as nature-inspired MAS are concerned, simulation
tools are usually exploited to study how those parameters
inherited from the natural metaphor influence the overall MAS
behaviour. This is done with the aim to fine-tune such
parameters value so as to get the better run-time “performances”—
whatever this means (often, a behaviour closer to that exhibited
in nature).</p>
      <p>But, what about the question of wether the natural system’s
parameters are well suited also for the artificial one? In
particular, w.r.t. biochemical coordination (thus, MoK also):
what about shaping our own rate expressions for biochemical
reactions rather than blindly relying on the law of mass action
to define their functional dependencies? Do we gain any
improvement w.r.t. the overall coordinated MAS behaviour?
Furthermore: can the same improvement be achieved by simply
fine-tuning the natural system’s parameters as they are in
nature (e.g. the law of mass action constant rate)?</p>
      <p>Through the following experiments, we aim at answering
this kind of questions, hopefully achieving our twofold goal:
showing that the law of mass action is too weak
to effectively express a number of self-organising
behaviours—such as MoK ’s
highlighting that shaping custom functional
dependencies for rate expressions is a complex task demanding</p>
    </sec>
    <sec id="sec-7">
      <title>4To learn more about BioPEPA syntax, please refer to [12].</title>
      <p>5Instructions on how to install at http://homepages.inf.ed.ac.uk/s9552712/
bio-pepa/download.html, manual at http://homepages.inf.ed.ac.uk/stg/research/
biopepa/eclipse/manual/manual.pdf
a well-engineered approach—indeed, parameter
engineering prior to parameter tuning
By generalisation, our first goal aims at showing there is the
need to consider re-engineering natural system’s parameters, as
well as their functional dependencies, so as to better cope with
the problem at hand—as done with other natural metaphors:
most notably, the ACO approach to distributed optimisation, in
which the original “ant” metaphor is indeed just a metaphor,
not the actual implementation [22].</p>
      <p>Therefore, for each of the following experiments, we (i)
identify which are the desiderata for the MAS run-time
behaviour, (ii) engineer rates by designing functional
dependencies which are likely to pursue the chosen goal, (iii) include a
pure parameter tuning stage to fine-tune the MAS behaviour (if
needed). All of this is done one reaction (coordination policy)
at a time, thus one functional rate at a time, incrementally
accumulated until composing the whole MAS behaviour. This
approach is what we call parameter engineering.</p>
      <p>Furthermore, a principle we believe to be extremely
important for engineering self-organsing systems will be kept in
mind: keeping the number of external parameters as small as
possible. For “external” we mean parameters which are ad hoc
added to the coordination model – MoK in our case – to better
design functional rate expressions—e.g., the law of mass action
constant rate. On the contrary, internal parameters are those
already present in the coordinated MAS—e.g., in the case of
MoK , the concentration of the reactants or the time flowing.
The advantage of using internal parameters as opposed to
external ones, lies in the fact that a system using more internal
parameters than external ones is much more adaptive and
selfregulating, since it only relies on “within-system” information
rather than on “outside-system” data to dynamically adjust its
behaviour—in the case of MoK , reactions’ rates.</p>
      <sec id="sec-7-1">
        <title>Technical Notes on Experiments: Each of the following</title>
        <p>experiments has been performed by using Gillespie’s stochastic
simulation algorithm in 30 independent replications. Each of
the following plots has been directly generated from BioPEPA
as a result of the correspondent experiment—hence, of the 30
Gillespie runs. In each chart, the x-axis plots the time steps of
the simulation, whereas the y-axis the concentration level of
the reactants expressed in units of molecules.</p>
      </sec>
      <sec id="sec-7-2">
        <title>A. Injection Rate</title>
        <p>Althought injection of atoms into a MoK compartment is
not yet part of MoK ’s core set of formalised reactions, its
influence on the system is so important to deserve its own
analysis. Basically, injection can be described as follows:</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Injection — Produces atoms out of sources without consuming them</title>
      <p>source(Molecule 1) + Molecule c1 7 !rinj</p>
      <p>source(Molecule 1) + Molecule c1+1
Two contrasting needs have to be addressed: on one hand,
atoms should be perpetually injected into the MAS, since there
is no way to know a-priori when some information will be
useful; on the other hand, we would likely avoid flooding the
system without any control on how many atoms are in play.
Thus, three options are viable:</p>
    </sec>
    <sec id="sec-9">
      <title>1) make injection rates decreasing as time passes 2) enforce some kind of “saturation” to stop injection 3) a combination of the two</title>
      <p>
        1 // option (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
2 injE = [source_economics/atom_economics * (1 / (1 + time))];
3 // option (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
4 injS = [source_sports - atom_sports];
5 // option (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
6 injC = [(1 / (1 + time)) * (source_crime - atom_crime)];
7 // option (
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
8 injP = [fMA(0.05)];
      </p>
      <p>
        Clearly, using rate expressions based on the law of mass
action is out of question: its behaviour follows none of MoK
injection reaction desiderata. Once discarded also option (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ),
whose trend is clearly too slow in reaching saturation, options
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) and (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) may seem almost identical. Actually they are not:
option (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) is “saturation-driven” only, thus if at some
point in time atom_sports will suddenly decrease
in concentration – e.g. due to agents consuming them –
they will go back to saturation-level as fast as possible,
no matter how long their sources are within the system
option (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) instead, makes the saturation
process time-dependant. In particular, the longer
source_sports are within the system, the slower
saturation will be
Choosing among the two depends on the application-specific
context in which the MoK model is used. In MoK -News
[14], e.g., option (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) is better, since in the news management
scenario information (on average) loses relevance as time
passes.
      </p>
      <sec id="sec-9-1">
        <title>B. Decay Rate</title>
        <p>MoK decay reaction is an effective way to resemble the
relationship between information relevance and time flow.
Furthermore, decay enforces a kind of negative feedback which,
together with the positive feedback provided by MoK
enzymes, enables the feedback loop peculiar of natural systems.</p>
        <p>
          Time dependency alone is not enough for a meaningful
decay behaviour: by using, e.g., a fixed rate we end-up simply
slowing down the saturation process provided by injection
reaction. Hence, Fig. 3 shows three different combinations
of time dependency and concentration dependency for MoK
decay reaction—a fourth one (yellow line), based on the law
of mass action, is given for comparison purpose:
1) linear time dependency + relative concentration
dependency (blue dashed line)
2) logarithmic time dependency + relative concentration
dependency (red line)
3) linear time dependency + built-in law of mass action
(green dashed line)
Fig. 4 shows the BioPEPA functional rates specification used6.
Again, the law of mass action is unsatisfactory, as well as
option (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ). Options (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) and (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) are both viable solutions instead.
The choice is mostly driven by how fast are the dynamics
of the scenario in which MoK has to be deployed, thus how
fast information should lose relevance—e.g., in MoK -News,
choice (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) has been preferred. Nevertheless, please notice that
option (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) has an additional parameter w.r.t. option (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ): the
law of mass action “rate constant”. Furthermore, even if such
parameter is made dynamic – e.g. the ratio between sources
and atoms concentrations as done in options (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ); (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) – the
6Actually, the Heaviside function has been also used to counter BioPEPA
setting which allows rates to become negative—see [12].
trend still would not match our desiderata for MoK decay
reaction—compare with yellow line of Figure 4 in [15].
        </p>
      </sec>
      <sec id="sec-9-2">
        <title>C. Reinforcement Rate</title>
        <p>
          To properly engineer MoK reinforcement reaction rate,
we have to keep in mind what enzymes are meant for, that
is, (i) representing a situated interest manifested by an agent
w.r.t. a piece of knowledge – an atom or a molecule –
(ii) to be exploited to reinforce such knowledge “relevance”
within the MAS. With the word “situated” we mean that
reinforcement should take into account the situatedness of
agents (inter-)actions along a number of dimensions: time,
space, type—a “search” action, a “read” action, etc. For these
reasons, MoK reinforcement reaction rate should:
be prompt, that is rapidly increase
concentration—despite decay
molecules
limited both in time and space, to resemble relevance
relationship with situatedness of (inter-)actions
depend on the (inter-)action type—e.g. a “read” action
could inject more enzymes and/or reinforce atoms
with greater stoichiometry w.r.t. a “search” action
with the law of mass action alone is out of question: option
(
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) – dashed blue line –, even if adopting a dynamic rate
constant, exhibits an exceedingly high and fast peak, option
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) – red line –, using a fixed rate constant (as in the law
of mass action typically is), almost completely ignores the
feedback—enzymes are too slowly consumed (orange line,
plotting enzymes concentration).
        </p>
        <p>Furthermore, Fig. 7 and Fig. 8 show, respectively, how
concentration and stoichiometry can influence MoK
reinforcement reaction behaviour, effectively modeling situatedness—
in particular, what we called the “type” of (inter-)actions. In
fact, (i) in Fig. 7 the initial concentration of “red” enzymes
(red line) is doubled w.r.t. “yellow” enzymes (yellow line) in
Fig. 6: as a result, the “duration” of the feedback is doubled as
well; (ii) in Fig. 8 the stoichiometry of “red” atoms (red line) in
reinforcement reaction is doubled w.r.t. “yellow” atoms (yellow
line) in Fig. 6: as a result, the “intensity” of the feedback is
more than doubled.</p>
        <p>Notice also: (i) Fig. 7 shows the opposite holds too, that
is, halving the initial concentration halves the duration of the
feedback (yellow and blue lines); (ii) Fig. 8 shows that no
interference happens between concentration and stoichiometry
parameters, in fact, reinforcement lasts as long as in Fig. 7.</p>
      </sec>
      <sec id="sec-9-3">
        <title>D. Diffusion Rate</title>
        <p>As regards MoK diffusion reaction, the topology depicted
in Fig. 9 has been taken as a reference. Namely, four MoK
compartments are imagined to be connected one to each other,
allowing in principle any molecule to move anywhere.
Fig. 8. Atoms stoichiometry increment effect on reinforcement.</p>
        <p>MoK topology to experiment with diffusion reaction.</p>
        <p>Our main desiderata regarding MoK diffusion reaction are
similar to those of MoK injection reaction: on one hand, we
would like to perpetually spread information around, because
agents working in other compartments may be interested in it;
on the other hand, we would also like to keep some degree of
control about “how much” information is moved around. Such
“degree of control” can be achieved by reusing the concept
of “saturation”, as shown by Fig. 11: in particular, it seems
reasonable to allow only a fraction of molecules to move from
their “origin” compartment—see Fig. 10. In practice, we can
Fig. 10. Notation r@c refers to the concentration of reactant r in compartment
c. Previous listings did not follow such notation because there was only a
single compartment—MoK diffusion was not considered.
arbitrarily decrease/increase the saturation-level of the origin
compartment in the destination compartment. Furthermore,
they are functionally related. As a side note, notice a diffusion
reaction featuring the law of mass action is not depicted. The
motivation is that it exhibits an unexpected “malfunctioning”
affecting also other reactions. More on this “interference
problem” in next section.</p>
      </sec>
      <sec id="sec-9-4">
        <title>E. On the Problem of Interference Between Reactions</title>
        <p>All the experiments in the paper have been conducted
incrementally, that is, each MoK reaction has been added to
the BioPEPA specification one at a time. As reported in [15],
when adding diffusion to other MoK behaviours, BioPEPA
plots highlighted some interference between reactions. E.g.,
Fig. 12 depicts what happened when reinforcement has been
added to injection, decay and diffusion.</p>
        <p>
          A number of unexpected behaviours can be seen:
first of all, our desiderata for MoK reinforcement
reaction are not met (dashed blue line). In
particular, it seems atoms cannot go beyond their original
compartment concentration level (yellow line)
second, enzymes are not fully depleted (orange line)
last but not least, other atoms are affected by a
successful application of MoK reinforcement reaction
(yellow, red and green lines): in particular, in the time
interval during which enzymes are consumed all other
trends experiment some fluctuations
The reason at the root of all these issues is still unknown:
being chemical-like reactions scheduling essentially based on
race conditions between the correspondent functional rates
– evaluated at a given point in time –, understanding what
exactly happens within the system at a given time step is not
trivial at all—or even impossible, depending on the debugging
services the simulation tool adopted provides. Nevertheless,
the satisfactory BioPEPA specification shown in Fig. 13 has
been found. In particular, MoK reinforcement reaction rate
has been added a “feed factor” parameter, used to weight the
influence of the atoms to be reinforced w.r.t. the concentration
of the corresponding source in the compartment the latter
belongs to. Fig. 14 shows that our desiderata are now met
1 // feed factor &gt; 1
2 FF = 2;
3 // option (
          <xref ref-type="bibr" rid="ref1">1</xref>
          )-revised
4 feedEC = [se@economics / (ae@crime * FF)];
        </p>
        <p>Fig. 13. Adjusted BioPEPA specification of rate expressions for MoK
reinforcement reaction used together with MoK diffusion reaction.
successfully. Although not shown here for the lack of space,
also the functional dependencies on enzymes concentration and
atoms stoichiometry shown in Fig. 7 and Fig. 8 are preserved.</p>
        <p>This clearly demonstrates the intricacies behind rates
design in biochemical coordination, therefore motivating the
principled and disciplined – namely, engineered – approach
to parameter tuning we called parameter engineering.</p>
        <p>IV.</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>CONCLUSION &amp; FURTHER WORKS ROADMAP</title>
      <p>In this paper, we showed that simply imitating nature as
is may be not the optimal approach while engineering
natureinspired MAS. Indeed, once a suitable natural metaphor has
been found, MAS designers should ask themselves if the
natural system’s parameters are the optimal ones also for the
artificial system they aim to build. If it is not the case, they
should clearly state which goals their MAS is pursuing then
detects, preferably within the MAS itself, which parameters
better suits their needs as well as which (if any) functional
dependencies between such parameters better cope with the
problem their MAS aims to solve.</p>
      <p>In particular, we focussed on the case of biochemical
coordination in MoK , showing that sticking with the law of
mass action for rate expressions is not enough to model
interesting behaviours. Furthermore, designing more complex rate
expressions demands for a principled approach going beyond
parameter tuning, which we call parameter engineering, likely
to be supported by incremental simulation of each single basic
“law of nature” in play.</p>
      <p>To the best of our knowledge, no closely related works
exists to date except, to some extent, [9]. Nevertheless, we
believe our work to be complementary to that in [23] about
self-organising design patterns as well as to [9]: in fact, once
a design pattern has been recognized as a potential solution to
a given problem, a simulation stage is out of doubts useful,
therefore a parameter engineering phase necessary.</p>
      <p>As a last note, further works will be devoted to analyze
the tradeoff between designing more complex expressions and
sticking with the law of mass action at the cost employing more
(dual, complementary and/or opposite) reactions to reach the
same “complex trend” by composition.</p>
    </sec>
    <sec id="sec-11">
      <title>ACKNOWLEDGMENTS</title>
      <p>This work has been supported by the EU-FP7-FET
Proactive project SAPERE – Self-aware Pervasive Service
Ecosystems, under contract no. 256874.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Contucci</surname>
          </string-name>
          , “
          <article-title>Complexity &amp; interaction: Blurring borders between physical, computational, and social systems</article-title>
          . Preliminary notes,” in Computational Collective Intelligence.
          <article-title>Technologies and Applications, ser</article-title>
          . LNCS, C. Ba˘dica˘,
          <string-name>
            <given-names>N. T.</given-names>
            <surname>Nguyen</surname>
          </string-name>
          , and M. Brezovan, Eds., vol.
          <volume>8083</volume>
          . Springer Berlin Heidelberg,
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>10</lpage>
          , 5th International Conference (ICCCI
          <year>2013</year>
          ). Craiova, Romania,
          <fpage>11</fpage>
          -
          <lpage>13</lpage>
          Sep.
          <year>2013</year>
          , Proceedings. Invited Paper. [Online]. Available: http://dx.doi.
          <source>org/10.1007/978-3-642-40495-5 1</source>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P.</given-names>
            <surname>Wegner</surname>
          </string-name>
          , “
          <article-title>Why interaction is more powerful than algorithms</article-title>
          ,
          <source>” Communications of the ACM</source>
          , vol.
          <volume>40</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>91</lpage>
          , May
          <year>1997</year>
          . [Online]. Available: http://dx.doi.org/10.1145/253769.253801
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ricci</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          , “
          <article-title>The multidisciplinary patterns of interaction from sciences to Computer Science</article-title>
          ,” in Interactive Computation: The New Paradigm,
          <string-name>
            <given-names>D. Q.</given-names>
            <surname>Goldin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Smolka</surname>
          </string-name>
          , and P. Wegner, Eds. Springer, Sep.
          <year>2006</year>
          , pp.
          <fpage>395</fpage>
          -
          <lpage>414</lpage>
          . [Online]. Available: http://dx.doi.
          <source>org/10.1007/3-540-34874-3 15</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gelernter</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Carriero</surname>
          </string-name>
          , “
          <article-title>Coordination languages and their significance,” Communications of the ACM</article-title>
          , vol.
          <volume>35</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>107</lpage>
          ,
          <year>1992</year>
          . [Online]. Available: http://dx.doi.org/10.1145/129630.129635 P.-P. Grasse´, “
          <article-title>La reconstruction du nid et les coordinations interindividuelles chez Bellicositermes natalensis et Cubitermes sp. la the´orie de la stigmergie: Essai d'interpre´tation du comportement des termites constructeurs,” Insectes Sociaux</article-title>
          , vol.
          <volume>6</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>80</lpage>
          , Mar.
          <year>1959</year>
          . [Online]. Available: http://dx.doi.org/10.1007/BF02223791
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Bana</surname>
          </string-name>
          ˘tre, P. Fradet, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Le Me</surname>
          </string-name>
          <article-title>´tayer, “Gamma and the chemical reaction model: Fifteen years after,” in Multiset Processing</article-title>
          . Mathematical, Computer Science, and
          <article-title>Molecular Computing Points of View, ser</article-title>
          . LNCS,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Calude</surname>
          </string-name>
          , G. Pa˘un, G. Rozenberg,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Salomaa, Eds. Springer,
          <year>2001</year>
          , vol.
          <volume>2235</volume>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>44</lpage>
          . [Online]. Available: http://dx.doi.org/10.1007/3-540-45523-X 2
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Casadei</surname>
          </string-name>
          , “
          <article-title>Biochemical tuple spaces for self-organising coordination,” in Coordination Languages and Models, ser</article-title>
          . LNCS,
          <string-name>
            <given-names>J.</given-names>
            <surname>Field</surname>
          </string-name>
          and V. T. Vasconcelos, Eds. Lisbon, Portugal: Springer, Jun.
          <year>2009</year>
          , vol.
          <volume>5521</volume>
          , pp.
          <fpage>143</fpage>
          -
          <lpage>162</lpage>
          , 11th International Conference (COORDINATION
          <year>2009</year>
          ), Lisbon, Portugal, Jun.
          <year>2009</year>
          . Proceedings. [Online]. Available: http://dx.doi.org/10.1007/978-3-642
          <source>-02053-7 8</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Zambonelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Castelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Ferrari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mamei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rosi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Di</given-names>
            <surname>Marzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Risoldi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.-E.</given-names>
            <surname>Tchao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dobson</surname>
          </string-name>
          , G. Stevenson,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Ye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Nardini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montagna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ferscha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Maschek</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Wally</surname>
          </string-name>
          , “
          <article-title>Self-aware pervasive service ecosystems,” Procedia Computer Science</article-title>
          , vol.
          <volume>7</volume>
          , pp.
          <fpage>197</fpage>
          -
          <lpage>199</lpage>
          , Dec.
          <year>2011</year>
          ,
          <source>proceedings of the 2nd European Future Technologies Conference and Exhibition</source>
          <year>2011</year>
          (
          <article-title>FET 11)</article-title>
          . [Online]. Available: http://dx.doi.org/10.1016/j.procs.
          <year>2011</year>
          .
          <volume>09</volume>
          .006
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>L.</given-names>
            <surname>Gardelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          , “
          <article-title>On the role of simulations in engineering self-organising MAS: The case of an intrusion detection system in TuCSoN,” in Engineering Self-Organising Systems, ser</article-title>
          . LNAI,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Brueckner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Di Marzo Serugendo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hales</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zambonelli</surname>
          </string-name>
          , Eds. Springer,
          <year>2006</year>
          , vol.
          <volume>3910</volume>
          , pp.
          <fpage>153</fpage>
          -
          <lpage>168</lpage>
          , 3rd International Workshop (ESOA
          <year>2005</year>
          ), Utrecht, The Netherlands,
          <volume>26</volume>
          Jul.
          <year>2005</year>
          . Revised Selected Papers. [Online]. Available: http://dx.doi.org/10.1007/11734697 12
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>D. T. Gillespie</surname>
          </string-name>
          , “
          <article-title>Exact stochastic simulation of coupled chemical reactions,”</article-title>
          <source>The Journal of Physical Chemistry</source>
          , vol.
          <volume>81</volume>
          , no.
          <issue>25</issue>
          , pp.
          <fpage>2340</fpage>
          -
          <lpage>2361</lpage>
          , Dec.
          <year>1977</year>
          . [Online]. Available: http://dx.doi.org/10.1021/ j100540a008
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>D.</given-names>
            <surname>Gelernter</surname>
          </string-name>
          , “Generative communication in Linda,
          <source>” ACM Transactions on Programming Languages and Systems</source>
          , vol.
          <volume>7</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>112</lpage>
          , Jan.
          <year>1985</year>
          . [Online]. Available: http://dx.doi.org/10.1145/2363.2433
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ciocchetta</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hillston</surname>
          </string-name>
          , “
          <article-title>Bio-PEPA: A framework for the modelling and analysis of biological systems,” Theoretical Computer Science</article-title>
          , vol.
          <volume>410</volume>
          , no.
          <fpage>33</fpage>
          -
          <issue>34</issue>
          , pp.
          <fpage>3065</fpage>
          -
          <lpage>3084</lpage>
          ,
          <year>2009</year>
          , concurrent Systems Biology: To Nadia Busi (
          <year>1968</year>
          -
          <fpage>2007</fpage>
          ). [Online]. Available: http://dx.doi.org/10.1016/j.tcs.
          <year>2009</year>
          .
          <volume>02</volume>
          .037
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <given-names>S.</given-names>
            <surname>Mariani</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          , “
          <article-title>Molecules of Knowledge: Self-organisation in knowledge-intensive environments,” in Intelligent Distributed Computing VI, ser</article-title>
          . Studies in Computational Intelligence, G. Fortino, C. Ba˘dica˘,
          <string-name>
            <given-names>M.</given-names>
            <surname>Malgeri</surname>
          </string-name>
          , and R. Unland, Eds., vol.
          <volume>446</volume>
          . Springer,
          <year>2013</year>
          , pp.
          <fpage>17</fpage>
          -
          <lpage>22</lpage>
          , 6th
          <source>International Symposium on Intelligent Distributed Computing (IDC</source>
          <year>2012</year>
          ), Calabria, Italy,
          <fpage>24</fpage>
          -
          <lpage>26</lpage>
          Sep.
          <year>2012</year>
          . Proceedings. [Online]. Available: http://dx.doi.
          <source>org/10.1007/978-3-642-32524-3 4</source>
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          --, “
          <article-title>Self-organising news management: The Molecules of Knowledge approach</article-title>
          ,” in 1st International Workshop on Adaptive Service Ecosystems:
          <article-title>Natural and Socially Inspired Solutions (ASENSIS</article-title>
          <year>2012</year>
          ),
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Fernandez-Marquez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montagna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Omicini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zambonelli</surname>
          </string-name>
          , Eds.,
          <source>SASO</source>
          <year>2012</year>
          , Lyon, France, 10 Sep.
          <year>2012</year>
          , pp.
          <fpage>11</fpage>
          -
          <lpage>16</lpage>
          , preproceedings. [Online]. Available: http://dx.doi.org/10.1109/SASOW.
          <year>2012</year>
          .48
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <given-names>S.</given-names>
            <surname>Mariani</surname>
          </string-name>
          , “
          <article-title>Analysis of the Molecules of Knowledge model with the Bio-PEPA Eclipse plugin,” ALMA MATER STUDIORUM-Universita`</article-title>
          di Bologna, Bologna, Italy,
          <source>AMS Acta Technical Report 3783</source>
          , 20 Sep.
          <year>2013</year>
          . [Online]. Available: http://amsacta.unibo.it/3783/
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <given-names>E.</given-names>
            <surname>Merelli</surname>
          </string-name>
          , G. Armano,
          <string-name>
            <given-names>N.</given-names>
            <surname>Cannata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Corradini</surname>
          </string-name>
          , M.
          <string-name>
            <surname>d'Inverno</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Doms</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Lord</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Martin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Milanesi</surname>
            , S. Mo¨ ller,
            <given-names>M.</given-names>
            Schroeder, and M.
          </string-name>
          <string-name>
            <surname>Luck</surname>
          </string-name>
          , “
          <article-title>Agents in bioinformatics, computational and systems biology</article-title>
          ,” Briefings in Bioinformatics, vol.
          <volume>8</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>45</fpage>
          -
          <lpage>59</lpage>
          ,
          <year>2007</year>
          . [Online]. Available: http://dx.doi.org/10.1093/bib/bbl014
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          <string-name>
            <given-names>R.</given-names>
            <surname>Alves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Antunes</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Salvador</surname>
          </string-name>
          , “
          <article-title>Tools for kinetic modeling of biochemical networks,” Nature biotechnology</article-title>
          , vol.
          <volume>24</volume>
          , no.
          <issue>6</issue>
          , pp.
          <fpage>667</fpage>
          -
          <lpage>672</lpage>
          ,
          <year>2006</year>
          . [Online]. Available: http://dx.doi.org/10.1038/nbt0606-667
          <string-name>
            <given-names>C.</given-names>
            <surname>Nikolai</surname>
          </string-name>
          and G. Madey, “
          <article-title>Tools of the trade: A survey of various agent based modeling platforms</article-title>
          ,
          <source>” Journal of Artificial Societies and Social Simulation</source>
          , vol.
          <volume>12</volume>
          , no.
          <issue>2</issue>
          , p.
          <fpage>2</fpage>
          ,
          <year>2009</year>
          . [Online]. Available: http://jasss.soc.surrey.ac.uk/12/2/2.html
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <string-name>
            <given-names>D.</given-names>
            <surname>Pianini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montagna</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          , “
          <article-title>Chemical-oriented simulation of computational systems with Alchemist,”</article-title>
          <source>Journal of Simulation</source>
          ,
          <year>2013</year>
          . [Online]. Available: http://dx.doi.org/10.1057/jos.
          <year>2012</year>
          .27
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Kwiatkowska</surname>
          </string-name>
          , G. Norman, and
          <string-name>
            <given-names>D.</given-names>
            <surname>Parker</surname>
          </string-name>
          ,
          <source>“PRISM 4</source>
          .
          <article-title>0: Verification of probabilistic real-time systems,”</article-title>
          <source>in Proc. 23rd International Conference on Computer Aided Verification (CAV'11)</source>
          <article-title>, ser</article-title>
          . LNCS, G. Gopalakrishnan and S. Qadeer, Eds., vol.
          <volume>6806</volume>
          . Springer,
          <year>2011</year>
          , pp.
          <fpage>585</fpage>
          -
          <lpage>591</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          <string-name>
            <given-names>S.</given-names>
            <surname>Gilmore</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hillston</surname>
          </string-name>
          , “
          <article-title>The PEPA workbench: A tool to support a process algebra-based approach to performance modelling,” in Computer Performance Evaluation Modelling Techniques and Tools, ser</article-title>
          . Lecture Notes in Computer Science, G. Haring and G. Kotsis, Eds. Springer Berlin Heidelberg,
          <year>1994</year>
          , vol.
          <volume>794</volume>
          , pp.
          <fpage>353</fpage>
          -
          <lpage>368</lpage>
          . [Online]. Available: http://dx.doi.
          <source>org/10.1007/3-540-58021-2 20</source>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Dorigo</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Birattari</surname>
          </string-name>
          , “
          <article-title>Ant colony optimization,” in Encyclopedia of Machine Learning</article-title>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Sammut</surname>
          </string-name>
          and G. Webb, Eds. Springer US,
          <year>2010</year>
          , pp.
          <fpage>36</fpage>
          -
          <lpage>39</lpage>
          . [Online]. Available: http://dx.doi.
          <source>org/10.1007/ 978-0-387-30164-8 22</source>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>J.</given-names>
            <surname>Fernandez-Marquez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Marzo</given-names>
            <surname>Serugendo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Montagna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Viroli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Arcos</surname>
          </string-name>
          , “
          <article-title>Description and composition of bio-inspired design patterns: a complete overview</article-title>
          ,”
          <source>Natural Computing</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>25</lpage>
          ,
          <year>2012</year>
          . [Online]. Available: http://dx.doi.org/10.1007/s11047-012-9324-y
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>