<!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>Petri nets for modelling and analysing trophic networks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Paolo Baldan</string-name>
          <email>baldan@math.unipd.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martina Bocci</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Brigolin</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicoletta Cocco</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marta Simeoni</string-name>
          <email>simeonig@unive.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Matematica, Universita di Padova</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dipartimento di Scienze Ambientali, Informatica e Statistica, Universita Ca' Foscari di Venezia</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <volume>1373</volume>
      <fpage>21</fpage>
      <lpage>36</lpage>
      <abstract>
        <p>We consider trophic networks, a kind of networks used in ecology to represent feeding interactions (what-eats-what) in an ecosystem. We observe that trophic networks can be naturally modelled as Petri nets and this suggests the possibility of exploiting Petri nets for the analysis and simulation of trophic networks. Some preliminary steps in this directions and some ideas for future development are presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Ecosystems are very complex systems constituted by biotic communities
(populations of di erent species), abiotic components of the environment (like air,
water, soil) and interactions among these (living and non-living) elements. A branch
of ecology deals with the study of feeding relationships within ecosystems and
represents them as networks of interacting compartments called trophic networks
or food webs. Due to the common limited availability of experimental
information, a static approach (the mass balance steady state approach) to the study of
such networks has been developed as alternative to the dynamic description.</p>
      <p>Complex networks of interacting entities are widely studied in computer
science: computer networks, agent systems, and, in general, all concurrent and
distributed systems fall into this category. Uncountably many formalisms and
practical tools have been developed for the representation and analysis of
interacting systems. This suggests the possibility of reusing models and techniques
from computer science for the study of trophic networks.</p>
      <p>
        This idea is pursued in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], where the authors advocate the use of process
calculi for ecological modelling. Their claim is that the compositionality
properties of process calculi can be fruitfully exploited for a modular representation
of complex ecosystems. Moreover, process calculi provide an individual based
modelling and stochastic extensions.
      </p>
      <p>
        In this paper we explore the use of another widely used model of
concurrency, namely Petri nets [
        <xref ref-type="bibr" rid="ref11 ref19">19, 11</xref>
        ]. Petri nets permit individual based modelling,
they explicitly represent parallelism and dependencies among entities, they o er
stochastic and continuous extensions and, as a major advantage, they enable
a qualitative analysis of systems when dynamic information are not available.
Many tools for systems visualisation, analysis and simulation are also available
(see The Petri net World site [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]). In this paper we consider the representation
and analysis techniques generally adopted for trophic networks and discuss the
pros and cons of the application of Petri nets to this eld.
      </p>
      <p>The structure of the paper is as follows. In Section 2 trophic networks are
introduced with a small case study related to the Venice lagoon. In Section 3 the
main concepts in Petri nets used to model trophic networks are brie y recalled. In
Section 4 we propose a simple application of Petri nets to the representation and
analysis of trophic networks when dynamic information are not available. This
is exempli ed in the case study. Some conclusions and suggestions for further
work are given in Section 5.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Tropic Networks</title>
      <p>An ecosystem is a community of living organisms, such as plants, animals and
microbes, in conjunction with the nonliving components of their environment,
such as air, water and bioavailable organic matter (detritus), which interact as
a system. A trophic network (or food web) is a representation of feeding
interactions in an ecosystem, where the components are connected by binary links
(what-eats-what). Food webs permit to represent and analyse the trophic
structure and functioning of an ecosystem. This knowledge can be used to identify
key species and to detect anthropogenic impacts, such as the e ects of pollution,
of physical disturbance, of resources exploitation, etc. Real trophic networks are
very complex, hence models provide partial and abstract representations where,
for instance, similar species are aggregated into groups with similar feeding
behaviour. Model representation of a trophic network generally focuses on the
uxes of energy or biomass between nodes. Such uxes are directional and
generally encompass some very relevant organism-level processes, such as production,
consumption, assimilation, predation, non-predatory mortality and respiration.
An ecosystem is generally an open system, i.e. there are ows of material or
energy between the system and the rest of the world. For this reason, when
representing and analysing trophic networks, generally also the input and output
ows are taken into account. Inputs can be primary production, immigration or
incoming of detrital matter into the system, while outputs can be emigration,
harvesting by humans and exit of detrital matter from the system. Some energy
may be dissipated into heat (respiration) or some material may be degraded into
its lowest energy form (detritus).</p>
      <p>
        Knowledge on the species present in the studied ecosystem and on their
