<!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>P system based model of passenger flow in P system based model of passenger ow in public transportation systems: a case study of public transportation systems: a case study of Prague Metro?? Prague Metro</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Zbynˇek Janoˇska</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jiˇr´ı Dvorsky´ Zbynek Janoska</string-name>
          <email>zbynek.janoska@centrum.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jir Dvorsky</string-name>
          <email>jiri.dvorsky@upol.cz</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Geoinformatics, Faculty of Science, Palacky ́ University Olomouc, Department oTfˇrG ́ıdeaoiSnvfoorbmoadtyic2s6,</institution>
          ,
          <addr-line>F7a7c1ul4ty6,oOflSocmieonucce, CPzaelacchkRyeUpnuibvleicrsity Olomouc</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <fpage>59</fpage>
      <lpage>69</lpage>
      <abstract>
        <p>P systems are branch of bio-inspired computing, which takes inspiration from the structure and functioning of a living cell. Current research of P systems focuses mainly on their computational power, applications include biochemical and ecological modeling. In this paper we propose model of passenger flow in metro based on P systems. This model focuses on detailed description of passenger behavior, while retaining simple and robust in description of vehicle flow. Formal description of model is given and simulations using Prague Metro as an example with real traffic flow data from 2008 are presented. Some open problems are discussed and further directions of research are suggested.</p>
      </abstract>
      <kwd-group>
        <kwd>P systems</kwd>
        <kwd>passenger flow</kwd>
        <kwd>Prague Metro</kwd>
        <kwd>transportation simulation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        ? The paper has been completed within the project CZ.1.07/2.2.00/28.0078 InDOG
