<!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 Net Models of Simple Rule-Based Systems for Programming Physarum Machines</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Extended Abstract</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Andrew Schumann</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Models of Simple Rule-Based Systems</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Information Technology and Management Sucharskiego Str.</institution>
          <addr-line>2, 35-225 Rzeszow</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Management and Administration Akademicka Str.</institution>
          <addr-line>4, 22-400 Zamosc</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
      </contrib-group>
      <fpage>155</fpage>
      <lpage>160</lpage>
      <abstract>
        <p>In the paper, we show that biological substrate in the form of Physarum polycephalum can be used to simulate simple rule-based systems. To extort a proper behavior from the substrate, appropriate distribution of stimuli (attractants and/or repellents) is required. To model behavior of the substrate and then program Physarum machine (a biological computing device experimentally implemented in the plasmodium of Physarum polycephalum), we propose to use Petri net models that can be treated as a high-level description. Petri net models enable us to reflect propagation of protoplasmic veins of the plasmodium in consecutive time instants (step by step).</p>
      </abstract>
      <kwd-group>
        <kwd>Physarum polycephalum</kwd>
        <kwd>unconventional computing</kwd>
        <kwd>Petri nets</kwd>
        <kwd>rule-based systems</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>– Type 2: IF di, THEN dj1 AND dj2 AND . . . AND djk .
– Type 3: IF di1 OR di2 OR . . . OR dik , THEN dj .
– Type 4: IF di, THEN dj1 OR dj2 OR . . . OR djk .</p>
    </sec>
    <sec id="sec-2">
      <title>Further, we will take into consideration types of rules 1 and 3, only. Unconventional computing becomes an interdisciplinary field of science, where computer scientists, physicists and mathematicians apply principles of information processing in natural systems to design novel computing devices and architectures. In</title>
      <p>
        Physarum Chip Project: Growing Computers from Slime Mould [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] supported by FP7,
we are going to implement programmable amorphous biological computers in
plasmodium of Physarum polycephalum. Physarum polycephalum is a one-cell organism
manifesting some primitive intelligence in its propagating and foraging behavior (cf.
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]). A biological computing device implemented in the plasmodium of Physarum
polycephalum is said to be a Physarum machine. A comprehensive information on
Physarum machines can be found in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The Physarum machine comprises an
amorphous yellowish mass with networks of protoplasmic veins, programmed by spatial
configurations of attracting and repelling stimuli.
      </p>
      <p>
        To program Physarum machines, i.e., to set the spatial distribution of stimuli, we
are designing a new object-oriented programming language [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], called the
Physarum language. Moreover, to support research on programming Physarum
machines, we are developing a specialized software tool, called the Physarum software
system, shortly PhysarumSoft (see [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]). Our language is based on the prototype-based
approach (cf. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]). According to this approach, there are inbuilt sets of prototypes,
implemented in the language, that correspond to both the high-level models used for
describing behaviour of Physarum polycephalum (e.g., ladder diagrams, transition
systems, timed transition systems, Petri nets) and the low-level model (distribution of
stimuli). In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], we proposed to use Petri nets with inhibitor arcs (cf. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) as one of
the high-level models to describe behaviour of Physarum polycephalum. The inhibitor
arcs test the absence of tokens in a place and they can be used to disable transitions.
This fact can model repellents in Physarum machines. A transition can only fire if all
its places connected through inhibitor arcs are empty (cf. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]). Each high-level model
(including a Petri net one) is translated into the low-level language, i.e., spatial
distribution of stimuli (attractants and/or repellents). Such distribution can be treated as a
program for the Physarum machine.
      </p>
      <p>
        In the literature, one can find a lot of approaches using Petri nets as models of
rule-based systems (e.g., [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]). First of all, structures of Petri nets reflect
structures of rule-based systems. Various options of structures have been considered,
according to respective approaches. Moreover, the proposed approaches differ in the
dynamics that models reasoning processes. In our research, we propose another approach
in order to reflect dynamics of Physarum machines, i.e., propagation of protoplasmic
veins of the plasmodium according to activation/deactivation of stimuli. In the proposed
Petri net models of Physarum machines, we can distinguish several kinds of places:
– Places representing Physarum polycephalum.
– Places representing control stimuli (attractants or repellents) corresponding to
propositions in antecedent parts of rules.
– Places representing auxiliary stimuli (attractants) corresponding to partial results of
evaluation of logical expressions in antecedent parts of composite production rules.
– Places representing output stimuli (attractants) corresponding to propositions in
consequence parts of rules.
      </p>
      <p>
        For each kind of places, we adopt different meaning (interpretation) of tokens (see,
for example, Tables 1, 2 and 3 for places representing control stimuli and places
representing output stimuli, respectively). Each token corresponds to proper evaluation
of the proposition according to the role played by a given stimulus. In our models
of simple rule-based systems, we have implemented an idea of flowing power used
in ladder diagrams to model digital circuits. The same idea was used by us to
construct logic gates through the proper geometrical distribution of stimuli in Physarum
machines (see [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]). Flowing power is replaced with propagation of plasmodium of
Physarum polycephalum. Therefore, in each Petri net model of a rule, a place
representing Physarum polycephalum is present. Petri net models are a useful tool to
reflect dynamics of Physarum machines, i.e., propagation of protoplasmic veins of the
plasmodium in consecutive time instants. Tokens present in places representing output
stimuli show which attractants of Physarum machines are occupied by the plasmodium
at given time instants.
      </p>
      <p>
        In general, we can distinguish two techniques to control behavior of Physarum