feeding behaviour is a needed prerequisite for representing the trophic network. First
of all it is necessary to single out the n living and non-living compartments to be
represented. A compartment can represent a population of a given species or of
some aggregation of species with comparable feeding habits. For each
compartment it is necessary to determine which other taxa are included in its diet, thus
Nocost. Flux
1 CO2!PHP
2 input!DET
3 PHP!MIZ
4 PHP!MEZ
5 PHP!DET
6 PHP!TAP
7 DET!BPL
8 BPL!CO2
9 BPL!MEZ
10 BPL!MIZ
11 BPL!TAP
12 MIZ!MIZ
13 MIZ!DET
14 MIZ!CO2
15 MIZ!MEZ
16 MIZ!TAP
17 MEZ!MEZ
18 MEZ!DET
19 MEZ!CO2
20 TAP!DET
21 TAP!CO2
22 TAP!Harvesting
23 DET!TAP
24 DET!Export
specifying the interactions among species or groups of species. These information
determine the network topology, which already provides some relevant insights
on the features of the ecosystem. It is normally represented as a directed graph
where each node represents a compartment and each arc denotes an interaction
between the source and target nodes. More precisely, an arc from node A to node
B represents a ow of energy or biomass from A to B. A common convention
is to depict dissipation for some node with an arc outgoing from the node and
ending in the ground symbol of electrical circuits [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. A quantity may be
associated with each arc, representing the magnitude of biomass or energy ow or
the relative occurrence of such a ow. The resulting graph is a directed weighted
graph.
      </p>
      <p>
        The graph of a simple planktonic trophic network of the Venice Lagoon,
taken from [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], is shown in Figure 1 (left). Numbers on arrows indicate the
uxes, which are listed in Figure 1 (right). The compartments considered are
phytoplankton (PHP), bacterioplankton (BPL), microzooplankton (MIZ),
mesozooplankton (MEZ), R. philippinarum (TAP) and organic detritus (DET). The
network provides a representation of the food items digested and assimilated by
R. philippinarum (a marine bivalve mollusk), namely, green algae,
cyanobacteria, diatoms, bacterioplankton, microzooplankton, and dead, dissolved, and/or
particulate organic matter.
      </p>
      <p>This trophic network has some peculiarities:
{ dissipation (respiration) of PHP is not considered because the ow from CO2
to PHP models the net photosynthetic production, known from experimental
data, i.e. the CO2 needed for respiration has been already subtracted;
{ ow from BPL to DET (mortality of BPL) is not considered because it is
known to be negligible by experimental data;
{ ows from TAP, MEZ and MIZ to DET include both natural mortality and
production of faeces;
{ ow from PHP to DET indicates only mortality, because PHP does not
produce faeces;
{ in the case of MIZ and MEZ cannibalism is represented by arrows exiting
and entering in the same compartment ( ows 12 and 17).</p>
      <p>
        From the topology of the graph, or the corresponding adjacency matrix, some
information about system behaviour can be derived. Clearly the adjacency matrix
does not represent the information on weights of the interactions. For this reason
various other matrices have been de ned and used for analysis purposes, such as
the matrix of dietary coe cients, the Leontief structure matrix, the total
dependency matrix and many others which express di erent views of the network in
relation to structural and quantitative dependencies among compartments [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ].
The main advantage of a matrix representation of a trophic network is that
linear algebra techniques can be applied and in fact matrix methods are the most
used for static analysis of trophic networks (e.g. I-O modelling techniques for
economics modi ed for ecosystems [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]).
      </p>
      <p>
        To move from purely topological analysis of a trophic network to quantitative
analysis, ecologists need quantitative data. Estimation of biomass and knowledge
of several rates (e.g. production rate, consumption rate, respiration rate, etc.)
are needed to quantify ows among compartments, together with quantitative
knowledge about diet composition of each living compartment. Some
information on primary production, speci c consumption rates and diet compositions
can be gained from eld and laboratory studies but it is unfeasible to
determine the magnitudes of all ows in the system directly. It becomes necessary,
therefore, to estimate the magnitudes of some of them by indirect means. A
helpful approach for estimating unknown ows consists in assuming the
balance of inputs and outputs for each compartment. If a su ciently long time
period is considered, mass balance in each node of the network is a reasonable
assumption because of the conservation of mass principle. Under the mass
balance assumption, the system is represented as a steady state snapshot of energy
ows, averaged over time. Di erent techniques are used for the trophic network
reconstruction, that is to infer unspeci ed ows by solving the balance
equations and satisfying the constraints among the ows in the system. The problem
is generally underdetermined and an in nite number of solutions comply with
the data set and the mass balance assumption. One technique is the Inverse
Model (IM), which has been rstly applied to trophic network in [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] and it has
become quite common among ecologists. IM combines mass balance equations,
data equations and constraints on the ows expressed as inequalities. It nds a
unique solution based on some optimisation criteria, for example by minimising
the sum of squared ows, which corresponds to the most parsimonious solution.
The package LIM implements linear inverse models in R [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. Another freely
available popular automated balancing routine that supports representation of
trophic networks, estimation of unknown ows and ecological network analysis
is Ecopath [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and its evolutions Ecopath-Ecosym-Ecospace [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ].
      </p>
      <p>
        Several analyses on ecological networks have been de ned in the last decades.
Some of them are based only on the topology of the model, for instance
determining food chain length, connectance and the presence of cycles. In a balanced
model it is possible to study both qualitative and quantitative properties
measured by global system status indexes such as degree of recycling [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], stability [
        <xref ref-type="bibr" rid="ref16 ref30">16,
30</xref>
        ], development [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], ascendency [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] and maturity [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Analysis of recycling
is intended to characterise how the biomass or energy is reused in a trophic
network. Such analysis requires the topology of pathways over which the medium
is recycled, as well as the amounts of material cycling in each loop. In [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] the
author proposes to do this into two steps: rst all simple cycles in the network
are identi ed, then cycled ows are separated from straight-through ows and a
technique is proposed to identify and subtract them from the original network.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Petri Nets</title>
      <p>
        Petri nets are a well known formalism originally introduced in computer science
for modelling discrete concurrent systems. Petri nets have a sound theory and
many applications which are not limited to computer science (see, e.g., [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]
and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] for surveys). A large number of tools have been developed for analysing
Petri nets (see a list at the Petri Nets World site [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]).
      </p>
      <p>We denote a basic Petri net by N = (P; T; W; M0), where P = fp1; : : : ; png
is the set of places, T = ft1; : : : ; tmg is the set of transitions, W : (P T ) [
(T P ) ! N is the weight function and M0 is the initial marking of the net, an
n-dimensional integer vector assigning to each place its initial number of tokens.</p>
      <p>We write t for the pre-condition of a transitions t, namely the n-dimensional
vector t = (i1; : : : ; in), where ij = W (pj ; t) for j 2 f1; : : : ; ng. Sometimes it
will be confused with its support, i.e., the set of places fpj j ij &gt; 0g. The
post-condition t+ = (o1; : : : ; on) is de ned dually.</p>
      <p>The incidence matrix of a Petri net N , denoted by AN , is the n m matrix
which has a row for each place and a column for each transition. The column
associated with transition t is the vector (t+ t )T , which represents the marking
change due to the ring of t.</p>
      <p>Depending on the available information, Petri nets may permit to represent
and study a system qualitatively, based only on the graph structure, as much as
quantitatively or dynamically. An interesting structural analysis is based on the
incidence matrix and it aims to determine the so-called invariants of the net.
We focus here on T-invariants. Let N be a Petri net, with m transitions and
n places, a T-invariant (transition invariant) of N is a multiset of transitions
whose execution starting from a state will bring the system back to the same
state, namely it is an m-dimensional vector in which each component represents
the number of times that a transition should re to take the net from a state M
back to M itself. It can be obtained as a solution of the equation
AN</p>
      <p>X = 0; where X = (x1; : : : ; xm)T</p>
      <p>and xi 2 N; for i 2 f1; : : : ; mg:</p>
      <p>
        A T-invariant X 6= 0 indicates that the system can cycle on a state M enabling
the cycle. As discussed in [
        <xref ref-type="bibr" rid="ref13 ref18">13, 18</xref>
        ], T-invariants admit two possible
interpretations. On the one hand, the components of a T-invariant represent a multiset of
interactions (transitions) whose partially ordered execution reproduces a given
initial state of the system (marking). On the other hand, the components of
a T-invariant may be interpreted as the relative rates of interactions
(transitions) which occur permanently and concurrently in a steady state. Minimal
T-invariants of a nite Petri net, N , form a basis, B(N ), for the set of
semipositive T-invariant (Hilbert basis [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ]). Any T-invariant can be obtained as a
linear combination, with positive integer coe cients, of elements of the basis.
Uniqueness of the basis B(N ) makes it a characteristic feature of the net N .
      </p>
      <p>
        Two subclasses of Petri nets will be of interest in the modelling of trophic
networks [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. A state machine Petri net is a Petri net where every arc has weight
one and every transition has exactly one place in its pre- and post-condition.
State machine Petri nets are conservative, namely the total number of tokens of
the system remains invariant under the occurrence of transitions. A free choice
Petri net is characterised by the fact that for any place p, either p has at most
one post-transition (i.e. no con ict) or it is the only pre-place of all its
posttransitions. The class of state machine Petri nets is strictly included in the class
of free choice Petri nets.
      </p>
      <p>
        Petri nets supply an executable speci cation: in the case of basic Petri nets,
we can play the token game, i. e. the non-deterministic ring of all the
enabled transitions. More sophisticated and realistic models and simulations can
be obtained through extended Petri net models. The most interesting in our
context are Continuous Petri nets. In Continuous Petri nets [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] the state is no
longer discrete. Places contain non-negative real numbers, called marks, usually
interpreted as the concentration of the species represented by the place. The
instantaneous ring of a transition is carried out like a continuous ow. The ring
rate expresses the \speed" of the transformation from input to output places.
The rate functions associated with transitions may follow, under simplifying
assumptions, known kinetic equations such as the mass action equation.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Petri Nets for Analysing Trophic Networks</title>
      <p>
        We start discussing how Petri nets can be used to model and analyse a trophic
network. We assume to know only the species (or compartments) and their
relations, which is the minimal knowledge generally available on a trophic network.
As a running example, we consider the trophic network TV of the Venice lagoon
in Figure 1. We illustrate how to build corresponding Petri net models and
discuss what we can obtain by applying some Petri net analysis techniques. We
use the tools Snoopy [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], Charlie [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and 4ti2 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for editing and analysing the
Petri net models.
      </p>
      <sec id="sec-4-1">
        <title>Modelling trophic networks with Petri nets</title>
        <p>Given a trophic network T , a simple Petri net model can be immediately derived
by replicating the topological structure of T in the Petri net. Recall that in
the graph representation of T each species (or compartment) is a node and a
relation between two species is a directed arc representing the ux between the
two species.</p>
        <p>A structural Petri net model of a trophic network T is the net Ns (T ) where
{ any species (or compartment) becomes a place;
{ any ow (relation) between two species S1 and S2 in T , becomes a transition
having S1 as a pre-condition and S2 as a post-condition.
{ any outgoing ow from a species S1 to the external environment (e.g.,
dissipation) in T , becomes a transition with pre-condition S1 and empty
postcondition; similarly, any incoming ow from the environment to a species
S2, becomes a transition with empty pre-condition and post-condition S2.
In absence of any information regarding the uxes, all weights are set to one.
Transitions corresponding to interactions among species are referred to as
internal transitions, while those corresponding to interactions with the environment
are referred to as interface transitions. Note that the structural Petri net model
of a trophic network is a free choice Petri net and, when restricted to internal
transitions, it is a state machine Petri net.</p>
        <p>By applying the described construction to the running example TV in
Figure 1, we obtain a structural Petri net model which is depicted in Figure 2
(for the moment, please ignore the rates associated with transitions). The net
includes six places (in yellow) representing the six compartments (DET, PHP,
BPL, MIZ, MEZ, TAP) of the trophic network, and by as many transitions as
the ows of biomass, to which we associate di erent colors to improve
readability. More speci cally, respiration ows (producing CO2) are represented by light
blue transitions; defecation ows are represented by brown transitions; mortality
ows are represented by purple transitions; input and export ows for DET, as
well as the harvesting ow for TAP are represented by red transitions;
predationprey ows are represented by white transitions.</p>
        <p>Note that transitions PHP CO2, representing respiration of PHP, and BPL DET,
representing BPL mortality in the Petri net model of Figure 2, do not have a
direct match in the trophic network TV of Figure 1. This is due to the fact
that, as already mentioned, TV was simpli ed by taking into account also some
experimental data. More precisely, the ow corresponding to PHP CO2 was
integrated in CO2 PHP (modelling CO2 needed for photosynthesis) and BPL DET
was considered irrelevant and thus omitted.
4.2</p>
        <p>Structural analysis of trophic networks modelled as Petri nets
Since the structural Petri net model strictly adheres to the graph representation
used by ecologists, it obviously enables the usual structural analyses for trophic
networks, for example to determine food chains lengths and connectance.</p>
        <p>In addition, standard structural analyses for Petri nets can be used, like those
based on T-invariants. The presence of T-invariants in a Petri net model of a
trophic network is ecologically of interest as it can reveal the presence of steady
states. The set of transitions involved in a T-invariant can be seen as a subsystem
of the original system, whose equilibrium is autonomously maintained.</p>
        <p>
          Given a trophic network T , consider the set of semi-positive T-invariants
of the structural Petri net model Ns (T ) and the corresponding Hilbert basis
B(Ns (T )), consisting of the minimal T-invariants. According to the terminology
in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], we classify T-invariants into two groups:
{ internal T-invariants, consisting of internal transitions only;
{ I/O T-invariants, which include also interface transitions.
        </p>
        <p>If we consider the elements of the basis, then for any such T-invariant I =
(x1; : : : ; xm) we have xi 1 for all i 2 f1; : : : ; mg, namely each transition occurs
at most once and the invariant is a set rather than a proper multiset. Moreover,
since Ns (T ), when restricted to the internal transitions, is a state machine, for
any pair of transitions ti; tj in the same invariant, whenever they share a place
in the pre-condition or in the post-condition, they coincide. Therefore:
{ Minimal internal invariants are simple cycles, involving only internal
transitions.
{ Minimal I/O invariants are acyclic paths, connecting two interface
transitions.</p>
        <p>
          In both cases we recover well-known concepts in trophic networks as presented,
e.g., in [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ]. The internal minimal T-invariants are Ulanowicz simple cycles,
which are associated with the internal recycling of matter. The minimal I/O
T-invariants are the Ulanowicz straight-through ows, which represent the way
energy and matter are provided by the environment, used by the network and
then (partially) released back to the environment. The correspondence is at the
structural level and the quantities of uxes are needed for Ulanowicz analyses.
        </p>
        <p>In our case study, the structural Petri net model has an Hilbert basis
consisting of 69 minimal T-invariants, nine are internal and sixty are I/O invariants. The
internal T-invariants are shown in Table 1. The rst two invariants describe the
self-predation (cannibalism) of MEZ and MIZ. All the other T-invariants
\traverse" the DET place, pointing out that Detritus is the way for recycling matter
in this network. The I/O invariants start from source transitions CO2 PHP
and input DET and end in sink transitions PHP CO2, BPL CO2, MIZ CO2,
MEZ CO2, TAP CO2 and TAP harvesting. They model trophic chains allowing
for respiration of the various compartments and for input and output of matter.
4.3</p>
      </sec>
      <sec id="sec-4-2">
        <title>T-invariant based steady state</title>
        <p>In this section we re ne the structural Petri net model of a trophic network,
turning it into a continuous Petri net model. What we obtain closely resembles
the representation of the trophic network usually adopted by ecologists, where
Inv no. Transitions
1 MEZ MEZ
2 MIZ MIZ
3 DET TAP; TAP DET
4 DET BPL; BPL DET
5 DET BPL; BPL MEZ; MEZ DET
6 DET BPL; BPL MIZ; MIZ DET
7 DET BPL; BPL TAP; TAP DET
8 DET BPL; BPL MIZ; MIZ MEZ; MEZ DET
9 DET BPL; BPL MIZ; MIZ TAP; TAP DET
the system is at a steady state and the input and output ows in all the
compartments are balanced (the mass balance assumption). The choice of considering
a continuous extension is motivated by the fact that we are modelling uxes of
biomass which better correspond to continuous uxes.</p>
        <p>
          The continuous Petri net model is still derived only from the network
topology by exploiting the minimal T-invariants in a way similar to what is done in
[
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] for Time Petri nets. A rst observation is in order.
        </p>
        <p>Remark 1. In the structural Petri net model of a trophic network Ns (T ) any
place has typically at least one incoming and one outgoing transition, otherwise
the place would unnaturally correspond to a compartment with monotonically
increasing or decreasing content. Under this assumption, Ns (T ) is covered by
T-invariants, namely each transition in the Petri net belongs to at least one
minimal T-invariant. In fact, when we exclude interface transitions Ns (T ) is
a state machine, hence for any transition, if we follow the predecessors and
successors we will get back to the transition itself (internal T-invariant) or to an
interface transition on both sides (I/O T-invariant).</p>
        <p>In order to associate rates with the transitions, we assume that each
subsystem corresponding to a minimal T-invariant
1. is active and
2. performs all its transitions once per time unit.</p>
        <p>The assumption that all minimal subsystems of an ecosystem are active is quite
reasonable from an ecological viewpoint. On the contrary the assumption that
all subsystems perform all their transitions exactly once per time unit is rather
strong and unrealistic. This is the simplest choice which can be taken in absence
of further information on the ecosystem. When additional knowledge is available,
it could be integrated in the model, as shown in the next section.</p>
        <p>Let us consider the structural Petri net model Ns (T ) of a trophic network
T as described in Section 4.1 and its Hilbert basis B(Ns (T )). According to the
assumptions above, the rate of a transition t should depend on the number
of minimal invariants in which t occurs. Then, for the trophic network T , we
de ne the simple continuous Petri net model Nc(T ) as the continuous Petri net
obtained by considering the structural model Ns (T ) as underlying Petri net and
by associating to each transition t a constant rate given by:</p>
        <p>rate(t) = jfIijIi 2 B(Ns (T )) ^ t 2 Iigj.</p>
        <p>With such rates, all the transitions in all the invariants in Nc(T ) are
performed once in one time unit and the system is in a steady state. Moreover, since
all transition arcs are 1-weighted, rates and ows per time unit coincide.
Remark 2. The continuous Petri net model of a trophic network satis es the
mass balance assumption, namely, for all compartments the sum of ingoing and
outgoing uxes coincide. This is an immediate consequence of the fact that
minimal T-invariants are simple cycles or paths. Hence, given a place p, for any
invariant Ii that \crosses" place p, one token is added to p by a transition in Ii
and one token is consumed by another transition in Ii, namely the ux owing
through p via Ii is balanced. This holds for any invariant crossing p and for any
p. Therefore, the input and output uxes coincide for any place of the network.</p>
        <p>In the simple continuous model Nc(T ), the system is represented in a steady
state, with the uxes of biomass balanced in all compartments. This corresponds
closely to the ecologists representation of a trophic network as a snapshot of the
system at steady state. Note that the continuous Petri net model Nc(T ), despite
the fact that it makes explicit some additional features, is still based only on the
topology of T : biomasses do not play a role in the de nition of the rates.</p>
        <p>For our case study, the continuous Petri net model resulting from the
construction outlined above is shown in Figure 2, where each transition have an
associated rate. Note that all places are balanced. We would like to validate
our simple continuous model by considering some basic ecological processes and
check their plausibility from an ecological point of view. For each compartment
we compute the throughput, namely the total amount of ux owing per unit of
time, in order to measure the degree of activity of the compartment. Besides we
compute food consumption (total amount of ingested food per time unit), food
assimilation (amount of ingested food minus amount of faeces, per time unit),
respiration and mortality as percentages of the consumption. Table 2 shows the
throughputs, the assimilation and respiration values as resulting from the model
compared with those found in the literature.</p>
        <p>The values derived from the simple continuous model are quite interesting.
Considering the throughput, the various compartments are ordered as follows:</p>
        <p>DET&gt;PHP&gt;BPL=TAP&gt;MIZ&gt;MEZ.</p>
        <p>We may distinguish two main groups: lower trophic level compartments (DET,
PHP and BPL), having higher throughput, and higher trophic level
compartments (TAP, MIZ and MEZ), having lower throughput. This is coherent with
the general knowledge on metabolic and growth rates of the two di erent groups
of compartments under consideration.</p>
        <p>Assimilation of the top compartment TAP is just over the maximum
indicated in the literature, while assimilation requirements for MEZ and MIZ are
perfectly met. However, MEZ assimilation is close to the lower bound of the
indicated range. This is due to the fact that MEZ is a top level compartment
in the network and no predators are modelled for it. This is a quite unrealistic
assumption: in natural systems MEZ are actually preyed by other species, like
shes. By adding an external predation on MEZ, we found that its assimilation
becomes close to TAP and MIZ assimilation values.</p>
        <p>Concerning respiration, TAP and MEZ satisfy the constraints found in the
literature, while MIZ and BPL are slightly below the indicated value. Respiration
of PHP is instead largely below the lower bound of the indicated range. The
low respiration ows for MIZ, BPL and PHP is caused by the fact that there
are only a few I/O minimal invariants involving these compartments. This is a
misbehaviour of the simple continuous model, that must be somehow overcome.</p>
        <p>Concerning mortality, for BPL it is irrelevant and this is in accordance with
experimental data (see discussion in Section 2). Mortality of PHP is instead
quite high: this is probably due to the fact that some PHP grazers, like shes
usually occurring in lagoon systems, are not modelled.</p>
        <p>
          On the whole, the continuous Petri net model realistically reproduces the
main processes of the trophic network considered in the case study. Even if it
based only on the network topology, it allows for deriving some quantitative
information on trophic network ows, which are coherent with results of
experimental measures taken in natural ecosystems. Moreover, the quantitative
validation shows that the model is somehow incomplete, signalling that two
further predation uxes, one for MEZ and one for PHP, should be represented in
the model.
MEZ
MIZ
BPL
PHP
DET
28
37
41
49
58
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] Respiration 20%
[
          <xref ref-type="bibr" rid="ref23 ref9">23, 9</xref>
          ] 40% Assimilation
[
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] Respiration 20%
[
          <xref ref-type="bibr" rid="ref23 ref9">23, 9</xref>
          ] 40% Assimilation
[
          <xref ref-type="bibr" rid="ref26 ref5">26, 5</xref>
          ] Respiration 20%
Assimilation = Consumption
[
          <xref ref-type="bibr" rid="ref3 ref32">32, 3</xref>
          ] 10% Respiration
Assimilation = Consumption
not relevant
70%
        </p>
        <p>Model values
Respiration = 36%
Assimilation = 73%
Defecation and Mortality = 27%</p>
        <p>Respiration = 37%
80% Assimilation = 39%</p>
        <p>Defecation and Mortality = 61%</p>
        <p>Respiration = 14%
80% Assimilation = 78%</p>
        <p>Defecation and Mortality = 22%
Respiration = 17%
Assimilation = Consumption</p>
        <p>Mortality = 2,4%
30% Respiration = 2%</p>
        <p>Assimilation = Consumption
Mortality = 22%
not relevant</p>
        <p>Compartment throughput Literature values</p>
        <p>
          TAP 41 [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] Respiration 20%
        </p>
        <p>
          [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ] 37% Assimilation
In the previous section we underlined some misbehaviours of the simple
continuous Petri net model. These are somehow expected since the model is only based
on the topology of the system and it relies on the strong assumption that all
subsystems proceed at the same speed. In order to adjust the model and make
it closer to the real trophic network, one can follow two directions:
1. Drop the assumption that all the subsystems perform their path exactly once
in one time unit and \speedup" some subsystems.
2. Use additional knowledge on the trophic network besides the topology, such
as the metabolism of the species or their diet, and impose some constraints
on the rates of the corresponding transitions.
        </p>
        <p>We next examine more closely these two alternatives and apply them to our
case study.</p>
        <p>Speeding-up subsystems. Recall that any linear combination of minimal T-invariants
is a T-invariant and a possible steady state of the network. Let us consider a
generic linear combination of all minimal T-invariants:</p>
        <p>X
Ii2B(Nc(T ))
kiIi ;
ki 2 R:</p>
        <p>The simple continuous model Nc(T ) corresponds to a steady state given by
a linear combination of all the minimal T-invariants where all the ki are set to
one. The re ned continuous Petri net model, Ncs (T ), is obtained from Nc(T ) by
dropping the assumption that all subsystems have the same speed and setting
the invariants constants ki to values possibly greater than one. In Ncs (T ) the
rate associated with each transition is generalised to:</p>
        <p>X
rate(t) =</p>
        <p>ki:</p>
        <p>Ii2B(Ns (T )); t2Ii</p>
        <p>The re ned continuous Petri net model Ncs (T ) still represents the trophic
network at a steady state and with all compartments balanced, since the input
and output uxes are balanced in each place for each minimal T-invariant.</p>
        <p>We applied this idea to the case study and speed up the invariants involving
respiration of PHP, BPL and MIZ, since the respiration ows of these
compartments do not satisfy the ranges indicated in the literature (see Table 2). The
new rates for the transitions are shown in Table 3.</p>
        <p>Concerning PHP, it receives in input CO2 and partially release it for
respiration. The unique I/O T-invariant for this process is fCO2 PHP; PHP CO2g. By
speeding up this invariant to run ten times per unit of time, the respiration ow
for PHP becomes the 16% of its total consumption, within the range indicated
by the literature (see Table 2).</p>
        <p>Concerning BPL, it is fed by the Detritus and part of the ingested food is used
for respiration. The invariants involving transition BPL CO2 are fCO2 PHP;
PHP DET; DET BPL; BPL CO2g and finput DET; DET BPL; BPL CO2g.
By allowing the second invariant to run three times per unit of time, respiration
of BPL become the 20% of its total consumption.</p>
        <p>Concerning MIZ, we could speedup the invariants involving MIZ CO2, namely
fCO2 PHP; PHP DET; DET MIZ; MIZ CO2g and finput DET; DET MIZ;
BPL MIZg. By allowing them to run three and two times per unit of time,
respectively, respiration of BPL becomes the 20% of its total consumption.
Assimilation of BPL becomes the 80% of the consumption, still in the range indicated
in Table 2.</p>
        <p>Including constraints in the model. The second alternative for improving the
model consists in \embedding" into the continuous Petri net model of the trophic
network some available information regarding the metabolism of the species
or their diet. We work under the simplifying assumption that ux constraints
imposed on the model are linear. This assumption is generally satis ed by the
constraints on metabolic uxes and on the diet partitions. For our case study,
some metabolic constraints taken from the literature are given in Table 2.</p>
        <p>We de ne a continuous Petri net model which structurally coincides with
Ns (T ) and whose transition rates satisfy a set of linear inequalities. As in the
previous cases, the transition rates are derived from the \speed" ki of each
minimal invariant, but now we are interested only in invariants that satisfy the
constraints. These can be obtained as solutions of a system of inequalities
AN
C X
where AN is the incidence matrix of Ns (T ). We can consider the minimal such
T-invariants, referred to as the constrained Hilbert basis BC (Ns (T )), so that any
solution of (1) will be a linear combination of elements in BC (Ns (T )).</p>
        <p>A continuous Petri net model Nc(T ; C) for the trophic network T satisfying
the constraints C is de ned as follows. The underlying Petri net is Ns (T ) and
each transition t is associated with a constant rate:</p>
        <p>rate(t) = jfIi : Ii 2 BC (Ns (T )) ^ t 2 Iigj:
In this way each transition in each constrained invariant Ii in BC (Ns (T )) can
be performed once in one time unit.</p>
        <p>When applied to our case study, this approach produces a linear system of
equalities and inequalities, where the inequalities express the literature
knowledge summarised in Table 2. By considering only the inequalities given by the
lower bounds, the constrained Hilbert basis contains 349 minimal invariants. The
induced rate constants for the extended network automatically satisfy the given
ecological constraints.</p>
        <p>The two approaches could be combined, by determining the constrained
invariants and by setting for them possibly di erent speeds.</p>
        <p>Simulations on continuous models with constant rates do not provide
meaningful information. Some hints on how to further re ne the model to do
simulation analyses are given in the conclusions.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>In this paper we explored the use of Petri nets for representing and analysing
trophic networks and our preliminary results are encouraging. A trophic network
naturally translates into a structural Petri net model which allows for recovering
classical trophic networks concepts and analyses. The structural model can be
re ned into a continuous Petri net model that closely resembles the
representation of the trophic network usually adopted by ecologists, where the system is at
a steady state and the input and output ows are balanced in all the
compartments. Despite the fact that the Petri net models proposed are still simplistic
(in particular, the continuous models have constant rates, independent of the
masses), in our case study of the Venice lagoon, the analysis of the
continuous Petri net model shows that it realistically reproduces the main ecological
processes. Furthermore, it shows that the continuous Petri net model can be
fruitfully used for an early stage validation of the trophic network under study.
Two re nements of the continuous Petri net are considered: the rst is based on
a ne tuning of the speed of the minimal T-invariants, while the second one is
based on a systematic embedding of some ecological knowledge expressed as
linear inequalities into the calculation of the Hilbert basis. This however might have
scalability problems, since the constraints increase the size of the Hilbert basis,
and the problem of determining the Hilbert basis is already in EXPSPACE.</p>
      <p>Future work deals with making the Petri net model more realistic and
dynamic, by adding biomass information on compartments. The knowledge of
biomasses at a steady state can, in fact, be used to derive constants for a
continuous model governed, e.g., by the mass action equation. We believe that
introducing rates dependent on biomasses could allow for interesting simulations,
describing, not only the steady state but also the transient behaviour leading
to such state. Additionally, on such model perturbations of the biomasses and
of the speed of the various interactions could be used for performing what-if
analyses.</p>
      <p>Acknowledgements. We are grateful to Monika Heiner and Andrea Marin for
many inspiring discussions.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>1. 4ti2 team. 4ti2|a software package for algebraic, geometric and combinatorial problems on linear spaces</article-title>
          . Available at www.4ti2.de.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>S.</given-names>
            <surname>Allesina</surname>
          </string-name>
          and
          <string-name>
            <surname>R. E. Ulanowicz.</surname>
          </string-name>
          <article-title>Cycling in ecological networks: Finn's index revisited</article-title>
          .
          <source>Computational Biology and Chemistry</source>
          ,
          <volume>28</volume>
          :
          <fpage>227</fpage>
          {
          <fpage>233</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>R.S.K.</given-names>
            <surname>Barnes</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.N.</given-names>
            <surname>Hughes</surname>
          </string-name>
          .
          <article-title>An introduction to Marine Ecology</article-title>
          . Wiley,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>D.</given-names>
            <surname>Brigolin</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Pastres</surname>
          </string-name>
          .
          <article-title>In uence of intra-seasonal variability of metabolic rates on the output of a steady-state food web model</article-title>
          . In Jordan F. and
          <string-name>
            <surname>J rgensen S</surname>
          </string-name>
          .E., editors,
          <source>Models of the Ecological Hierarchy: From Molecules to the Ecosphere, Developments in Environmental Modelling</source>
          , pages
          <volume>165</volume>
          {
          <fpage>179</fpage>
          .
          <string-name>
            <surname>Elsevier</surname>
          </string-name>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>C.A.</given-names>
            <surname>Carlson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.A.</given-names>
            <surname>Del Giorgio</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.J.</given-names>
            <surname>Herndl</surname>
          </string-name>
          .
          <article-title>Microbes and the dissipation of energy and respiration: from cells to ecosystems</article-title>
          . Oceanography,
          <volume>20</volume>
          (
          <issue>2</issue>
          ):
          <volume>89</volume>
          {
          <fpage>100</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>V.</given-names>
            <surname>Christensen</surname>
          </string-name>
          .
          <article-title>Ecopath a software balancing steady-state models and calculating network characteristics</article-title>
          .
          <source>Ecological modelling</source>
          ,
          <volume>61</volume>
          :
          <fpage>169</fpage>
          {
          <fpage>185</fpage>
          ,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>V.</given-names>
            <surname>Christensen</surname>
          </string-name>
          and
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Walters</surname>
          </string-name>
          .
          <article-title>Ecopath with Ecosim: methods, capabilities and limitations</article-title>
          .
          <source>Ecological modelling</source>
          ,
          <volume>172</volume>
          (
          <issue>2</issue>
          ):
          <volume>109</volume>
          {
          <fpage>139</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>V.</given-names>
            <surname>Christensen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Walters</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Pauly</surname>
          </string-name>
          .
          <article-title>Ecopath with ecosim: a users guide</article-title>
          .
          <source>Fisheries Centre</source>
          , University of British Columbia, Vancouver,
          <volume>154</volume>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>R.J.</given-names>
            <surname>Conover</surname>
          </string-name>
          .
          <article-title>Factors a ecting the assimilation of organic matter by zooplankton and the question of super uous feeding</article-title>
          .
          <source>Limnology and Oceanography</source>
          ,
          <volume>11</volume>
          (
          <issue>3</issue>
          ):
          <volume>346</volume>
          {
          <fpage>354</fpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>J.</given-names>
            <surname>Desel</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Esparza</surname>
          </string-name>
          . Free Choice Petri Nets. Cambridge University Press,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>J.</given-names>
            <surname>Esparza</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Nielsen</surname>
          </string-name>
          .
          <article-title>Decidability issues for Petri Nets - a survey</article-title>
          .
          <source>Journal Inform. Process. Cybernet. EIK</source>
          ,
          <volume>30</volume>
          (
          <issue>3</issue>
          ):
          <volume>143</volume>
          {
          <fpage>160</fpage>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Vezina</surname>
            <given-names>A. F.</given-names>
          </string-name>
          and
          <string-name>
            <given-names>M. L.</given-names>
            <surname>Pace</surname>
          </string-name>
          .
          <article-title>An inverse model analysis of planktonic food webs in experimental lakes</article-title>
          .
          <source>Canadian Journal of Fisheries and Aquatic Sciences</source>
          ,
          <volume>51</volume>
          (
          <issue>9</issue>
          ):
          <year>2034</year>
          {
          <year>2044</year>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>M. Heiner</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Gilbert</surname>
            , and
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Donaldson</surname>
          </string-name>
          .
          <article-title>Petri Nets for Systems and Synthetic Biology</article-title>
          .
          <source>In Proc. of SFM'08</source>
          , volume
          <volume>5016</volume>
          <source>of LNCS</source>
          , pages
          <volume>215</volume>
          {
          <fpage>264</fpage>
          . Springer,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>M. Heiner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Herajy</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Rohr</surname>
            , and
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Schwarick</surname>
          </string-name>
          .
          <article-title>Snoopy a unifying Petri net tool</article-title>
          .
          <source>In Proc. of Petri Nets</source>
          <year>2012</year>
          , volume
          <volume>7347</volume>
          <source>of LNCS</source>
          , pages
          <volume>398</volume>
          {
          <fpage>407</fpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>M. Heiner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Schwarick</surname>
            , and
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wegener</surname>
          </string-name>
          .
          <article-title>Charlie an extensible petri net analysis tool</article-title>
          .
          <source>In Proc. of Petri Nets</source>
          <year>2015</year>
          , LNCS. Springer,
          <year>2015</year>
          . to appear.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16. R. E. Heymans,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Ulanowicz</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Bondavalli</surname>
          </string-name>
          .
          <article-title>Network analysis of the south orida everglades graminoid marshes and comparison with nearby cypress ecosystems</article-title>
          .
          <source>Ecological Modelling</source>
          ,
          <volume>149</volume>
          :5{
          <fpage>23</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>F.</given-names>
            <surname>Jordan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Scotti</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Priami</surname>
          </string-name>
          .
          <article-title>Process algebra-based computational tools in ecological modelling</article-title>
          .
          <source>Ecological Complexity</source>
          ,
          <volume>8</volume>
          (
          <issue>4</issue>
          ):
          <volume>357</volume>
          {
          <fpage>363</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18. I. Koch and
          <string-name>
            <given-names>M.</given-names>
            <surname>Heiner</surname>
          </string-name>
          .
          <article-title>Petri nets</article-title>
          . In
          <string-name>
            <given-names>B. H.</given-names>
            <surname>Junker</surname>
          </string-name>
          and F. Schreiber, editors,
          <source>Analysis of Biological Networks</source>
          , Book Series in Bioinformatics, pages
          <fpage>139</fpage>
          {
          <fpage>179</fpage>
          . Wiley,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>T.</given-names>
            <surname>Murata</surname>
          </string-name>
          . Petri Nets:
          <article-title>Properties, Analysis, and Applications</article-title>
          .
          <source>Proceedings of IEEE</source>
          ,
          <volume>77</volume>
          (
          <issue>4</issue>
          ):
          <volume>541</volume>
          {
          <fpage>580</fpage>
          ,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>E.P.</given-names>
            <surname>Odum</surname>
          </string-name>
          .
          <article-title>The strategy of ecosystem development</article-title>
          .
          <source>Science</source>
          ,
          <volume>164</volume>
          (
          <issue>3877</issue>
          ):
          <volume>262</volume>
          {
          <fpage>270</fpage>
          ,
          <year>1969</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <article-title>Petri nets tools</article-title>
          . http://www.informatik.uni-hamburg.de/TGI/PetriNets/tools.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. L.
          <string-name>
            <surname>Popova-Zeugmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Heiner</surname>
            ,
            <given-names>and I. Koch.</given-names>
          </string-name>
          <article-title>Timed Petri Nets for modelling and analysis of biochemical networks</article-title>
          .
          <source>Fundamenta Informaticae</source>
          ,
          <volume>67</volume>
          :
          <fpage>149</fpage>
          {
          <fpage>162</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Parsons</surname>
            <given-names>T. R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takahashi</surname>
            <given-names>M.</given-names>
          </string-name>
          , and Hargrave B.
          <article-title>Biological oceanographic processes</article-title>
          . Pergamon Press,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <given-names>A.</given-names>
            <surname>Schrijver</surname>
          </string-name>
          .
          <article-title>Theory of linear and integer programming</article-title>
          .
          <source>Interscience series in discrete mathematics and optimization</source>
          . Wiley,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <given-names>I.</given-names>
            <surname>Sorokin</surname>
          </string-name>
          and
          <string-name>
            <given-names>O.</given-names>
            <surname>Giovanardi</surname>
          </string-name>
          .
          <article-title>Trophic characteristics of the manila clam</article-title>
          .
          <source>ICES Journal of Marine Science</source>
          ,
          <volume>52</volume>
          (
          <issue>5</issue>
          ):
          <volume>853</volume>
          {
          <fpage>862</fpage>
          ,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Reinthaler</surname>
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Winter</surname>
            <given-names>C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Herndl</surname>
            <given-names>G. J.</given-names>
          </string-name>
          <article-title>Relationship between bacterioplankton richness, respiration, and production in the Southern North Sea</article-title>
          . Applied and environmental microbiology,
          <volume>5</volume>
          (
          <issue>7</issue>
          ):
          <volume>2260</volume>
          {
          <fpage>2266</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Ulanowicz</surname>
          </string-name>
          .
          <article-title>A phenomenological perspective of ecological development</article-title>
          .
          <source>Aquatic Toxicology and Environmental Fate</source>
          ,
          <volume>9</volume>
          :
          <fpage>73</fpage>
          {
          <fpage>81</fpage>
          ,
          <year>1986</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Ulanowicz</surname>
          </string-name>
          .
          <article-title>Quantitative methods for ecological network analysis and its application to coastal ecosystems</article-title>
          .
          <source>Treatise on Estuarine and Coastal Science</source>
          ,
          <volume>9</volume>
          :
          <fpage>35</fpage>
          {
          <fpage>57</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>D. van Oevelen</surname>
            , K. van den Meersche,
            <given-names>F. R.</given-names>
          </string-name>
          <string-name>
            <surname>Meysman</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Soetaert</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Middelburg</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Vezina</surname>
          </string-name>
          .
          <source>Quantifying Food Web Flows Using Linear Inverse Models. Ecosystems</source>
          ,
          <volume>13</volume>
          :
          <fpage>32</fpage>
          {
          <fpage>45</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>M. Vasconcellos</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Mackinson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Sloman</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Pauly</surname>
          </string-name>
          .
          <article-title>The stability of trophic mass-balance models of marine ecosystems: a comparative analysis</article-title>
          .
          <source>Ecological Modelling</source>
          ,
          <volume>100</volume>
          :
          <fpage>125</fpage>
          {
          <fpage>134</fpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <given-names>A.F.</given-names>
            <surname>Vezina</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Platt</surname>
          </string-name>
          .
          <article-title>Food web dynamics in the ocean. I. Best-estimates of ow networks using inverse methods</article-title>
          .
          <source>Marine Ecology - Progress Series</source>
          ,
          <volume>42</volume>
          :
          <fpage>269</fpage>
          {
          <fpage>287</fpage>
          ,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <given-names>R. G.</given-names>
            <surname>Wetzel. Limnology</surname>
          </string-name>
          . Lake and
          <string-name>
            <given-names>River</given-names>
            <surname>Ecosystems</surname>
          </string-name>
          . Elsevier,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>