<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Agustín Riscos-Núñez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the degree of parallelism in membrane systems</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Degree of parallelism</style></keyword><keyword><style  face="normal" font="default" size="100%">Dependency graph</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">P systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V1G-4MG065P-3&_user=603129&_coverDate=03%2F15%2F2007&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000031118&_version=1&_urlVersion=0&_userid=603129&md5=112790e9b4c3a1d8e8dfc9b3ad0870cd</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://cantor.cs.us.es/files/On the Degree of Parallelism in Membrane Systems.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Amsterdam, Holanda</style></pub-location><volume><style face="normal" font="default" size="100%">372</style></volume><pages><style face="normal" font="default" size="100%">183-195</style></pages><abstract><style face="normal" font="default" size="100%">In the literature, several designs of P systems might be found for performing the same task. The use of different techniques or even different P system models makes it very difficult to compare these designs. In this paper, we introduce a new criterion for such a comparison: the degree of parallelism of a P system. With this aim, we define the labelled dependency graph associated with a P system, and we use this new concept for proving some results concerning the maximum number of applications of rules in a single step through the computation of a P system. 

</style></abstract><issue><style face="normal" font="default" size="100%">2-3</style></issue></record></records></xml>