polycephalum: repellent-based and attractant-based [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Attractants are sources of nutrients
or pheromones, on which the plasmodium feeds. In case of repellents, the fact that
plasmodium of Physarum avoids light and some thermo- and salt-based conditions is used.
These possibilities are reflected in the cretaed Petri net models. Technically, the second
approach is easier to implement. In case of repellent-based control approach, Petri net
models of production rules of type 1 and 3 have the form as in Figures 1 and 2,
respectively. In these models, the places Rdi1, Rdi2, ..., Rdi3 correspond to propositions in
the antecedent parts of the rules. The relationship between meaning of tokens and
evaluation of propositions is shown in Table 1. These places are translated into repellents in
the low-level model (distribution of stimuli). The places A1, A2, ..., Ak−1 correspond
to auxiliary stimuli. The relationship between the meaning of tokens and the evaluation
of propositions is shown in Table 2. The place Adj correspond to the output stimulus.
The relationship between meaning of tokens and evaluation of propositions is shown in
Table 3. It is easy to see that, in case of type 1 of production rules, the token is present
in Adj (the proposition in the consequence part is true), if all places Rdi1, Rdi2, ..., Rdi3
do not hold tokens (the propositions in the antecedent part are true). In case of type
3 of production rules, the token is present in Adj (the proposition in the consequence
part is true), if at least one of the places Rdi1, Rdi2, ..., Rdi3 does not hold a token (at
least one of the propositions in the antecedent part is true). The structures of Physarum
machines for production rules of type 1 and 3 are shown in Figure 3 (a) and (b),
respectively. Distributions of stimuli can be treated as programs for these machines. In
the further research, we will consider more complex rule-based systems. However, we
are aware of the topological constraints if the Physarum machine is implemented in the
two-dimensional space (e.g., on the Petri dish). In this case, propagation of
protoplasmic veins forming a planar graph is admissible only.
      </p>
      <p>Another challenging problem is to use Physarum machines in the process of
optimization of rule-based systems. Physarum polycephalum is originally famous as a
computing biological substrate due to its alleged ability to approximate shortest path
from its inoculation site to a source of nutrients.</p>
      <p>Acknowledgments</p>
    </sec>
    <sec id="sec-3">
      <title>This research is being fulfilled by the support of FP7-ICT-2011-8.</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Adamatzky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Physarum Machines: Computers from Slime Mould</article-title>
          . World Scientific (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Adamatzky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Erokhin</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grube</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schubert</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Physarum chip project: Growing computers from slime mould</article-title>
          .
          <source>International Journal of Unconventional Computing</source>
          <volume>8</volume>
          (
          <issue>4</issue>
          ),
          <fpage>319</fpage>
          -
          <lpage>323</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Agerwala</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flynn</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Comments on capabilities, limitations and 'correctness' of Petri nets</article-title>
          .
          <source>In: Proceedings of the 1st Annual Symposium on Computer Architecture</source>
          (ISCA'
          <year>1973</year>
          ). pp.
          <fpage>81</fpage>
          -
          <lpage>86</lpage>
          . Atlanta, USA (
          <year>1973</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Brachman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levesque</surname>
          </string-name>
          , H.:
          <article-title>Knowledge Representation and Reasoning</article-title>
          . Morgan Kaufmann Publishers, San Francisco (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ke</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          :
          <article-title>Knowledge representation using fuzzy Petri nets</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>2</volume>
          (
          <issue>3</issue>
          ),
          <fpage>311</fpage>
          -
          <lpage>319</lpage>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Craig</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Object-Oriented Programming Languages: Interpretation</article-title>
          . Springer-Verlag, London (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Konar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Cognitive Engineering: A Distributed Approach to Machine Intelligence</article-title>
          . Springer-Verlag, London (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Looney</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alfize</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Logical controls via Boolean rule matrix transformations</article-title>
          .
          <source>IEEE Transactions on Systems, Man and Cybernetics</source>
          <volume>17</volume>
          (
          <issue>6</issue>
          ),
          <fpage>1077</fpage>
          -
          <lpage>1082</lpage>
          (
          <year>1987</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Nakagaki</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yamada</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toth</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Maze-solving by an amoeboid organism</article-title>
          .
          <source>Nature</source>
          <volume>407</volume>
          ,
          <fpage>470</fpage>
          -
          <lpage>470</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Principles of an object-oriented programming language for Physarum polycephalum computing</article-title>
          .
          <source>In: Proceedings of the 10th International Conference on Digital Technologies (DT</source>
          '
          <year>2014</year>
          ). pp.
          <fpage>273</fpage>
          -
          <lpage>280</lpage>
          . Zilina, Slovak
          <string-name>
            <surname>Republic</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Some issues on an object-oriented programming language for Physarum machines</article-title>
          . In: Bris,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Majernik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Pancerz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Zaitseva</surname>
          </string-name>
          , E. (eds.) Applications of Computational Intelligence in Biomedical Technology,
          <source>Studies in Computational Intelligence</source>
          , vol.
          <volume>606</volume>
          , pp.
          <fpage>185</fpage>
          -
          <lpage>199</lpage>
          . Springer International Publishing,
          <string-name>
            <surname>Switzerland</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Petri</surname>
            ,
            <given-names>C.A.</given-names>
          </string-name>
          :
          <article-title>Kommunikation mit automaten</article-title>
          .
          <source>Schriften des IIM nr. 2</source>
          , Institut für Instrumentelle Mathematik,
          <string-name>
            <surname>Bonn</surname>
          </string-name>
          (
          <year>1962</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Towards an object-oriented programming language for Physarum polycephalum computing</article-title>
          . In: Szczuka,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Czaja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Kacprzak</surname>
          </string-name>
          , M. (eds.) Proceedings of the Workshop on Concurrency,
          <article-title>Specification and Programming (CS&amp;P'</article-title>
          <year>2013</year>
          ). pp.
          <fpage>389</fpage>
          -
          <lpage>397</lpage>
          . Warsaw, Poland (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Timed transition system models for programming Physarum machines: Extended abstract</article-title>
          . In:
          <string-name>
            <surname>Popova-Zeugmann</surname>
            ,
            <given-names>L</given-names>
          </string-name>
          . (ed.)
          <source>Proceedings of the Workshop on Concurrency</source>
          ,
          <article-title>Specification and Programming (CS&amp;P'</article-title>
          <year>2014</year>
          ). pp.
          <fpage>180</fpage>
          -
          <lpage>183</lpage>
          . Chemnitz,
          <string-name>
            <surname>Germany</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Towards an object-oriented programming language for Physarum polycephalum computing: A Petri net model approach</article-title>
          .
          <source>Fundamenta Informaticae</source>
          <volume>133</volume>
          (
          <issue>2-3</issue>
          ),
          <fpage>271</fpage>
          -
          <lpage>285</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>PhysarumSoft - a software tool for programming Physarum machines and simulating Physarum games</article-title>
          .
          <source>In: Proceedings of the FedCSIS 2015</source>
          . pp.
          <fpage>619</fpage>
          -
          <lpage>626</lpage>
          . Lodz,
          <string-name>
            <surname>Poland</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Schumann</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pancerz</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>Towards logic circuits based on physarum polycephalum machines: The ladder diagram approach</article-title>
          . In: Cliquet Jr.,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Plantier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Schultz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Fred</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Gamboa</surname>
          </string-name>
          , H. (eds.)
          <source>Proceedings of the International Conference on Biomedical Electronics and Devices</source>
          (BIODEVICES'
          <year>2014</year>
          ). pp.
          <fpage>165</fpage>
          -
          <lpage>170</lpage>
          . Angers, France (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Suraj</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>A survey of selected classes of logical Petri nets</article-title>
          . In: Wróbel,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Marszał-Paszek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Paszek</surname>
          </string-name>
          , P. (eds.)
          <article-title>Monografia jubileuszowa dla uczczenia 45 lat pracy naukowej Prof. A</article-title>
          .
          <string-name>
            <surname>Wakulicz-Deji</surname>
          </string-name>
          , pp.
          <fpage>157</fpage>
          -
          <lpage>181</lpage>
          . Wyd. Uniwersytetu S´ la˛skiego,
          <string-name>
            <surname>Katowice</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Szpyrka</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szmuc</surname>
          </string-name>
          , T.:
          <article-title>D-nets - Petri net form of rule-based systems</article-title>
          .
          <source>Foundations of Computing and Decision Sciences</source>
          <volume>31</volume>
          (
          <issue>2</issue>
          ),
          <fpage>175</fpage>
          -
          <lpage>190</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Verbeek</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wynn</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>van der Aalst</surname>
          </string-name>
          , W., ter
          <string-name>
            <surname>Hofstede</surname>
          </string-name>
          , A.:
          <article-title>Reduction rules for reset/inhibitor nets</article-title>
          .
          <source>Journal of Computer and System Sciences</source>
          <volume>76</volume>
          (
          <issue>2</issue>
          ),
          <fpage>125</fpage>
          -
          <lpage>143</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>