- Innovation of PhD Geoinformatics and Cartography study with support of
modern technological trends which is co-financed from European Social Fund and State
financial resources of the Czech Republic
which take the form similar to a chemical reaction: a → b, where a and b are
multisets of objects. When a rule is applied, all objects on the left side of a rule
are removed and objects on the right side of a rule are introduced into a system.
Application of rules is exhaustive, maximally parallel and non-deterministic.
For detailed description of P systems please consult [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], complete biography on
P systems is available from [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>
        Most research in the field of P systems focuses on computational power (e.g.[
        <xref ref-type="bibr" rid="ref11 ref12 ref9">9,
11, 12</xref>
        ]), applications are restricted mostly to biochemical [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] or ecological [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
topics. In our research, we focus on application of P systems to vehicular traffic
flow phenomena [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In this paper we propose model for passenger flow simulation
in public transportation networks. The model focuses on detailed description of
passenger behavior both inside and outside the vehicle; vehicle movement is
described briefly and not modeled in detail.
      </p>
      <p>Aim of the model is to accurately estimate numbers of passengers, who use the
transportation system at given time. At every time step, numbers of passengers
waiting at stations and numbers of passengers in trains are available. This
information can be used to examine the performance of the transportation system
and the occupancy of trains, for example in case, when a great number of
passengers is introduced into a system, or when the schedule of trains is changed.
Model can also be used in evacuation studies, when numbers of people in
different parts of the transportation system are needed. On the other hand, this
model is not suitable for examination of changes of behavior of passengers. It
might be of interest to know, how long are passengers willing to wait for a
delayed train, or if they rather wait for next train in case, that the current train
is almost fully occupied. This kind of research questions requires agent-based
modelling, where passengers will make decisions. P systems do not allow
decision making – behavior of passengers is described using predefined set of rules,
which do not change during the computation, and therefore passengers can not
react to ongoing changes within the system.</p>
      <p>Performance of a model is shown on an example of Prague Metro, which is
simple network of three intersecting lines. Traffic flow data from 2008 are used in
simulations.</p>
      <p>The paper is structured as follows: in section 2, a formal description of model is
given, in section 3, performance of model is examined, section 4 focuses on some
problems, which were encountered during the analysis and future directions of
research are suggested. Section 5 contains short conclusion.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Model description</title>
      <p>
        There exist several levels of traffic modeling, ranging from macro-models,
describing traffic flow only in terms of populations of object, to micro-models,
where every individual object in the system is examined in detail [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. For
purposes of passenger flow simulation, mezo-scale models are recommended [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In
mezo-models, some parts of system are described in detail, while description of
other parts is rather laconic. Such a model is suitable to focusing on certain part
of traffic flow phenomena, while retaining robust and computationally efficient.
In similar manner, proposed model is designed to capture detailed behavior of
passengers, while flow of vehicles is brief and simplistic.
      </p>
      <p>
        Real world system consists of several components, which must be represented
in terms of P systems. Metro stations are considered as membranes. Network of
stations is represented as a graph, similar to neural P systems [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Metro trains
are considered membranes, but unlike classical membranes in P systems, they
are mobile - their position in the system changes as the system evolves. This
evolution is handled by a set of rules [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Finally, the passengers are represented
as objects. Their behavior follows set of rules, which change according to the
position of passengers (inside train or at station).
      </p>
      <p>We believe this representation is very expressive – it is easy to see metro stations
as membranes, which are entered and left by passengers – objects. Vehicles serve
as membranes too – their function, same as function of living membranes – is
to protect its content and serve as a mean of selective transportation (not all
objects can enter the membrane and membrane can be entered only on specific
occasions). This expressiveness (compared to description using i.e. set of
differential equations) together with massive parallelism of model – are two main
advantages of P systems for transportation modeling.</p>
      <p>Formally, P systems for passenger flow simulation in public transportation
networks are following construct:
Π = (O, l, syn, R),
(1)
where:
– O = {people{a,...,b}, empty}|a, b ∈ {l − {train1, . . . , trainn}}} is a set of
objects, where people represents passenger and empty represents empty seat
inside a train. To each passenger people, a sequence {a, . . . , b} is assigned.
This sequence is an ordered list of all stations, which passenger visits on
his route from station a (current station) to station b (end station of an
individual route).
– l = {1, . . . , k, tram1, . . . , tramn} is a set of membranes with k metro stations
and n trains.
– syn ⊆ {(i, j, t)|i, j ∈ {l − {train1, . . . , trainn}}, i 6= j, t ∈ N} is a set of
synapses, representing topology of a network. Each synapse consists of two
labels of metro stations i, j and time t necessary to transport train from
station i to station j.
– R is a set of rules, which describe the behavior of both membranes and
objects inside them. Rules are assigned to membranes, therefore different
membranes have different sets of rules and same object in two different
membranes can be evolved using different sets of rules. In next section, following
notation will be used: train going to station k will be denoted by [k ]k, hence
k is label of next, not current station. Each train can be in two states
stopped or moving. Membrane polarization is used to distinguish between
the two, therefore moving train to station k is denoted as [k+ ]+. Metro
stak
tion with label m will be denoted as (m )m. Following set of rules is used to
describe the evolution of the system.
1. people{a,b,...,x} [a empty ]a− → [a people{b,...,x} ]a− is rule describing
passenger entering a train. Passenger, whose next stop is a enters a train
going to station a, if there is an empty seat (empty) and the train is
stopped (negative polarization). Once inside the train, passengers next
station changes to b.
2. [a people{a,b,...,x} ]a− → [a people{b,...,x} ]a− is rule describing passenger
staying inside a train. Passenger, whose next stop is a and who is already
in a train going to a, stays inside and his next stop changes to b.
3. [a peopleNULL ]a− → [a empty ]a− describes situation, where passenger
inside a train has no next station, hence is in his final destination and
leaves the system. An empty object is created inside a train.
4. [a people{b,c,...,x} ]a− → [a empty ]a− people{b,c,...,x} describes passenger
leaving the train at transfer station. If passenger, whose next stop is b, is
inside train going to a, he leaves the train and empty seat appears inside
a train. The passenger stays at the current station.
5. (i [j ]j+ )i −→t (j [k ]k− )j is rule describing movement of trains inside a
network. Moving train in station i, whose next station is j, is moved to
station j, its next station is changed to k and the train stops.
6. (i [j ]j− )i → (i [j ]j+ )i changes train from stopped to moving state.
7. (i [NULL ]N−ULL )i → (i )i is rule describing situation, where train
reaches its final destination (i.e. does not have next stop). Such a train
is removed from the system.
8. (i )i → (i [a ]a− )i is rule describing generation of trains in start
stations – train going to station a is created in station i. The trains is
stopped, therefore passengers can enter the train immediately.
9. (i )i → (i people{a,b,...,x} )i describes arrival of people to the station i.</p>
      <p>For each passenger, who arrives at the station, a sequence of stations to
visit a, b, . . . , x is generated.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <p>Application of model is demonstrated on example of Prague Metro. This
transportation system consists of three lines, labeled A (Dejvick´a – Depo Hostivaˇr), B
(Zliˇc´ın – Cˇ erny´ Most) and C (Letnˇany – H´aje), which intersect at three stations
(A–B - M˚ustek, A–C - Muzeum, B–C - Florenc). Prague Metro consists of 53
stations in total and approximately 1.5 millions of people are transported every
day. Trains are in service from approximately 4:40 a.m. to 24 a.m. (midnight) and
their frequency changes in time. In five-year periods, survey of passenger
occupancy is performed with last survey taking place at 2008. Prague Public Transit
Company provided detailed data about transit intensity, which were used in this
case study. We selected Prague Metro for its importance as a mean of
transportation and also relative simplicity of the system, which allows well-designed
simulations.</p>
      <sec id="sec-3-1">
        <title>Letnˇany</title>
      </sec>
      <sec id="sec-3-2">
        <title>Vltavsk´a</title>
        <p>Cˇern´y Most
Zliˇc´ın</p>
      </sec>
      <sec id="sec-3-3">
        <title>Dejvick´a</title>
      </sec>
      <sec id="sec-3-4">
        <title>Staromˇestsk´a</title>
      </sec>
      <sec id="sec-3-5">
        <title>N´amˇest´ı republiky</title>
      </sec>
      <sec id="sec-3-6">
        <title>Florenc</title>
      </sec>
      <sec id="sec-3-7">
        <title>Kˇriˇz´ıkova</title>
      </sec>
      <sec id="sec-3-8">
        <title>M˚ustek</title>
      </sec>
      <sec id="sec-3-9">
        <title>Hlavn´ı n´adraˇz´ı</title>
      </sec>
      <sec id="sec-3-10">
        <title>N´arodn´ı tˇr´ıda</title>
      </sec>
      <sec id="sec-3-11">
        <title>Muzeum</title>
      </sec>
      <sec id="sec-3-12">
        <title>I.P. Pavlova</title>
        <p>N´amˇest´ı m´ıru</p>
      </sec>
      <sec id="sec-3-13">
        <title>Depo Hostivaˇr H´aje</title>
        <p>
          Current (December 2012) schedule of trains was used as basis for
generation of trains at start stations. Main problem of public transport modeling is
estimation of number of passengers traveling between each pair of stations.
Fortunately, this information was provided by Prague Public Transit Company in
form of so called Origin-Destination Matrix. Intensity of transport varies during
day, which leads to problem with estimation of this intensity. Due to unknown
trend of intensities during a day, the quantity was estimated using train
schedule. It was assumed, that frequency of train arrivals at given station corresponds
with amount of people transported. Kernel density (Epanechnikov kernel,
bandwidth=50 minutes) of train frequency was estimated and used as a basis to
calculate numbers of passengers entering the system at given time. Figure 2
shows estimated intensity. Values on y axis represent estimated intensity of
process, generating ”dots” – times of arrival of trains on x axis. We assume, that the
process generating times of arrival of trains is in fact the transportation demand
of passengers and therefore estimated intensity of this process can be used to
calculate the numbers of passengers using the system at given time. Maximal
capacity of train was set to 1363, which is occupancy of train 81-71, a standard
train in Prague Metro [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ]. P systems are discrete in time and one minute was set
as a time unit. At every station, the number of passengers N corresponding to
estimated intensity function from figure 2 was calculated each minute. Concrete
number of passengers was generated from Poisson distribution with λ = N .
Currently, there are no simulators of P systems, which enable usage of rules in
form, which was presented in chapter 2. Set of scripts in python was developed
to perform the simulation.
        </p>
        <p>Frequence of train arrivals at Dejvická station
y
it
s
n
e
D
2
1
0
0
.
0
8
0
0
0
.
0
4
0
0
0
.
0
0
0
0
0
.
0
0
200
400
600
800
1000
1200</p>
        <p>1400
time (minutes from 0:00)</p>
        <p>Four interesting variants of stations were identified in the system and further
examined:
1. Final stations – Dejvick´a, Depo Hostivaˇr, Ha´je, Letnˇany, Zliˇc´ın, Cˇ erny´ Most
2. Transfer stations – M˚ustek, Muzeum, Florenc
3. Stations between two transfer station – N´amˇest´ı Republiky and Hlavn´ı Na´draˇzi
4. Station next to one transfer stations – Vltavsk´a, Kˇriˇz´ıkova, Na´mˇest´ı M´ıru,</p>
        <p>I.P.Pavlova, N´arodn´ı Tˇr´ıda, Staromˇestsk´a
3.1</p>
        <sec id="sec-3-13-1">
          <title>Final stations</title>
          <p>Final stations are unique, because only one direction of the train line is served.
Simulation showed periodic behavior, where after train departure, no passengers
ale left at station (Figure 3). This means, that the transportation demand is
fully served.</p>
          <p>Dejvická station 5:00 − 7:00</p>
          <p>Time (minutes from beginning)
There are three transfer stations, where always two lines intersect. These
stations are very frequently used and numbers of passengers waiting for train show
also cyclic, but more irregular pattern. Moreover, at the beginning of the study
period, there is elevated number of passengers waiting for the train (Figure 4). It
seems, that the system is not able to handle the demand of passengers for short
period of time, but later, the frequency of trains increases and the ”wave” of
waiting passengers is dissolved. We attribute this behavior not to design of the
model, neither we think it represents real behavior of the system, but assume it
is caused by incorrectly estimated passenger flow intensity. We will discuss this
problem later in chapter 4.
3.3</p>
        </sec>
        <sec id="sec-3-13-2">
          <title>Stations between two transfer station</title>
          <p>Both N´amˇest´ı Republiky and Hlavn´ı Na´draˇz´ı stations show similar, but even
more evident pattern as transfer stations. The periodic behavior is more regular
and ”peak” at the beginning of the study period is more distinctive. Due to high
frequency of trains, the numbers of passengers waiting are lower than at most
of the other stations (Figure 5).</p>
          <p>Muzeum station 5:00 − 7:00
0
0
2
1
0
0
2
0
0
20
40
60
80
100
120
A rather regular periodic pattern with two peaks can be observed at stations next
to transfer stations (Figure 6). Rapid rise in number of waiting passengers was
not observed at the beginning of the study period, also the number of passengers
returns to values close to zero, which indicates, that the schedule is appropriate
to the transport demand. The position of peaks (irregular or regularly spaced) is
caused by train schedule and is not caused by stations being immediately after
transfer station.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Discussion</title>
      <p>Possible incorrect performance of the model can result from two types of errors:
errors in design of the model and incorrect input values.</p>
      <p>Input values of the model are traffic demand and train schedule. Numbers of
passengers traveling between all pairs of stations were derived from
transportation survey of passenger occupancy and should accurately describe the system.
However, only sum of all passengers was available for every station, dynamics of
the demand during the day is unknown.</p>
      <p>Issue with elevated numbers of passengers at the beginning of the study period</p>
      <p>Hlavní nádraží station 5:00 − 7:00
0
0
2
s
r
ngee 150
s
s
a
frpo 001
e
b
uNm 05
0
0
20
40
60
80
100
120
we attribute to incorrect estimation of passenger demand quantity. Different
estimates (using different kernels and bandwidths) were examined, however none
of them led to results, which both copied global trend and did not produce
elevated numbers at the beginning. Correct estimation of traffic demand is crucial
step and our next research will be pointed at this direction.</p>
      <p>The movement of trains is ruled deterministically using real schedule, obtained
from world wide web. In reality, this schedule will be rarely kept, therefore and
arbitrary constant can be added to travel time between two consequent stations
to account for train delays. This time constant should be preferably generated
randomly from known distribution of time delays.</p>
      <p>Errors in the design of the model can be represented by ommiting important
rules in description of the model. Presented model focuses on more detailed
description of passenger behavior, while remaining brief in description of vehicle
flow.</p>
      <p>Passengers, who exit the train are immediately removed from the system, while
in real system, they remain at the station for some time. While not important
for examining the capacity or occupancy of traffic system, this might be an issue
in i.e. evacuation studies. Extending system by new object - passenger, who no
longer participates in transportation, and extending current rules would
incorporate this extension, while keeping the model robust and simple.</p>
      <p>Náměstí Míru 5:00 − 7:00
0
2
1
0
0
1
0
2
0
0
20
40
60
80
100
120
One more possible issue, which is inherent to P systems, should be mentioned.
Objects in P systems are not agents, do not posses (artificial) intelligence and
do not make decisions. Their behavior is ruled by predefined set of rules, which
can be probabilistic and resemble decision making, but essentially, decisions in
P systems are not possible and therefore using proposed model for behavioral
research of passenger choices would be problematic (i.e. research question ”How
long are passengers willing to wait for delayed train” is not appropriate for P
systems, because requires passengers to make decisions).</p>
      <p>The validity of model will be further examined and subjected to complex
simulations. Case study only examined numbers of passengers waiting at stations,
however occupancy of trains can be of interest for traffic management as well
as examination of time, which is spend by certain groups of passengers in the
system. Proposed model is discrete both in time and processing units (every
passenger is considered an individual element in the system), therefore can be
suitable for more sophisticated simulation. Research questions, which will be
explored in the future are: How long time delays of trains are still manageable and
which length of delays will cause the system to collapse? In the case of change
of travel behavior of passengers, which changes could be made to increase the
effectivenes of the system? If an increased number of passengers is introduced to
the system (i.e. 1000 sport fans going to the game), how will the system respond?
In this paper, a P system based model for passenger flow simulation in public
transport systems was proposed. Formal description of model was given and case
study using Prague Metro network as example was performed. The case study
did not reveal any errors in design of the model, however it became apparent,
that correct estimation of numbers of passengers using system at given time is
necessary. Cyclic patterns in numbers of passengers waiting at the stations were
observed. Open problems associated with usage of P systems for traffic flow
simulation were discussed and directions of future research were suggested.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>F. J.</given-names>
            <surname>Romero-Campero and M. J. P</surname>
          </string-name>
          <article-title>´erez-Jim´enez. A model of the quorum sensing system in vibrio fischeri using p systems</article-title>
          <source>Artificial Life</source>
          <volume>14</volume>
          (
          <issue>1</issue>
          ).
          <fpage>95</fpage>
          -
          <lpage>109</lpage>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>M.</given-names>
            <surname>Cardona</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Colomer</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Margalida</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Palau</surname>
          </string-name>
          and
          <string-name>
            <given-names>I. P</given-names>
            ´erezHurtado and
            <surname>M. J. P´</surname>
          </string-name>
          erez-Jim´enez and
          <string-name>
            <given-names>D.</given-names>
            <surname>Sanuy</surname>
          </string-name>
          .
          <article-title>A computational modeling for real ecosystems based on P systems</article-title>
          .
          <source>Natural Computing</source>
          <volume>10</volume>
          (
          <issue>1</issue>
          ).
          <fpage>39</fpage>
          -
          <lpage>53</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>G.</given-names>
            <surname>Ciobanu and M. J. P</surname>
          </string-name>
          <article-title>´erez-Jim´enez and Gh</article-title>
          . Pa˘un.
          <source>Applications of Membrane Computing</source>
          . Springer, Natural Computing Series,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>J.</given-names>
            <surname>Dvorsky</surname>
          </string-name>
          ´ and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Janoˇska</surname>
          </string-name>
          and L. Voja´ˇcek.
          <source>P Systems for Traffic Flow Simulation. Lecture Notes in Computer Science</source>
          <volume>7564</volume>
          .
          <fpage>405</fpage>
          -
          <lpage>415</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Hoogendoorn</surname>
          </string-name>
          and
          <string-name>
            <given-names>P. H. L.</given-names>
            <surname>Bovy</surname>
          </string-name>
          .
          <article-title>State-of-the-art of Vehicular Traffic Flow Modelling</article-title>
          . Delft University of Technology. Delft,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Ionescu</surname>
          </string-name>
          and Gh. Pa˘un and
          <string-name>
            <given-names>T.</given-names>
            <surname>Yokomori</surname>
          </string-name>
          .
          <source>Spiking Neural P Systems. Fundamenta Informaticea</source>
          <volume>71</volume>
          (
          <issue>2</issue>
          ,3).
          <fpage>279</fpage>
          -
          <lpage>308</lpage>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>S.N.</given-names>
            <surname>Krishna</surname>
          </string-name>
          and Gh. Pa˘un.
          <source>P Systems with Mobile Membranes</source>
          . Kluwer Academic Publishers. Hingham, MA, USA,
          <year>2005</year>
          .
          <fpage>279</fpage>
          -
          <lpage>308</lpage>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Gh</surname>
          </string-name>
          . Pa˘un.
          <article-title>Computing with Membranes</article-title>
          .
          <source>Journal of Computer and System Sciences</source>
          <volume>61</volume>
          (
          <issue>1</issue>
          ).
          <fpage>108</fpage>
          -
          <lpage>143</lpage>
          (
          <year>2000</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pa</surname>
          </string-name>
          <article-title>˘un and Gh. P˘aun. The power of communication: P systems with symport/antiport</article-title>
          .
          <source>Journal of Computer and System Sciences</source>
          <volume>20</volume>
          (
          <issue>3</issue>
          ).
          <fpage>295</fpage>
          -
          <lpage>305</lpage>
          (
          <year>2002</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>S.</given-names>
            <surname>Peeta</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Ziliaskopoulos</surname>
          </string-name>
          .
          <article-title>Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future</article-title>
          .
          <source>Networks and Spatial Economics</source>
          <volume>1</volume>
          (
          <issue>1</issue>
          /4).
          <fpage>233</fpage>
          -
          <lpage>266</lpage>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. P.
          <article-title>Sos´ık. The computational power of cell division in P systems: Beating down parallel computers?</article-title>
          <source>Natural Computing</source>
          <volume>2</volume>
          (
          <issue>3</issue>
          ).
          <fpage>287</fpage>
          -
          <lpage>198</lpage>
          (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>C.</given-names>
            <surname>Zandron</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Ferretti</surname>
          </string-name>
          and
          <string-name>
            <given-names>G.</given-names>
            <surname>Mauri. Solving NP</surname>
          </string-name>
          <article-title>Complete Problems Using P Systems with Active Membranes</article-title>
          .
          <source>Unconventional Models of Computation</source>
          . Springer,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <article-title>P systems web page</article-title>
          . http://ppage.psystems.eu/.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14. T. Rejdal, www.metroweb.cz. http://www.metroweb.cz/metro/81-71/
          <fpage>81</fpage>
          -
          <lpage>71</lpage>
          .htm
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>