@inproceedings{Alhazov.etal:DRevSeq:PostUC2010,
author = {Artiom Alhazov and Rudolf Freund and Kenichi Morita},
title = {Reversibility and Determinism in Sequential Multiset Rewriting},
booktitle = {Unconventional Computation: 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010. Proceedings},
editor = {Cristian S. Calude and Masami Hagiya and Kenichi Morita and Grzegorz Rozenberg and Jon Timmis},
series = {Lecture Notes in Computer Science},
volume = {6079},
publisher = {Springer},
year = {2010},
pages = {21--31},
bibdate = {07/12/10},
abstract = {We study reversibility and determinism aspects of sequential multiset processing systems, and the strong versions of these properties.
Syntactic criteria are established for both strong determinism and for strong reversibility. It also shown that without control all four classes - deterministic, strongly deterministic, reversible, strongly reversible - are not universal, while allowing priorities or inhibitors the first and the third class become universal. Moreover, strongly deterministic multiset rewriting systems with priorities are also universal.},
url = {http://www.springerlink.com/content/dh2r3jhm04v14m80/},
}
@inproceedings{Alhazov.etal:LOP:LASymposium2010,
author = {Artiom Alhazov and Constantin Ciubotaru and {\relax Yu}rii Rogozhin
and Sergiu Ivanov},
title = {The Membrane Systems Language Class},
booktitle = {2009 LA Winter Symposium},
address = {Kyoto, Japan},
year = {2010},
pages = {12-1--12-9},
bibdate = {07/12/10},
abstract = {The aim of this paper is to introduce the
class of languages generated by the transitional model
of membrane systems without cooperation and without
additional ingredients. The fundamental nature of
these basic systems makes it possible to also define the
corresponding class of languages it in terms of derivation
trees of context-free grammars. We also compare
this class to the well-known language classes and discuss
its properties.},
url = {http://www.nishizeki.ecei.tohoku.ac.jp/LA2009/program_winter.html},
}
@inbook{Freund.Alhazov.Rogozhin.Verlan:SAChapter:HandbookMC,
author = {Rudolf Freund and Artiom Alhazov and {\relax Yu}rii Rogozhin and Sergey Verlan},
title = {Communication {P}~Systems},
year = {2010},
publisher = {Oxford University Press},
pages = {118--143},
booktitle = {The Oxford Handbook of Membrane Computing},
editor = {{\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
url = {http://www.oup.com/us/catalog/general/subject/Mathematics/AppliedMathematics/?view=usa&sf=toc&ci=9780199556670},
}
@inproceedings{Alhazov.Morita:DRevP:PostWMC10:2010,
author = {Artiom Alhazov and Kenichi Morita},
title = {On Reversibility and Determinism in {P}~Systems},
booktitle = {Membrane Computing, 10th International Workshop, WMC 2009, Curtea de Arge{\c s}, Romania, August 24-27, 2009. Revised Selected and Invited Papers},
editor = {{\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and
Agust{\'i}n Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {5957},
publisher = {Springer},
year = {2010},
pages = {158--168},
bibdate = {07/12/10},
abstract = {Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for reversible P systems with either priorities or inhibitors, and a negative conjecture is stated for reversible P systems without such control. Strongly reversible P systems without control have shown to only generate sub-finite sets of numbers; this limitation does not hold if inhibitors are used.
Another concept considered is strong determinism, which is a syntactic property, as opposed to the determinism typically considered in membrane computing. Strongly deterministic P systems without control only accept sub-regular sets of numbers, while systems with promoters and inhibitors are universal.},
url = {http://dx.doi.org/10.1007/978-3-642-11467-0_12},
}
@article{Alhazov.etal:InflectionsRepl:CSJM2009,
author = {Artiom Alhazov and Elena Boian and Svetlana Cojocaru and {\relax Yu}rii Rogozhin},
title = {Modelling Inflections in {R}omanian Language by {P} Systems with String Replication},
journal = {Computer Science Journal of Moldova},
volume = {17},
number = {2(50)},
year = {2009},
pages = {160-178},
bibdate = {07/12/10},
abstract = {The aim of this article is the formalization of inflection process for the Romanian language using the model of P systems with cooperative string replication rules, which will make it possible to automatically build the morphological lexicons as a base for different linguistic applications.},
url = {http://www.math.md/publications/csjm/issues/v17-n2/10082/},
}
@inproceedings{Alhazov.etal:InsDelNote:PreWMC10:2009,
author = {Artiom Alhazov and Alexander Krassovitskiy
and {\relax Yu}rii Rogozhin and Sergey Verlan},
title = {A Note on P Systems with Small-Size Insertion and Deletion},
booktitle = {Preproceedings of the Tenth Workshop on Membrane Computing},
pages = {534--537},
year = {2009},
editor = {{\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and
Agust{\'i}n Riscos-N{\'u}{\~n}ez},
address = {Curtea de Arge{\c s}, Romania},
bibdate = {04/06/09},
abstract = {We present an overview of recent results on small size insertion-deletion P systems. Together with the ordinary definition we consider systems with priority of deletion over insertion. In both cases, obtained P systems are strictly more powerful than ordinary insertion-deletion systems, and in most of the cases they are computationally complete.We list several such results. When using the priority relation, the computational completeness may be achieved by context-free insertion and deletion of one symbol only.},
url = {http://www.gcn.us.es/?q=node/442},
}
@inproceedings{Alhazov.Morita:DRevP:PreWMC10:2009,
author = {Artiom Alhazov and Kenichi Morita},
title = {On Reversibility and Determinism in {P}~Systems},
booktitle = {Preproceedings of the Tenth Workshop on Membrane Computing},
pages = {129--140},
year = {2009},
editor = {{\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and
Agust{\'i}n Riscos-N{\'u}{\~n}ez},
address = {Curtea de Arge{\c s}, Romania},
bibdate = {04/06/09},
abstract = {Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. For one class of strongly reversible P systems, a very strong limitation is shown, and it is shown that this limitation does not
hold for a less restricted class.
Another concept considered is strong determinism, which is a syntactic property, as opposed to the determinism typically considered in membrane computing. A limitation is shown of one class, while a less restricted class is universal.},
url = {http://www.gcn.us.es/?q=node/442},
}
@inproceedings{Alhazov.etal:InflectionsRepl:PreWMC10:2009,
author = {Artiom Alhazov and Elena Boian and Svetlana Cojocaru and {\relax Yu}rii Rogozhin},
title = {Modelling Inflections in {R}omanian Language by {P} Systems with String Replication},
booktitle = {Preproceedings of the Tenth Workshop on Membrane Computing},
pages = {116--128},
year = {2009},
editor = {{\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and
Agust{\'i}n Riscos-N{\'u}{\~n}ez},
address = {Curtea de Arge{\c s}, Romania},
bibdate = {04/06/09},
abstract = {The aim of this article is the formalization of inflection process for the Romanian language using the model of P systems with cooperative string replication rules, which will make it possible to automatically build the morphological lexicons as a base for different linguistic applications.},
url = {http://www.gcn.us.es/?q=node/442},
}
@article{Alhazov.etal:PDict:IJCCC2009,
author = {Artiom Alhazov and Svetlana Cojocaru and Ludmila Malahova
and {\relax Yu}rii Rogozhin},
title = {Dictionary Search and Update by {P} Systems with
String-Objects and Active Membranes},
journal = {International Journal of Computers, Communications and Control},
volume = {IV},
number = {3},
year = {2009},
pages = {206-213},
bibdate = {07/12/10},
abstract = {Membrane computing is a formal framework of distributed parallel computing. In this paper we implement the work with the prefix tree by P systems with strings and active membranes. We present the algorithms of searching in a dictionary and updating it implemented as membrane systems. The systems are constructed as reusable modules, so they are suitable for using as sub-algorithms for solving more complicated problems.},
url = {http://www.journal.univagora.ro/?page=article_details&id=365},
}
@inproceedings{Alhazov.Morita:RevP:BWMC2009,
author = {Artiom Alhazov and Kenichi Morita},
title = {A Short Note on Reversibility in {P}~Systems},
booktitle = {Seventh Brainstorming Week on Membrane Computing},
address = {Sevilla, Spain},
editor = {Rosa Guti{\'e}rrez-Escudero and Miguel-Angel Guti{\'e}rrez-Naranjo and
{\relax Gh}eorghe P{\u a}un and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
volume = {1},
year = {2009},
month = {February 2-6},
pages = {23--28},
bibdate = {07/12/10},
abstract = {Membrane computing is a formal framework of distributed parallel computing. In this paper we study the reversibility and maximal parallelism of P systems from the computability point of view. The notions of reversible and strongly reversible systems are considered. The universality is shown for one class and a negative conjecture is stated for a more restricted class of reversible P systems. For one class of strongly reversible P systems, a very strong limitation is found, and it is shown that this limitation does not
hold for a less restricted class.},
url = {http://www.gcn.us.es/?q=node/414},
}
@inproceedings{Alhazov.etal:mInsDel:BWMC2009,
author = {Artiom Alhazov and Alexander Krassovitskiy
and {Yu}rii Rogozhin and Sergey Verlan},
title = {P Systems with Minimal Insertion and Deletion},
booktitle = {Seventh Brainstorming Week on Membrane Computing},
address = {Sevilla, Spain},
editor = {Rosa Guti{\'e}rrez-Escudero and Miguel-Angel Guti{\'e}rrez-Naranjo and
{\relax Gh}eorghe P{\u a}un and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
volume = {1},
year = {2009},
month = {February 2-6},
pages = {9--21},
bibdate = {07/12/10},
abstract = {In this paper we consider insertion-deletion P systems with priority of deletion over the insertion.We show that such systems with one symbol context-free insertion and deletion rules are able to generate PsRE. If one-symbol one-sided context is added to insertion or deletion rules but no priority is considered, then all recursively enumerable languages can be generated. The same result holds if a deletion of two symbols is permitted. We also show that the priority relation is very important and in its absence
the corresponding class of P systems is strictly included in MAT.},
url = {http://www.gcn.us.es/?q=node/414},
}
@inproceedings{Alhazov.etal:PDict:BWMC2009,
author = {Artiom Alhazov and Svetlana Cojocaru and Ludmila Malahova
and {\relax Yu}rii Rogozhin},
title = {Dictionary Search and Update by {P} Systems with
String-Objects and Active Membranes},
booktitle = {Seventh Brainstorming Week on Membrane Computing},
address = {Sevilla, Spain},
editor = {Rosa Guti{\'e}rrez-Escudero and Miguel-Angel Guti{\'e}rrez-Naranjo and
{\relax Gh}eorghe P{\u a}un and Ignacio P{\'e}rez-Hurtado and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
volume = {1},
year = {2009},
month = {February 2-6},
pages = {1--8},
bibdate = {07/12/10},
abstract = {Membrane computing is a formal framework of distributed parallel computing. In this paper we implement working with the prefix tree by P systems with strings and active membranes.},
url = {http://www.gcn.us.es/?q=node/414},
}
@article{Alhazov.etal:PartialPartitions:FI2009,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Sergey Verlan},
title = {Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions},
journal = {Fundamenta Informaticae},
volume = {91},
number = {1},
year = {2009},
month = {April},
pages = {17-34},
bibdate = {07/12/10},
abstract = {We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems using membrane rules with permitting contexts and working in different transition modes, especially for minimal parallelism. Both partial halting and minimal parallelism are based on an arbitrary set of subsets from the set of rules assigned to the membranes.},
keywords = {computational completeness, halting, minimal parallelism, P systems, permitting context},
url = {http://dx.doi.org/10.3233/FI-2009-0031},
}
@inproceedings{Alhazov.etal:SharpP:PreWMC9:2008,
author = {Artiom Alhazov and Liudmila Burtseva and Svetlana Cojocaru
and {\relax Yu}rii Rogozhin},
title = {Computing Solutions of {\#}{P}-complete Problems by {P} Systems with Active Membranes},
booktitle = {Preproceedings of the Ninth Workshop on Membrane Computing},
pages = {59--70},
year = {2008},
editor = {Pierluigi Frisco and David Wolfe Corne and {\relax Gh}eorghe P\u{a}un},
address = {Edinburgh, UK},
bibdate = {04/06/09},
abstract = {Membrane computing is a formal framework of distributed parallel
multiset processing. Due to massive parallelism and exponential space some
intractable computational problems can be solved by P systems with active
membranes in polynomial number of steps. In this paper we generalize this
approach from decisional problems to the computational ones, by providing
a solution of a #P-Complete problem, namely to compute the permanent
of a binary matrix.},
url = {http://ppage.psystems.eu/uploads/0/0f/PreProcWMC9.pdf},
}
@inproceedings{Alhazov.etal:PSync:PreWMC9:2008,
author = {Artiom Alhazov and Maurice Margenstern and Sergey Verlan},
title = {Fast Synchronization in {P}~Systems},
booktitle = {Preproceedings of the Ninth Workshop on Membrane Computing},
pages = {71--84},
year = {2008},
editor = {Pierluigi Frisco and David Wolfe Corne and {\relax Gh}eorghe P\u{a}un},
address = {Edinburgh, UK},
bibdate = {04/06/09},
abstract = {We consider the problem of synchronizing the activity of all membranes of a P system. After pointing at the connection with a similar problem dealt with
in the field of cellular automata where the problem is called the firing squad
synchronization problem, FSSP for short, we provide two algorithms to solve
this problem. One algorithm is non-deterministic and works in 2h+3, the other
is deterministic and works in 3h+3, where h is the height of the tree describing
the membrane structure.},
url = {http://ppage.psystems.eu/uploads/0/0f/PreProcWMC9.pdf},
}
@inproceedings{Alhazov.Rogozhin:OutskinMinSA2m:PostWMC8:2007,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Skin Output in {P} Systems with Minimal Symport/Antiport
and Two Membranes},
booktitle = {Membrane Computing, 8th International Workshop, WMC 2007, Thessaloniki, Greece, June 25-28, 2007 Revised Selected and Invited Papers},
editor = {George Eleftherakis and Petros Kefalas and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {4860},
publisher = {Springer},
year = {2007},
pages = {97--112},
bibdate = {07/12/10},
abstract = {It is known that symport/antiport P systems with two membranes and minimal cooperation can generate any recursively enumerable sets of natural numbers using exactly one superfluous object in the output membrane, where the output membrane is an elementary membrane. In this paper we consider symport/antiport P systems where the output membrane is the skin membrane. In this case we prove an unexpected characterization: symport/antiport P systems (and purely symport P systems) with two membranes and minimal cooperation generate exactly the recursively enumerable sets of natural numbers.},
url = {http://dx.doi.org/10.1007/978-3-540-77312-2_6},
}
@inproceedings{Alhazov.Perez:UniformQSAT:PostMCU2007,
author = {Artiom Alhazov and Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title = {Uniform Solution of {QSAT} Using Polarizationless Active Membranes},
booktitle = {Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orl{\'e}ans, France, September 10-13, 2007, Proceedings},
editor = {J{\'e}r{\^o}me Olivier Durand-Lose and Maurice Margenstern},
series = {Lecture Notes in Computer Science},
volume = {4664},
publisher = {Springer},
year = {2007},
pages = {122--133},
bibdate = {07/12/10},
abstract = {It is known that the satisfiability problem (SAT) can be solved with a semi-uniform family of deterministic polarizationless P systems with active membranes with non-elementary membrane division. We present a double improvement of this result by showing that the satisfiability of a quantified Boolean formula (QSAT) can be solved by a uniform family of P systems of the same kind.},
url = {http://dx.doi.org/10.1007/978-3-540-74593-8_11},
}
@inproceedings{Alhazov.etal:PartialContexts:PostMCU2007,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Sergey Verlan},
title = {Partial Halting in {P} Systems Using Membrane Rules with Permitting Contexts},
booktitle = {Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orl{\'e}ans, France, September 10-13, 2007, Proceedings},
editor = {J{\'e}r{\^o}me Olivier Durand-Lose and Maurice Margenstern},
series = {Lecture Notes in Computer Science},
volume = {4664},
publisher = {Springer},
year = {2007},
pages = {110--121},
bibdate = {07/12/10},
abstract = {We consider a new variant of the halting condition in P systems, i.e., a computation in a P system is already called halting if not for all membranes a rule is applicable anymore at the same time, whereas usually a computation is called halting if no rule is applicable anymore in the whole system. This new variant of partial halting is especially investigated for several variants of P systems using membrane rules with permitting contexts and working in different derivation modes.},
keywords = {computational completeness, halting, minimal parallelism, P systems, permitting context},
url = {http://dx.doi.org/10.1007/978-3-540-74593-8_10},
}
@article{Alhazov.etal:tSAmincoo:IJFCS2007,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin and Sergey Verlan},
title = {Minimal Cooperation in Symport/Antiport Tissue {P}~Systems},
journal = {International Journal of Foundations of Computer Science},
volume = {18},
number = {1},
year = {2007},
month = {February},
pages = {163-180},
bibdate = {07/12/10},
abstract = {We investigate tissue P systems with symport/antiport with minimal cooperation, i.e., when only 2 objects may interact. We show that 2 cells are enough in order to generate all recursively enumerable sets of numbers. Moreover, constructed systems simulate register machines and have purely deterministic behavior. We also investigate systems with one cell and we show that they may generate only finite sets of numbers.},
url = {http://dx.doi.org/10.1142/S0129054107004619},
}
@inproceedings{Alhazov.Rogozhin:MinSA2mToChar:PostWMC7:2006,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Towards a Characterization of {P} Systems with
Minimal Symport/Antiport and Two Membranes},
booktitle = {Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers},
editor = {Hendrik-Jan Hoogeboom and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {4361},
publisher = {Springer},
year = {2006},
pages = {135--153},
bibdate = {07/12/10},
abstract = {We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems (purely symport P systems) with two membranes and minimal cooperation generate any recursively enumerable sets of natural numbers without zero. Thus we improve our previous results for symport/antiport P systems with two membranes and minimal cooperation from three ``garbage'' objects down to one object and for purely symport P systems from six objects down to one object. Thus we show the optimality of these results.},
url = {http://dx.doi.org/10.1007/11963516_9},
}
@inproceedings{Alhazov.etal:Extended_Spiking:PostWMC7:2006,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Marija Slavkovik},
title = {Extended Spiking Neural {P}~Systems},
booktitle = {Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers},
editor = {Hendrik-Jan Hoogeboom and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {4361},
publisher = {Springer},
year = {2006},
pages = {123--134},
bibdate = {07/12/10},
abstract = {We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy proofs of the computational completeness of extended spiking neural P systems and for the characterization of semilinear sets and regular languages by finite extended spiking neural P systems (defined by having only finite checking sets in the rules assigned to the cells) with only a bounded number of neurons.},
url = {http://dx.doi.org/10.1007/11963516_8},
}
@inproceedings{Alhazov.etal:SASurvey:PostWMC6:2006,
author = {Artiom Alhazov and Rudolf Freund and {\relax Yu}rii Rogozhin},
title = {Computational Power of Symport/Antiport:
History, Advances and Open Problems},
booktitle = {Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers},
editor = {Rudolf Freund and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3850},
publisher = {Springer},
year = {2006},
pages = {1--30},
bibdate = {07/12/10},
abstract = {We first give a historical overview of the most important results obtained in the area of P systems and tissue P systems with symport/antiport rules, especially with respect to the development of computational completeness results improving descriptional complexity parameters. We consider the number of membranes (cells in tissue P systems), the weight of the rules, and the number of objects. Then we establish our newest results: P systems with only one membrane, symport rules of weight three, and with only seven additional objects remaining in the skin membrane at the end of a halting computation are computationally complete; P systems with minimal cooperation, i.e., P systems with symport/antiport rules of size one and P systems with symport rules of weight two, are computationally complete with only two membranes with only three and six, respectively, superfluous objects remaining in the output membrane at the end of a halting computation.},
url = {http://dx.doi.org/10.1007/11603047_1},
}
@inproceedings{Alhazov.etal:PCarpet:PostWMC6:2006,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald},
title = {Symbol/Membrane Complexity of {P} Systems with Symport/Antiport Rules},
booktitle = {Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers},
editor = {Rudolf Freund and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3850},
publisher = {Springer},
year = {2006},
pages = {96--113},
bibdate = {07/12/10},
abstract = {We consider P systems with symport/antiport rules and small
numbers of symbols and membranes and present several results for
P systems with symport/antiport rules simulating register machines
with the number of registers depending on the number s of symbols and
the number m of membranes. For instance, any recursively enumerable
set of natural numbers can be generated (accepted) by systems with
s> = 2 symbols and m>=1 membranes such that m+s>=6. In particular
the result of the original paper [16] proving universality for three
symbols and four membranes is improved (e.g., three symbols and three
membranes are sufficient). The general results that P systems with
symport/antiport rules with s symbols and m membranes are able to
simulate register machines with max{m(s-2),(m-1)(s-1)} registers
also allows us to give upper bounds for the numbers s and
m needed to generate/accept any recursively enumerable set of k-
dimensional vectors of non-negative integers or to compute any partial
recursive function f:N^a->N^b.
Finally, we also study the computational
power of P systems with symport/antiport rules and only
one symbol: with one membrane, we can exactly generate the family
of finite sets of non-negative integers; with one symbol and two
membranes, we can generate at least all semilinear sets. The most interesting
open question is whether P systems with symport/antiport
rules and only one symbol can gain computational completeness (even
with an arbitrary number of membranes) as it was shown for tissue P
systems in [1].},
url = {http://dx.doi.org/10.1007/11603047_7},
}
@inproceedings{Alhazov:ProtonBicat:PostWMC6:2006,
author = {Artiom Alhazov},
title = {Number of Proton/Bi-stable Catalysts and Membrane in {P} Systems. {T}ime Freeness},
booktitle = {Membrane Computing, 6th International Workshop, WMC 2005, Vienna, Austria, July 18-21, 2005, Revised Selected and Invited Papers},
editor = {Rudolf Freund and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3850},
publisher = {Springer},
year = {2006},
pages = {79--95},
bibdate = {07/12/10},
abstract = {Proton pumping P systems are a variant of membrane systems with both rewriting rules and symport/antiport rules, where a set of objects called protons is distinguished, every cooperative symport or antiport rule involves a proton, but no rewriting rule does. Time-freeness property means the result of all computations does not depend on the time it takes to execute the rules.
The goal of this article is to improve (showing that two membranes are sufficient) the known universality results on proton pumping P systems, establishing at the same time an upper bound on the number of protons, namely one, or four for time-free systems.
All results mentioned hold for proton pumping P systems with non-cooperative rewriting and either symport/antiport rules of weight one (classical variant) or symport rules of weight at most two. As a corollary, we obtain the universality of P systems with one membrane and one bi-stable catalyst, or the universality of time-free P systems with one membrane and four bi-stable catalysts. All universality results are stated as generating RE (except the time-free systems without targets generate PsRE).},
url = {http://dx.doi.org/10.1007/11603047_6},
}
@inproceedings{Alhazov.etal:PolarCreaOC:PostSYNASC:IEEE2005,
author = {Artiom Alhazov and Rudolf Freund
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title = {One and Two Polarizations, Membrane Creation and Objects Complexity in {P} Systems},
booktitle = {Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 05},
publisher = {IEEE Computer Society},
year = {2005},
pages = {385--394},
bibdate = {07/12/10},
abstract = {We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region (except the environment) contains more than one object of the same kind. We here show that they generate all recursively enumerable languages, and two membrane labels are sufficient (the same result holds for accepting all recursively enumerable vectors of non-negative integers). Moreover, at most two objects are present inside the system at any time in the generative case. Then we prove that 10+m symbols are enough to generate any recursively enumerable language over m symbols.
P systems with active membranes without polarizations are known to generate all recursively enumerable sets of vectors of non-negative integers. We show that they generate all recursively enumerable languages; four starting membranes with three labels or seven starting membranes with two labels are sufficient. P systems with active membranes and two polarizations are known to generate/accept all recursively enumerable sets of vectors of non-negative integers, only using rules of rewriting and sending objects out. We show that accepting can be done by deterministic systems. Finally, remarks and open questions are presented.},
url = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.54},
}
@inproceedings{Alhazov.etal:tCarpet:PostDLT2005,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald},
title = {Tissue {P} Systems with Antiport Rules and Small Numbers of Symbols and Cells},
booktitle = {Developments in Language Theory, 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings},
editor = {Clelia de Felice and Antonio Restivo},
series = {Lecture Notes in Computer Science},
volume = {3572},
publisher = {Springer},
year = {2005},
pages = {100--111},
bibdate = {07/12/10},
abstract = {We consider tissue P systems with antiport rules and investigate their computational power when using only a (very) small number of symbols and cells. Even when using only one symbol, any recursively enumerable set of natural numbers can be generated with at most seven cells. On the other hand, with only one cell we can only generate regular sets when using one channel with the environment, whereas one cell with two channels between the cell and the environment obtains computational completeness with at most five symbols. Between these extreme cases of one symbol and one cell, respectively, there seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.},
keywords = {antiport rules, cells, membrane computing, tissue P systems},
url = {http://www.springerlink.com/content/h4w6864wgf2qhyq6/},
}
@inproceedings{Alhazov.etal:Pol2Compl:PostMCU2004:2005,
author = {Artiom Alhazov and Rudolf Freund and {\relax Gh}eorghe P{\u a}un},
title = {Computational Completeness of {P} Systems with Active Membranes and Two Polarizations},
booktitle = { Machines, Computations, and Universality: 4th International Conference, MCU2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers},
editor = {Maurice Margenstern},
series = {Lecture Notes in Computer Science},
volume = {3354},
publisher = {Springer},
year = {2005},
pages = {178--189},
bibdate = {07/12/10},
abstract = {P systems with active membranes using only two electrical charges and only rules of type (a), i.e., evolution rules used in parallel in the regions of the membrane system, and of type (c), i.e., communication rules sending out an object of a membrane thereby possibly changing the polarization of this membrane, assigned to at most two membranes are shown to be computationally complete, which improves the previous result of this type with respect to the number of polarizations as well as to the number of membranes. Allowing a special variant (c_\lambda) of rules of type (c) to delete symbols by sending them out, even only one membrane is enough.},
url = {http://www.springerlink.com/content/7mllx684jbabqtk2/},
}
@inproceedings{Alhazov.Sburlan:PMRncooProInh:PostWMC5:2005,
author = {Artiom Alhazov and Drago{\c s} Sburlan},
title = {Ultimately Confluent Rewriting Systems. {P}arallel Multiset-Rewriting with Permitting or Forbidding Contexts},
booktitle = {International Workshop WMC5, Milano, Italy, 2004},
editor = {Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3365},
publisher = {Springer},
year = {2005},
pages = {178--189},
bibdate = {07/12/10},
abstract = {The aim of this paper is to study the power of parallel multiset-rewriting systems with permitting or forbidding context (or P systems with non-cooperative rules with promoters or inhibitors). The main results obtained are those if we use promoters or inhibitors of weight two, then the systems are computational universal.
Moreover, both constructions satisfy a special property we define: they are ultimately confluent. This means that if the system allows at least one halting computation, then their final configurations are reachable from any reachable configuration. The other property both constructions satisfy is that a system allowing at least one halting computation will halt with probability 1.},
url = {http://www.springerlink.com/content/844258u0uu3vrept/},
}
@inproceedings{Alhazov.Freund:Pol2Eff:PostWMC5:2005,
author = {Artiom Alhazov and Rudolf Freund},
title = {On the Efficiency of {P} Systems with Active Membranes and Two Polarizations},
booktitle = {International Workshop WMC5, Milano, Italy, 2004},
editor = {Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3365},
publisher = {Springer},
year = {2005},
pages = {146--160},
bibdate = {07/12/10},
abstract = {We present an algorithm for deterministically deciding SAT in linear time by P systems with active membranes using only two polarizations and rules of types (a), (c) and (e). Moreover, various restrictions on the general form of the rules are considered: global, non-renaming, independent of the polarization, preserving it, changing it, producing two membranes with different polarizations, having exactly one or two objects in (each membrane of) the right-hand side, improving results from [1]. Several problems related to different combinations of these restrictions are formulated, too.},
url = {http://www.springerlink.com/content/2be8vy2yfy8u8gka/},
}
@inproceedings{Alhazov.Sburlan:PMRncooPro:BWMC2004,
author = {Artiom Alhazov and Drago{\c s} Sburlan},
title = {({U}ltimately Confluent) Parallel Multiset-Rewriting Systems with Context},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and
Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {45--52},
bibdate = {07/12/10},
abstract = {The aim of this paper is to study the power of parallel
multiset-rewriting systems with permitting context (or P systems
with non-cooperative rules with promoters). The main result obtained
is that if we use promoters of weight two, then the system is universal.
Moreover, the construction satisfies a special property we define:
it is ultimately confluent. This means that if the system allows
at least one halting computation, then its final configuration
is reachable from any reachable configuration.},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@mastersthesis{Kogler:2009,
author = {Marian Kogler},
title = {Controlled Use of Partitionings of Rule Sets in (Tissue) {P} Systems},
school = {Faculty of Computer Science. TU Vienna},
year = {2009},
month = {September},
address = {Vienna, Austria},
bibdate = {05/20/10},
}
@inproceedings{Freund.Kogler:2009b,
author = {Rudolf Freund and Marian Kogler},
title = {Drip and Mate Operations Acting in Test Tube
Systems and Tissue-like {P} systems},
booktitle = {Third Workshop on Membrane Computing and
Biologically Inspired Process Calculi 2009},
editor = {G. Ciobanu},
pages = {123-136},
year = {2009},
bibdate = {05/20/10},
}
@inproceedings{Freund.etal:2009a,
author = {Rudolf Freund and Marian Kogler and Sergey
Verlan},
title = {P automata with controlled use of minimal
communication rules},
booktitle = {Workshop on Non-Classical Models for Automata and
Applications (NCMA)},
editor = {H. Bordihn and R. Freund and M. Holzer and M.
Kutrib and F. Otto},
pages = {107--119},
year = {2009},
bibdate = {05/20/10},
}
@inproceedings{Freund.Kogler:2009a,
author = {Rudolf Freund and Marian Kogler},
title = {Hybrid transition modes in tissue {P} systems},
booktitle = {Tenth Workshop on Membrane Computing},
editor = {Gh. P{\u a}un and M.J. P\'{e}rez-Jim\'{e}nez and A.
Riscos-N\'{u}ñez},
pages = {228-239},
year = {2009},
bibdate = {05/20/10},
}
@article{Ishdorj.etal:2010,
author = {Tseren-Onolt Ishdorj and Alberto Leporati and
Linqiang Pan and Xiangxiang Zeng and Xingyi
Zhang},
title = {Deterministic Solutions to QSAT and Q3SAT by
Spiking Neural P Systems with Pre-Computed
Resources},
journal = {Theoretical Computer Science},
bibdate = {01/22/10},
}
@article{Pan.etal:2010c,
author = { Linqiang Pan and Mario J. P{\'e}rez-Jim{\'e}nez},
title = {Computational Complexity of Tissue-like P Systems},
journal = {Journal of Complexity},
bibdate = {01/22/10},
}
@article{Pan.etal:2010b,
author = {Linqiang Pan and Gheorghe P\u{a}un},
title = {Spiking Neural P Systems: An Improved Normal Form},
journal = {Theoretical Computer Science},
volume = {411},
year = {2010},
pages = {906--918},
bibdate = {01/22/10},
}
@article{Subramanian.etal:2009b,
author = {K.G. Subramanian and Linqiang Pan and See Keong Lee and Atulya K. Nagar},
title = {P systems and context-free 2D picture languages},
journal = {Proceedings of the 4th BIC-TA},
year = {2009},
pages = {336--340},
bibdate = {01/22/10},
}
@article{Zeng.etal:2009,
author = {Xiangxiang Zeng and Chun Lu and Linqiang Pan},
title = {A weakly universal spiking neural P system},
journal = { Proceedings of the 4th BIC-TA},
year = {2009},
bibdate = {01/22/10},
}
@article{Pan.etal:2010,
author = {L. Pan and X. Zeng},
title = {A note on small universal spiking neural P systems},
journal = {Pre-proceedings of Tenth Workshop on Membrane Computing},
pages = {2009},
bibdate = {01/22/10},
}
@article{Wang.etal:2009,
author = { J. Wang and H.J. Hoogeboom and L. Pan and Gheorghe P\u{a}un},
title = {Spiking neural P systems with weights and thresholds},
journal = {Pre-proceedings of Tenth Workshop on Membrane Computing},
year = {2009},
bibdate = {01/22/10},
}
@article{Pan.etal:2009,
author = {Linqiang Pan and Gheorghe P\u{a}un},
title = {Spiking Neural P Systems with Anti-Spikes},
journal = {Int. J. of Computers, Communications {\&} Control},
volume = {4},
number = {3},
year = {2009},
pages = {273--282},
bibdate = {01/22/10},
}
@article{Zhang.etal:2009b,
author = {Xingyi Zhang and Xiangxiang Zeng and Linqiang Pan},
title = {On String Languages Generated by Asynchronous Spiking Neural P Systems},
journal = {Theoretical Computer Science},
volume = {410},
year = {2009},
pages = {2478--2488},
bibdate = {01/22/10},
}
@article{Zhang.etal:2009,
author = {Xingyi Zhang and Jun Wang and Linqiang Pan},
title = {A Note on the Generative Power of Axon P Systems},
journal = {International Journal of Computers, Communications {\&} Control},
volume = {4},
year = {2009},
pages = {92--98},
bibdate = {01/22/10},
}
@article{Pan.etal:2008,
author = {Linqiang Pan and Xingyi Zhang and Xiangxiang Zeng and Jun Wang},
title = {Research Advances and Prospect of Spiking Neural P Systems},
year = {2008},
journal = {Chinese Journal of Computers},
volume = {12},
pages = {2090--2096},
bibdate = {01/22/10},
}
@article{Zhang.etal:2008e,
author = {Xingyi Zhang and Xiangxiang Zeng and Linqiang Pan},
title = {Smaller Universal Spiking Neural P Systems},
journal = {Fundamenta Informaticae},
volume = {87},
number = {1},
year = {2008},
pages = {117--136},
bibdate = {01/22/10},
}
@article{Zhang.etal:2008d,
author = {Xingyi Zhang and Xiangxiang Zeng and Linqiang Pan},
title = {On string languages generated by spiking neural P systems with exhaustive use of rules},
journal = {Natural Computing},
volume = {7},
number = {4},
year = {2008},
pages = {535--549},
bibdate = {01/22/10},
}
@article{Ciobanu.etal:2007b,
author = {Gabriel Ciobanu and Linqiang Pan and Gheorghe P\u{a}un and Mario J.P{\'e}rez-Jim{\'e}nez},
title = {P systems with minimal parallelism},
journal = {Theoretic Computer Science},
volume = {378},
year = {2007},
pages = {117--130},
bibdate = {01/22/10},
}
@article{Pan.Alhazov:HPPSAT:AI2006,
author = { Linqiang Pan and Artiom Alhazov},
title = {Solving {HPP} and {SAT} by {P} Systems with Active Membranes and Separation Rules},
journal = {Acta Informatica},
volume = {43},
number = {2},
year = {2006},
pages = {131--145},
bibdate = {01/22/10},
abstract = {The P systems (or membrane systems) are a class of distributed parallel computing devices of a biochemical type, where membrane division is the frequently investigated way for obtaining an exponential working space in a linear time, and on this basis solving hard problems, typically NP-complete problems, in polynomial (often, linear) time. In this paper, using another way to obtain exponential working space - membrane separation, it was shown that Satisfiability Problem and Hamiltonian Path Problem can be deterministically solved in linear or polynomial time by a uniform family of P systems with separation rules, where separation rules are not changing labels, but polarizations are used. Some related open problems are mentioned.},
url = {http://dx.doi.org/10.1007/s00236-006-0018-8},
}
@article{Pan.etal:2006,
author = {Linqiang Pan and Carlos Mart{\'i}n-Vide},
title = {Further remark on P systems with active membranes and two polarizations},
journal = {Journal of Parallel and Distributed Computing},
volume = {66},
year = {2006},
pages = {867--872},
bibdate = {01/22/10},
}
@inbook{Alhazov.etal:Graph:AspectsMC2004,
author = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and Linqiang Pan},
title = {Solving Graph Problems by {P} Systems with
Restricted Elementary Active Membranes},
series = {Lecture Notes in Computer Science},
volume = {2950},
year = {2004},
publisher = {Springer},
pages = {1--22},
booktitle = {Aspects of Molecular Computing - Essays dedicated
to Tom Head on the occasion of his 70th birthday},
editor = {Nata{\u s}a Jonoska and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg},
bibdate = {01/22/10},
abstract = {P systems are parallel molecular computing models based
on processing multisets of objects in cell-like membrane structures.
In this paper we give membrane algorithms to solve the vertex cover
problem and the clique problem in linear time with respect to
the number of vertices and edges of the graph by recognizing P systems
with active membranes using 2-division. Also, the linear time solution
of the vertex cover problem is given using P systems with
active membranes using 2-division and linear resources.},
url = {http://www.springerlink.com/content/e9c2pk249m1tdj7b/},
}
@Book{ Paun:DNA.Splicing.computing,
author = {Gheorghe P\u{a}un},
title = {Computability of the {DNA} and cells. Splicing and
membrane computing},
publisher = {SBEB Publishing},
year = {2008},
address = {Choundrant, Louisiana},
}
@Book{ Frisco:Cells-Advances-in-Membrane-Computing,
author = {Pierluigi Frisco},
title = {Computing with Cells. Advances in Membrane Computing},
publisher = {Oxford University Press},
year = {2008},
}
@PhDThesis{ Ionescu:Membrane-Computing-Traces,
author = {Mihai Ionescu},
title = {Membrane Computing. Traces, Neural Inspired Models
Controls},
school = {Universitat Rovira i Virgili},
year = {2008},
address = {Tarragona, Spain},
}
@PhDThesis{ Brijder:Natural-Computation-Gene-Assembly.Systems,
author = {Robert Brijder},
title = {Models of Natural Computation: Gene Assembly and Membrane
Systems},
school = {Leiden University},
year = {2008},
address = {Netherlands},
}
@techreport{Alhazov.Verlan:TinySA:2008,
author = {Artiom Alhazov and Sergey Verlan},
title = {Minimization Strategies for Maximally Parallel
Multiset Rewriting Systems},
institution = {Turku Centre for Computer Science},
type = {Technical Report},
number = {862},
year = {2008},
bibdate = {03/03/08},
abstract = {Maximally parallel multiset rewriting systems (MPMRS) present
a convenient way to express relations between unstructured objects.
The functioning of various computational devices may be expressed in terms
of MPMRS (e.g. register machines and many variants of P systems).
In particular, this means that MPMRS are computationally complete;
however, a direct translation leads to quite a big number of rules.
Like for other classes of computationally complete devices
there is a challenge to find a universal system having the smallest number
of rules. In this article we present different rule minimization strategies
for MPMRS based on encodings and structural transformations.
We apply these strategies to the translation of a small universal
register machine (Korec, 1996) and we show that there exists
a universal MPMRS with 23 rules. Since MPMRS are identical to a restricted
variant of P systems with antiport rules, the results we obtained improve
previously known results on the number of rules for that systems.},
url = {http://tucs.fi/publications/insight.php?id=tAlVe08a},
}
@TechReport{ Murphy.ea:NL-using-membrane-systems-without-charges.dissolution,
author = {Niall Murphy and Damien Woods},
title = {A characterisation of {NL} using membrane systems without
charges and dissolution},
institution = {Department of Computer Science, National University of
Ireland, Maynooth},
year = {2008},
type = {Technical Report},
number = {2008-01},
}
@article{Cazzaniga.etal:2008,
author = {Paolo Cazzaniga and Dario Pescini and Daniela Besozzi and
Giancarlo Mauri and Sonia Colombo and Enzo Martegani},
title = {Modeling and stochastic simulation of the Ras/cAMP/PKA pathway
in the yeast Saccharomyces cerevisiae evidences a key regulatory
function for intracellular guanine nucleotides pools},
journal = {Journal of Biotechnology},
volume = {133},
number = {3},
year = {2008},
pages = {377-385},
bibdate = {07/06/09},
}
@phdthesis{Liang:2007,
author = {Huang Liang},
title = {Research on Membrane Computing. Optimization Methods},
school = {Institute of Advanced Process Control, Zhejiang University},
year = {2007},
address = {China},
bibdate = {04/06/09},
}
@phdthesis{Romero-Campero:2008,
author = {Francisco J. Romero-Campero},
title = {{P}~systems, a computational modelling framework for systems
biology},
school = {Universidad de Sevilla},
year = {2008},
address = {Spain},
bibdate = {04/06/09},
}
@inproceedings{Paun:2008c,
author = {Gheorghe P\u{a}un},
title = {An introduction to {MC}, after 10 years, by means of a
(partial) glossary},
booktitle = {Second International Meeting on Membrane Computing
and Biologically Inspired Process Calculi},
editor = {Gabriel Ciobanu},
pages = {1-9},
year = {2008},
venue = {Ia\c{s}i, Romania},
bibdate = {04/06/09},
}
@inproceedings{Pinna.etal:2008,
author = {G. Michele Pinna and Andrea Saba},
title = {An event based semantics of P systems},
booktitle = {Second International Meeting on Membrane Computing
and Biologically Inspired Process Calculi},
editor = {Gabriel Ciobanu},
pages = {174-187},
year = {2008},
venue = {Ia\c{s}i, Romania},
bibdate = {04/06/09},
}
@inproceedings{Mazza.etal:2008,
author = {Tommaso Mazza and Matteo Cavaliere},
title = {Cell cycle and tumor growth in membrane systems with
peripheral proteins},
booktitle = {Second International Meeting on Membrane Computing
and Biologically Inspired Process Calculi},
editor = {Gabriel Ciobanu},
pages = {145-158},
year = {2008},
venue = {Ia\c{s}i, Romania},
bibdate = {04/06/09},
}
@inproceedings{Barbuti.etal:2008e,
author = {Roberto Barbuti and Andrea Maggiolo-Schettini and Paolo
Milazzo and Luca Tesei},
title = {Timed {P}~automata},
booktitle = {Second International Meeting on Membrane Computing and
Biologically Inspired Process Calculi},
editor = {Gabriel Ciobanu},
pages = {53-67},
year = {2008},
venue = {Ia\c{s}i, Romania},
bibdate = {04/06/09},
}
@inproceedings{Ipate.etal:2008,
author = {Florentin Ipate and Marian Gheorghe},
title = {Testing non-deterministic stream {X}-machine models and
{P}~systems},
booktitle = {Second International Meeting on Membrane Computing and
Biologically Inspired Process Calculi},
editor = {Gabriel Ciobanu},
pages = {117-130},
year = {2008},
venue = {Ia\c{s}i, Romania},
bibdate = {04/06/09},
}
@inproceedings{Serbanuta.etal:2009,
author = {Traian Serbanuta and Gheorghe
Stefanescu and Grigore Rosu},
title = {Defining and Executing {P}~Systems with Structured
Data in~{K}},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {374-393},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
Series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Sempere:2009,
author = {Jos{\'e} M. Sempere},
title = {Translating Multiset Tree Automata into {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Pescini.etal:2009,
author = {Dario Pescini and Paolo Cazzaniga and Claudio Ferretti and
Giancarlo Mauri},
title = {First Steps Towards a Wet Implementation for $\tau$-{DPP}},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {355-373},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Nguyen.etal:2009,
author = {Van Nguyen and David Kearney and Gianpaolo Gioiosa},
title = {An Algorithm for Non-deterministic Object Distribution in
{P}~Systems and Its Implementation in Hardware},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {325-354},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Muskulus:2009,
author = {Michael Muskulus},
title = {Applications of Page Ranking in {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {311-324},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Manca.etal:2009,
author = {Vincenzo Manca and Roberto Pagliarini and Simone Zorzan},
title = {Toward an {MP} Model of Non-Photochemical Quenching},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {299-310},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Manca:2009,
author = {Vincenzo Manca},
title = {Enumerating Membrane Structures},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {292-298},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Leporati.etal:2009,
author = {Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title = {How Redundant Is Your Universal Computation Device?},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {274-291},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Kefalas.etal:2009,
author = {Petros Kefalas and Ioanna Stamatopoulou and George
Eleftherakis and Marian Gheorghe},
title = {Transforming State-Based Models to {P}~Systems Models in
Practice},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {260-273},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Jack.etal:2009,
author = {John Jack and Andrei P\u{a}un and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title = {Effects of {HIV-1} Proteins on the {F}as-Mediated Apoptotic
Signaling Cascade: A Computational Study of Latent {CD4+},
{T}~Cell Activation},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {246-259},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Hinze.etal:2009,
author = {Thomas Hinze and Raffael Fassler and Thorsten Lenser and
Naoki Matsumaru and Peter Dittrich},
title = {Event-Driven Metamorphoses of {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {231-245},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Gutierrez-Naranjo.etal:2009,
author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario
J. P{\'e}rez-Jim{\'e}nez},
title = {Hebbian Learning from Spiking Neural {P}~Systems View},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {217-230},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Gheorghe.etal:2009,
author = {Marian Gheorghe and Florentin Ipate},
title = {On Testing {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {204-216},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Diaz-Pernil.etal:2009,
author = {Daniel D{\'i}az-Pernil and Ignacio P{\'e}rez-Hurtado
and Mario J. P{\'e}rez-Jim{\'e}nez Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title = {A {P}-{L}ingua Programming Environment for Membrane
Computing},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {187-203},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Frutos.etal:2009,
author = {Juan Alberto Frutos and Fernando Arroyo and Alberto Arteta},
title = {Usefulness States in New {P}~System Communication
Architectures},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {169-186},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Castellini.etal:2009,
author = {Alberto Castellini and Vincenzo Manca},
title = {{M}eta{P}lab: A Computational Framework for Metabolic
{P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {157-168},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Colomer.etal:2009,
author = {M{\'o}nica Cardona M. Angels Colomer and Mario
J. P{\'e}rez-Jim{\'e}nez and Delf{\'i} Sanuy and
Antoni Margalida},
title = {Modeling Ecosystems Using {P}~Systems: The Bearded Vulture, a
Case Study},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {137-156},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Beyreder.etal:2009,
author = {Markus Beyreder and Rudolf Freund},
title = {Membrane Systems Using Noncooperative Rules with
Unconditional Halting},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {129-136},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Alhazov.etal:PSync:PostWMC9:2009,
author = {Artiom Alhazov and Maurice Margenstern and Sergey Verlan},
title = {Fast Synchronization in {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {118--128},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and {\relax Gh}eorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {5391},
publisher = {Springer},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
abstract = {We consider the problem of synchronizing the activity of all membranes of a P system. After pointing the connection with a similar problem dealt with in the field of cellular automata, where the problem is called the firing squad synchronization problem, FSSP for short, we provide two algorithms to solve this problem for P systems. One algorithm is non-deterministic and works in 2h+3 steps, the other is deterministic and works in 3h+3 steps, where h is the height of the tree describing the membrane structure.},
url = {http://dx.doi.org/10.1007/978-3-540-95885-7_9},
}
@inproceedings{Alhazov.etal:SharpP:PostWMC9:2009,
author = {Artiom Alhazov and Liudmila Burtseva and Svetlana Cojocaru
and {\relax Yu}rii Rogozhin},
title = {Solving {PP}-Complete and {\#}{P}-Complete Problems by
{P}~Systems with Active Membranes},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {108--117},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and {\relax Gh}eorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {5391},
publisher = {Springer},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
abstract = {Membrane computing is a formal framework of distributed parallel multiset processing. Due to massive parallelism and exponential space some intractable computational problems can be solved by P systems with active membranes in a polynomial number of steps. In this paper we generalize this approach from decisional problems to the computational ones, by providing a solution of a #P-complete problem, namely to compute the permanent of a binary matrix. The implication of this result to the PP complexity class is discussed and compared to known results about NP U co-NP.},
url = {http://dx.doi.org/10.1007/978-3-540-95885-7_8},
}
@inproceedings{Agrigoroaiei.etal:2009,
author = {Oana Agrigoroaiei and Gabriel Ciobanu},
title = {Dual {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {95-107},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Abdulla.etal:2009,
author = {Parosh Aziz Abdulla and Giorgio Delzanno and Laurent Begin},
title = {On the Qualitative Analysis of Conformon {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {78-94},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Romero-Campero.etal:2009b,
author = {Francisco J. Romero-Campero and Jamie Twycross and Hongqing
Cao, Jonathan Blakes, Natalio Krasnogor},
title = {A Multiscale Modeling Framework Based on {P}~Systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {63-77},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Kirkilionis.etal:2009b,
author = {Markus Kirkilionis and Mirela Domijan and Martin Eigel and
Erwin George and Mike Li and Luca Sbano},
title = {A Definition of Cellular Interface Problems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {36-62},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Hogeweg:2009,
author = {Paulien Hogeweg},
title = {Multilevel Modeling of Morphogenesis},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {29-35},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Gilbert.etal:2009,
author = {David Gilbert and Rainer Breitling and Monika Heiner and
Robin Donaldson},
title = {An Introduction to BioModel Engineering, Illustrated for
Signal Transduction Pathways},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {13-28},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Danos.etal:2009,
author = {Vincent Danos and Jérôme Féret and Walter Fontana and Russell
Harmer and Jean Krivine},
title = {Investigation of a Biological Repair Scheme},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {1-12},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Gershoni.etal:2008,
author = {Renana Gershoni and Ehud Keinan and Gheorghe P\u{a}un and Ron
Piran and Tamar Ratner and Sivan Shoshani},
title = {Research topics arising from the (planned) {P}~systems
implementation experiment in {T}echnion},
booktitle = {Sixth Brainstorming Week on Membrane Computing},
pages = {183-192},
year = {2008},
editor = {Daniel D{\'i}az-Pernil and Carmen Graciani and Miguel Angel
Guti{\'e}rrez-Naranjo and Gheorghe P\u{a}un and Ignacio
P{\'e}rez-Hurtado and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
venue = {Sevilla, Spain},
bibdate = {04/06/09},
}
@inproceedings{Frisco.etal:2008,
author = {Pierluigi Frisco and Gheorghe P\u{a}un},
title = {No cycles in compartments. Starting from conformon-{P},
systems},
booktitle = {Sixth Brainstorming Week on Membrane Computing},
pages = {157-179},
year = {2008},
editor = {Daniel D{\'i}az-Pernil and Carmen Graciani and Miguel Angel
Guti{\'e}rrez-Naranjo and Gheorghe P\u{a}un and Ignacio
P{\'e}rez-Hurtado and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
venue = {Sevilla, Spain},
bibdate = {04/06/09},
}
@inproceedings{Paun.etal:2008,
author = {Gheorghe P\u{a}un and Francisco J. Romero-Campero},
title = {Membrane computing as a modeling framework. Cellular systems
case studies},
booktitle = {Formal Methods for Computational Systems Biology},
pages = {168-214},
year = {2008},
editor = {Marco Bernardo and Pierpaolo Degano and Gianluigi Zavattaro},
volume = {5016},
series = {Lecture Notes in Computer Science},
venue = {Bertinoro, Italy},
bibdate = {04/06/09},
}
@inproceedings{Stamatopoulou.etal:2008,
author = {Ioanna Stamatopoulou and Petros Kefalas and Marian Gheorghe},
title = {{OPERAS}: A Framework for the Formal Modelling of Multi-Agent
Systems and Its Application to Swarm-Based Systems},
booktitle = {Engineering Societies in the Agents World VIII: 8th
International Workshop},
pages = {158-174},
year = {2008},
editor = {Alexander Artikis and Gregory M. O'Hare and Kostas Stathis
and George Vouros},
volume = {4995},
series = {Lecture Notes In Artificial Intelligence},
venue = {Athens, Greece},
bibdate = {04/06/09},
}
@inproceedings{Romero-Campero.etal:2008c,
author = {Francisco J. Romero-Campero and Hongqing Cao and Miguel
Camara and Natalio Krasnogor},
title = {Structure and parameter estimation for cell systems biology
models},
booktitle = {Proceedings of the 10th annual conference on Genetic and
evolutionary computation},
pages = {331-338},
year = {2008},
editor = {Maarten Keijzer},
venue = {Atlanta, USA},
bibdate = {04/06/09},
}
@inproceedings{Romero-Campero.etal:2009,
author = {Francisco J. Romero-Campero and Jamie Twycross and Hongqing
Cao and Jonathan Blakes and Natalio Krasnogor},
title = {A multiscale modeling framework based on {P}~systems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {64-78},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Kirkilionis.etal:2009,
author = {Markus Kirkilionis and Mirela Domijan and Martin Eigel and
Erwin George and Mike Li and Luca Sbano},
title = {A Definition of Cellular Interface Problems},
booktitle = {Membrane Computing: 9th International Workshop},
pages = {36-62},
year = {2009},
editor = {David Wolfe Corne and Pierluigi Frisco and Gheorghe P\u{a}un
and Grzegorz Rozenberg and Arto Salomaa},
volume = {5391},
series = {Lecture Notes in Computer Science},
venue = {Edinburgh, UK},
bibdate = {04/06/09},
}
@inproceedings{Rivero-Gil.etal:2008,
author = {Elena Rivero-Gil and Miguel A. Guti{\'e}rrez-Naranjo and
{\'A}lvaro Romero-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title = {A software tool for generating graphics by means of
{P}~systems},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {87-100},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Neary:2008,
author = {Turlough Neary},
title = {A small universal spiking neural {P}~system},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {65-74},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Aman.etal:2008b,
author = {Bogdan Aman and Gabriel Ciobanu},
title = {Membrane systems with surface objects},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {17-28},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Besozzi.etal:2008b,
author = {Daniela Besozzi and Giancarlo Mauri and Dario Pescini and
Claudio Zandron},
title = {Membrane systems in systems biology},
booktitle = {9th International Workshop on Discrete Event Systems},
pages = {275-280},
year = {2008},
venue = {G{\"o}teborg, Sweden},
bibdate = {04/06/09},
}
@inproceedings{Aman.etal:2008,
author = {Bogdan Aman and Gabriel Ciobanu},
title = {Resource competition and synchronization in membranes},
booktitle = {Proceedings of the 10th International Symposium on Symbolic
and Numeric Algorithms for Scientific Computing},
year = {2008},
editor = {Tudor Jebelean and Viorel Negru and Dana Petcu and Daniela
Zaharie},
venue = {Timi\c{s}oara, Romania},
bibdate = {04/06/09},
}
@inproceedings{Krassovitskiy.etal:2008,
author = {Alexander Krassovitskiy and Yurii Rogozhin and
Sergey Verlan},
title = {One-sided insertion and deletion: traditional and {P}~systems
case},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {51-63},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Twycross.etal:2008,
author = {Jamie Twycross and Francisco J. Romero-Campero and Malcolm
Bennett and Miguel C{\'a}mara and Natalio Krasnogor},
title = {Modular assembly of cell systems biology models using
{P}~systems},
booktitle = {Proceedings of Prague International Workshop on Membrane
Computing},
pages = {51-62},
year = {2008},
editor = {Oscar H. Ibarra and Petr Sos{\'i}k},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Muskulus:2008,
author = {Michael Muskulus},
title = {Identification of {P}~system models assisted by biochemical
databases},
booktitle = {Proceedings of Prague International Workshop on Membrane
Computing},
pages = {47-49},
year = {2008},
editor = {Oscar H. Ibarra and Petr Sos{\'i}k},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Lucanu:2008,
author = {Dorel Lucanu},
title = {Rewriting logic-based semantics of membrane systems and the
maximal concurrency},
booktitle = {Proceedings of Prague International Workshop on Membrane
Computing},
pages = {23-34},
year = {2008},
editor = {Oscar H. Ibarra and Petr Sos{\'i}k},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Fassler.etal:2008,
author = {Raffael Fassler and Thomas Hinze and Thorsten Lenser and
Peter Dittrich},
title = {Construction of oscillating chemical register machines on
binary numbers using mass-action kinetics},
booktitle = {Proceedings of Prague International Workshop on Membrane
Computing},
pages = {11-22},
year = {2008},
editor = {Oscar H. Ibarra and Petr Sos{\'i}k},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Ciobanu.etal:2008c,
author = {Gabriel Ciobanu and Mihai Gontineac},
title = {Multisets and their encodings},
booktitle = {Proceedings of Prague International Workshop on Membrane
Computing},
pages = {1-10},
year = {2008},
editor = {Oscar H. Ibarra and Petr Sos{\'i}k},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Ibarra.etal:2008,
author = {Oscar H. Ibarra and Andrei P\u{a}un and Alfonso
Rodr{\'i}guez-Pat{\'o}n},
title = {Sequentiality induced by spike numbers in {SNP} systems},
booktitle = {Proceedings of the 14th International Meeting on DNA
Computing},
pages = {36-46},
year = {2008},
venue = {Prague, Czech Republic},
bibdate = {04/06/09},
}
@inproceedings{Barbuti.etal:2008d,
author = {Roberto Barbuti and Giulio Caravagna and Andrea
Maggiolo-Schettini and Paolo Milazzo and Giovanni Pardini},
title = {The calculus of looping sequences},
booktitle = {Formal Methods for Computational Systems Biology},
pages = {387-423},
year = {2008},
editor = {Marco Bernardo and Pierpaolo Degano and Gianluigi Zavattaro},
volume = {5016},
series = {Lecture Notes in Computer Science},
venue = {Bertinoro, Italy},
bibdate = {04/06/09},
}
@inproceedings{Freund.etal:2008c,
author = {Rudolf Freund and Sergey Verlan},
title = {{P}~systems working in the $k$-restricted minimally parallel
derivation mode},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {43-52},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Zhang.etal:2008c,
author = {Xingyi Zhang and Yun Jiang and Linqiang Pan},
title = {Small universal spiking neural {P}~systems with exhaustive
use of rules},
booktitle = {Proceedings of the Third International Conference on
Bio-Inspired Computing: Theories and Applications},
pages = {117-127},
year = {2008},
venue = {Adelaide, Australia},
bibdate = {04/06/09},
}
@inproceedings{Calude.etal:2008,
title = {On the Computational Complexity of Spiking Neural
{P}~Systems},
author = {Turlough Neary},
booktitle = {Proceedings of the 7th international conference on
Unconventional Computing},
pages = {189-205},
year = {2008},
editor = {Cristian S. Calude and Jos{\'e} F{\'e}lix Costa and Rudolf
Freund and Marion Oswald and Grzegorz Rozenberg},
volume = {5204},
series = {Lecture Notes in Computer Science},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Delzanno.etal:2008,
author = {Giorgio Delzanno and Laurent Begin},
title = {A Biologically Inspired Model with Fusion and Clonation of
Membranes},
booktitle = {Proceedings of the 7th international conference on
Unconventional Computing},
pages = {64-82},
year = {2008},
editor = {Cristian S. Calude and Jos{\'e} F{\'e}lix Costa and Rudolf
Freund and Marion Oswald and Grzegorz Rozenberg},
volume = {5204},
series = {Lecture Notes in Computer Science},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Krishna:2008,
author = {Shankara Narayanan Krishna},
title = {The Expressiveness of Concentration Controlled {P}~Systems},
booktitle = {Proceedings of the 7th international conference on
Unconventional Computing},
pages = {96-110},
year = {2008},
editor = {Cristian S. Calude and Jos{\'e} F{\'e}lix Costa and Rudolf
Freund and Marion Oswald and Grzegorz Rozenberg},
volume = {5204},
series = {Lecture Notes in Computer Science},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Yang.etal:2008b,
author = {Linmin Yang and Yong Wang and Zhe Dang},
title = {Automata on Multisets of Communicating Objects},
booktitle = {Proceedings of the 7th international conference on
Unconventional Computing},
pages = {242-257},
year = {2008},
editor = {Cristian S. Calude and Jos{\'e} F{\'e}lix Costa and Rudolf
Freund and Marion Oswald and Grzegorz Rozenberg},
volume = {5204},
series = {Lecture Notes in Computer Science},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Stamatopoulou.etal:2005,
author = {Ioanna Stamatopoulou and Petros Kefalas and George
Eleftherakis and Marian Gheorghe},
title = {A modeling language and tool for population {P}~systems},
booktitle = {10th Panhellenic Conference on Informatics},
pages = {142-152},
year = {2005},
editor = {Panayiotis Bozanis and Elias N. Houstis},
venue = {Volos, Greece},
bibdate = {04/06/09},
}
@inproceedings{Ceterchi.etal:2008b,
author = {Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez and
Alexandru Ioan Tomescu},
title = {Sorting omega networks simulated with {P}~systems: Optimal
data layouts},
booktitle = {International Workshop on Computing with Biomolecules},
pages = {29-42},
year = {2008},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Rudolf Freund and Marion
Oswald and Kai Salomaa},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Diaz-Pernil.etal:2008b,
author = {Daniel D{\'i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo
and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title = {Solving the partition problem by using tissue-like
{P}~systems with cell division},
booktitle = {Proceedings of the Third International Conference on
Bio-Inspired Computing: Theories and Applications},
pages = {43-47},
year = {2008},
venue = {Adelaide, Australia},
bibdate = {04/06/09},
}
@inproceedings{Diaz-Pernil.etal:2008,
author = {Daniel D{\'i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo
and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title = {Solving the partition problem by using tissue-like
{P}~systems with cell division},
booktitle = {Sixth Brainstorming Week on Membrane Computing},
pages = {123-134},
year = {2008},
editor = {Daniel D{\'i}az-Pernil and Carmen Graciani and Miguel Angel
Guti{\'e}rrez-Naranjo and Gheorghe P\u{a}un and Ignacio
P{\'e}rez-Hurtado and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
venue = {Sevilla, Spain},
bibdate = {04/06/09},
}
@inproceedings{Binder.etal:2008,
author = {Aneta Binder and Rudolf Freund and Marion Oswald},
title = {Extended Spiking Neural {P}~Systems with Astrocytes --
{V}ariants for modelling the Brain},
booktitle = {13th International Symposium on Artificial Life and Robotics},
pages = {520-524},
year = {2008},
editor = {Masanori Sugisaka and Hiroshi Tanaka},
venue = {Beppu, Japan},
bibdate = {04/06/09},
}
@inproceedings{Alonso.etal:2008,
author = {Santiago Alonso and Luis Fern{\'a}ndez, Fernando Arroyo and
Javier Gil},
title = {Main modules design for a {HW} implementation of massive
parallelism in transition {P}~systems},
booktitle = {13th International Symposium on Artificial Life and Robotics},
pages = {500-504},
year = {2008},
editor = {Masanori Sugisaka and Hiroshi Tanaka},
venue = {Beppu, Japan},
bibdate = {04/06/09},
}
@inproceedings{Gutierrez.etal:2008,
author = {Abraham Gutierrez and Luis Fern{\'a}ndez and Fernando Arroyo
and Santiago Alonso},
title = {Suitability of using microcontrollers in implementing new
{P}~system communication architectures},
booktitle = {13th International Symposium on Artificial Life and Robotics},
pages = {496-499},
year = {2008},
editor = {Masanori Sugisaka and Hiroshi Tanaka},
venue = {Beppu, Japan},
bibdate = {04/06/09},
}
@inproceedings{Gil.etal:2008,
author = {F. Javier Gil and Luis Fern{\'a}ndez and Fernando Arroyo and
Juan Alberto de Frutos},
title = {Parallel algorithm for {P}~systems implementation in
multiprocessors},
booktitle = {13th International Symposium on Artificial Life and Robotics},
pages = {491-495},
year = {2008},
editor = {Masanori Sugisaka and Hiroshi Tanaka},
venue = {Beppu, Japan},
bibdate = {04/06/09},
}
@inproceedings{Bravo.etal:2008,
author = {Gin{\'e}s Bravo and Luis Fern{\'a}ndez and M. A. Pena},
title = {Hierarchical master-slave architecture for membrane systems
implementation},
booktitle = {13th International Symposium on Artificial Life and Robotics},
pages = {485-490},
year = {2008},
editor = {Masanori Sugisaka and Hiroshi Tanaka},
venue = {Beppu, Japan},
bibdate = {04/06/09},
}
@inproceedings{Murphy.etal:2008,
author = {Niall Murphy and Damien Woods},
title = {A Characterisation of {NL} Using Membrane Systems without
Charges and Dissolution},
booktitle = {Proceedings of the 7th international conference on
Unconventional Computing},
pages = {164-176},
year = {2008},
editor = {Cristian S. Calude and Jos{\'e} F{\'e}lix Costa and Rudolf
Freund and Marion Oswald and Grzegorz Rozenberg},
volume = {5204},
series = {Lecture Notes in Computer Science},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@inproceedings{Krishna.etal:2008,
author = {Shankara Narayanan Krishna and Gabriel Ciobanu},
title = {On the Computational Power of Enhanced Mobile Membranes},
booktitle = {Proceedings of the 4th conference on Computability in Europe:
Logic and Theory of Algorithms},
pages = {326-335},
year = {2008},
editor = {Arnold Beckmann and Costas Dimitracopoulos and Benedikt
L{\"o}we},
volume = {5028},
series = {Lecture Notes in Computer Science},
venue = {Athens, Greece},
bibdate = {04/06/09},
}
@inproceedings{Ibarra.etal:2007c,
author = {Oscar H. Ibarra and Sara Woodworth},
title = {Spiking Neural {P}~Systems: Some Characterizations},
booktitle = {Fundamentals of Computation Theory, 16th International
Symposium},
pages = {23-37},
year = {2007},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Zolt{\'a}n {\'E}sik},
volume = {4639},
series = {Lecture Notes in Computer Science},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Freund.etal:2007c,
author = {Rudolf Freund and Mihai Ionescu and Marion Oswald},
title = {Extended Spiking Neural {P}~Systems with Decaying Spikes
and/or Total Spiking},
booktitle = {Proceedings of the International Workshop on Automata for
Cellular and Molecular Computing},
pages = {64-75},
year = {2007},
editor = {Gy{\"o}rgy Vaszil},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Borrego-Ropero.etal:2007,
author = {Rafael Borrego-Ropero and Daniel D{\'i}az-Pernil and Mario
J. P{\'e}rez-Jim{\'e}nez},
title = {Tissue Simulator: A Graphical Tool for Tissue {P}~Systems},
booktitle = {Proceedings of the International Workshop on Automata for
Cellular and Molecular Computing},
pages = {23-34},
year = {2007},
editor = {Gy{\"o}rgy Vaszil},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Bernardini.etal:2007,
author = {Francesco Bernardini and Marian Gheorghe and Maurice
Margenstern and Sergey Verlan},
title = {How to Synchronize the Activity of All Components of a
{P}~System?},
booktitle = {Proceedings of the International Workshop on Automata for
Cellular and Molecular Computing},
pages = {11-22},
year = {2007},
editor = {Gy{\"o}rgy Vaszil},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Kefalas.etal:2007,
author = {Petros Kefalas and Ioanna Stamatopoulou and Marian Gheorghe},
title = {Principles of Transforming Communicating {X}-Machines to
Population {P}~Systems},
booktitle = {Proceedings of the International Workshop on Automata for
Cellular and Molecular Computing},
pages = {76-89},
year = {2007},
editor = {Gy\"orgy Vaszil},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Ionescu.etal:2007b,
author = {Mihai Ionescu and Drago\c{s} Sburlan},
title = {Some applications of spiking neural {P}~systems},
booktitle = {Proceedings of the Eighth Workshop on Membrane Computing},
pages = {383-394},
year = {2007},
editor = {George Eleftherakis and Petros Kefalas and Gheorghe P\u{a}un},
venue = {Thessaloniki, Greece},
bibdate = {04/06/09},
}
@inproceedings{Ionescu.etal:2007,
author = {Mihai Ionescu and Drago\c{s} Sburlan},
title = {{P}~systems with adjoining controlled communication rules},
booktitle = {Fundamentals of Computation Theory, 16th International
Symposium},
pages = {353-364},
year = {2007},
editor = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Zolt{\'a}n {\'E}sik},
volume = {4639},
series = {Lecture Notes in Computer Science},
venue = {Budapest, Hungary},
bibdate = {04/06/09},
}
@inproceedings{Dunn.etal:2007,
author = {Stanley Dunn and Peter Stivers},
title = {{P} System Models of Bistable, Enzyme Driven Chemical
Reaction Networks},
booktitle = {Proceedings of the 2nd international work-conference on The
Interplay Between Natural and Artificial Computation, Part I:
Bio-inspired Modeling of Cognitive Tasks},
pages = {203-213},
year = {2007},
editor = {Jos{\'e} Mira and Jos{\'e} R. {\'A}lvarez},
volume = {4527},
series = {Lecture Notes in Computer Science},
venue = {La Manga del Mar Menor, Spain},
bibdate = {04/06/09},
}
@inproceedings{Mauri.etal:2007,
author = {Giancarlo Mauri and Marion J. P{\'e}rez Jim{\'e}nez and
Claudio Zandron},
title = {On a {P}\u{a}un's Conjecture in Membrane Systems},
booktitle = {Proceedings of the 2nd international work-conference on The
Interplay Between Natural and Artificial Computation, Part I:
Bio-inspired Modeling of Cognitive Tasks},
pages = {180-192},
year = {2007},
editor = {Jos{\'e} Mira and Jos{\'e} R. {\'A}lvarez},
volume = {4527},
series = {Lecture Notes in Computer Science},
venue = {La Manga del Mar Menor, Spain},
bibdate = {04/06/09},
}
@inproceedings{Diaz-Pernil.etal:2007,
author = {Daniel D{\'i}az-Pernil and Miguel A. Guti{\'e}rrez-Naranjo
and Mario J. P{\'e}rez Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title = {Solving Subset Sum in Linear Time by Using Tissue {P}~Systems
with Cell Division},
booktitle = {Proceedings of the 2nd international work-conference on The
Interplay Between Natural and Artificial Computation, Part I:
Bio-inspired Modeling of Cognitive Tasks},
pages = {170-179},
year = {2007},
editor = {Jos{\'e} Mira and Jos{\'e} R. {\'A}lvarez},
volume = {4527},
series = {Lecture Notes in Computer Science},
venue = {La Manga del Mar Menor, Spain},
bibdate = {04/06/09},
}
@inproceedings{Krishna:2007b,
author = {Shankara Narayanan Krishna},
title = {On the Computational Power of Flip-Flop Proteins on
Membranes},
booktitle = {Proceedings of the 3rd conference on Computability in Europe:
Computation and Logic in the Real World},
pages = {695-704},
year = {2007},
editor = {S. Barry Cooper and Benedikt L{\"o}we and Andrea Sorbi},
volume = {4497},
series = {Lecture Notes in Computer Science},
venue = {Siena, Italy},
bibdate = {04/06/09},
}
@inproceedings{Freund.etal:2006,
author = {Rudolf Freund and Theresia Gschwandtner},
title = {{P}~systems for modelling biological processes in living
cells},
booktitle = {16.~Theorietag Automaten und Formale Sprachen},
pages = {46-50},
year = {2006},
editor = {Rudolf Freund and Marion Oswald},
venue = {Vienna, Austria},
bibdate = {04/06/09},
}
@article{Csuhaj-Varju.etal:2008b,
author = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Gheorghe P\u{a}un and Gy{\"o}rgy
Vaszil},
title = {Tissue-like {P}~systems with dynamically emerging requests},
journal = {International Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {3},
pages = {729-745},
bibdate = {04/06/09},
}
@article{Paun:2007,
author = {Gheorghe P\u{a}un},
title = {Tracing some open problems in membrane computing},
journal = {Romanian Journal of Information Science and Technology},
year = {2007},
volume = {10},
number = {4},
pages = {303-314},
bibdate = {04/06/09},
}
@article{Leporati.etal:toAppear,
author = {Alberto Leporati and Daniela Besozzi and Paolo Cazzaniga and
Claudio Ferretti and Dario Pescini},
title = {Computing with energy and chemical reactions},
journal = {Natural Computing},
year = {to appear},
bibdate = {04/06/09},
}
@article{Gheorghe.etal:toAppear,
author = {Marian Gheorghe and Vincenzo Manca and Francisco J.
Romero-Campero},
title = {Deterministic and stochastic {P}~systems for modeling
cellular processes},
journal = {Natural Computing},
bibdate = {04/06/09},
year = {to appear},
}
@article{Kelemen:2008,
author = {Jozef Kelemen},
title = {Some questions inspired by (membrane computing motivated)
language-theoretic models hardware},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {571-580},
bibdate = {04/06/09},
}
@article{Nguyen.etal:2008,
author = {Van Nguyen and David Kearney and Gianpaolo Gioiosa},
title = {An implementation of membrane computing using reconfigurable
hardware},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {551-569},
bibdate = {04/06/09},
}
@article{Umeki.etal:2008,
author = {Mai Umeki and Yasuhiro Suzuki},
title = {A Simple Membrane Computing Method for Simulating
Bio-Chemical Reactions},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {515-528},
bibdate = {04/06/09},
}
@article{Ionescu.etal:2008,
author = {Mihai Ionescu and Drago\c{s} Sburlan},
title = {Some applications of spiking neural {P}~systems},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {515-528},
bibdate = {04/06/09},
}
@article{Cordona.etal:2008,
author = {M{\'o}nica Cordona and M. Angels Colomer and Mario
J. P{\'e}rez Jim{\'e}nez and Alba Zaragoza},
title = {Hierarchical Clustering with Membrane Computing},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {497-513},
bibdate = {04/06/09},
}
@article{Cienciala.etal:2008,
author = {Lud\v{e}k Cienciala and Lucie Ciencialov{\'a} and
Alice Kelemenov{\'a}},
title = {Homogeneous P Colonies},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {481-496},
bibdate = {04/06/09},
}
@article{Molteni.etal:2008,
author = {Davide Molteni and Claudio Ferretti and Giancarlo
Mauri},
title = {Frequency Membrane Systems},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {467-479},
bibdate = {04/06/09},
}
@article{Ramesh.etal:2008,
author = {H. Ramesh and Raghavan Rama},
title = {Rewriting {P}~Systems with Conditional Communication:
Improved Hierarchies},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {453-465},
bibdate = {04/06/09},
}
@article{Bonchis.etal:2008,
author = {Cosmin Bonchi\c{s} and Cornel Izba\c{s}a and Gabriel
Ciobanu},
title = {Information Theory over Multisets},
journal = {Computing and Informatics},
year = {2008},
volume = {27},
number = {3+},
pages = {441-451},
bibdate = {04/06/09},
}
@article{Manca:2008,
author = {Vincenzo Manca},
title = {The metabolic algorithm for {P}~systems: Principles and
applications},
journal = {Theoretical Computer Science},
year = {2008},
volume = {404},
number = {1-2},
pages = {142-155},
bibdate = {04/06/09},
}
@article{Csuhaj-Varju.etal:2008,
author = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy\"orgy Vaszil},
title = {(Mem)brane automata},
journal = {Theoretical Computer Science},
year = {2008},
volume = {404},
number = {1-2},
pages = {52-60},
bibdate = {04/06/09},
}
@article{Jack.etal:2008,
author = {John Jack and Alfonso Rodr{\'i}guez-Pat{\'o}n and Oscar H. Ibarra
and Andrei P\u{a}un},
title = {Discrete nondeterministic modeling of the {F}as pathway},
journal = {International Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {5},
pages = {1147-1162},
bibdate = {04/06/09},
}
@article{Kari.etal:2008,
author = {Lila Kari and Grzegorz Rozenberg},
title = {The many facets of natural computing},
journal = {Communications of the ACM},
year = {2008},
volume = {51},
number = {10},
pages = {72-83},
bibdate = {04/06/09},
}
@article{Barbuti.etal:2008c,
author = {Roberto Barbuti and Andrea Maggiolo-Schettini and Paolo
Milazzo and Angelo Troina},
title = {Bisimulations in calculi modelling membranes},
journal = {Formal Aspects of Computing},
year = {2008},
volume = {20},
number = {4-5},
pages = {351-377},
bibdate = {04/06/09},
}
@article{Kleijn.etal:toAppear,
author = {Jetty Kleijn and Maciej Koutny},
title = {A {P}etri net model for membrane systems with dynamic
structure},
journal = {Natural Computing},
bibdate = {04/06/09},
year = {to appear},
}
@article{Kleijn.etal:2008,
author = {Jetty Kleijn and Maciej Koutny},
title = {Processes of membrane systems with promoters and inhibitors},
journal = {Theoretical Computer Science},
year = {2008},
volume = {404},
number = {1-2},
pages = {112-126},
bibdate = {04/06/09},
}
@article{Dovier.etal:2008,
author = {Agostino Dovier and Carla Piazza and Gianfranco Rossi},
title = {A uniform approach to constraint-solving for lists
multisets, compact lists, and sets},
journal = {ACM Transactions on Computational Logic},
year = {2008},
volume = {9},
number = {3},
pages = {15:1-15:30},
bibdate = {04/06/09},
}
@article{Castellini.etal:toAppear,
author = {Alberto Castellini and Giuditta Franco and Vincenzo Manca},
title = {Hybrid Functional {P}etri Nets as {MP} systems},
journal = {Natural Computing},
year = {to appear},
bibdate = {04/06/09},
}
@article{Huang.etal:2008,
author = {Chunyi Huang and Xiaoju Dong},
title = {Maximally parallel attribute on {P}~Systems: Properties and
applications},
journal = {Progress in Natural Science},
year = {2008},
volume = {18},
number = {5},
pages = {629-632},
bibdate = {04/06/09},
}
@article{Brijder.etal:2008,
author = {Robert Brijder and Matteo Cavaliere and Agust{\'i}n
Riscos-N{\'u}{\~n}ez and Grzegorz Rozenberg and Drago\c{s},
Sburlan},
title = {Membrane systems with proteins embedded in membranes},
journal = {Theoretical Computer Science},
year = 2008,
volume = 404,
number = {1-2},
pages = {26-39},
bibdate = {04/06/09},
}
@article{Martinez.etal:2007,
author = {Victor Martinez and Luis Fernandez and Fernando Arroyo and
Abraham Gutierrez},
title = {{HW} implementation of a optimized algorithm for the
application of active rules in a transition {P}-system},
journal = {International Journal on Information Theory and Applications},
year = {2007},
volume = {14},
number = {4},
pages = {324-331},
bibdate = {04/06/09},
}
@article{Cavaliere.etal:2008b,
author = {Matteo Cavaliere and Radu Mardare and Sean Sedwards},
title = {A multiset-based model of synchronizing agents: Computability
and robustness},
journal = {Theoretical Computer Science},
year = {2008},
volume = {391},
number = {3},
pages = {216-238},
bibdate = {04/06/09},
}
@article{Ishdorj.etal:2008,
author = {Tseren-Onolt Ishdorj and Alberto Leporati},
title = {Uniform solutions to {SAT} and {3-SAT} by spiking neural {P},
systems with pre-computed resources},
journal = {Natural Computing},
year = {2008},
volume = {7},
number = {4},
pages = {519-534},
bibdate = {04/06/09},
}
@article{Romero-Campero.etal:2008b,
author = {Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez},
title = {A model of the quorum sensing system in {V}ibrio fischeri
using {P}~systems},
journal = {Artificial Life},
year = {2008},
volume = {14},
number = {1},
pages = {95-109},
bibdate = {04/06/09},
}
@article{Cavaliere.etal:2008,
author = {Matteo Cavaliere and Ivan Mura},
title = {Experiments on the reliability of stochastic spiking neural
{P}~systems},
journal = {Natural Computing},
year = {2008},
volume = {7},
number = {4},
pages = {453-470},
bibdate = {04/06/09},
}
@article{Huang.etal:2009,
author = {Liang Huang and Il Hong Suh},
title = {Controller design for a marine diesel engine using membrane
computing},
journal = {International Journal of Innovative Computing, Information
and Control},
year = {2009},
volume = {5},
number = {4},
pages = {899-912},
bibdate = {04/06/09},
}
@article{Huang.etal:2007,
author = {Liang Huang and Lei Sun and Ning Wang and Xiaoming Jin},
title = {Multiobjective optimization of simulated moving bed by tissue
{P}~system},
journal = {Chinese Journal of Chemical Engineering},
year = {2007},
volume = {15},
number = {5},
pages = {683-690},
bibdate = {04/06/09},
}
@article{Freund.etal:2008b,
author = {Rudolf Freund and Marion Oswald},
title = {Regular omega-languages defined by finite extended spiking
neural {P}~systems},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {83},
number = {1-2},
pages = {65-73},
bibdate = {04/06/09},
}
@article{Alhazov:Ciliate:ROMJIST2008,
author = {Artiom Alhazov},
title = {Ciliate Operations without Context in a Membrane Computing
Framework},
journal = {Romanian Journal of Information Science and Technology},
year = {2008},
volume = {10},
number = {4},
pages = {315--322},
bibdate = {04/06/09},
abstract = {We study the computational power of string processing systems with excision and insertion rules with communication. The strings are distributed in different regions, and the rules are defined by cutting out a substring flanked by specific repeated symbols and a reverse operation; the rule only specifies the repeated symbol and the regions of reactants and products. It turns out that they can generate all recursively enumerable sets of non-negative integers.},
url = {http://www.imt.ro/romjist/Volum10/Number10_4/02-Alhazov.htm},
}
@article{Nishida:2007,
author = {Taishin Y. Nishida},
title = {Membrane algorithm with brownian subalgorithm and genetic
subalgorithm},
journal = {International Journal of Foundations of Computer Science},
year = {2007},
volume = {18},
number = {6},
pages = {1353-1360},
bibdate = {04/06/09},
}
@article{Ibarra.etal:2007b,
author = {Oscar H. Ibarra and Sara Woodworth},
title = {Characterizing regular languages by spiking neural {P}~systems},
journal = {International Journal of Foundations of Computer Science},
year = {2007},
volume = {18},
number = {6},
pages = {1247-1256},
bibdate = {04/06/09},
}
@article{Gao.etal:2007,
author = {Yan Gao and Hendrik Jan Hoogeboom},
title = {{P}~systems with single passenger carriers},
journal = {International Journal of Foundations of Computer Science},
year = {2007},
volume = {18},
number = {6},
pages = {1227-1235},
bibdate = {04/06/09},
}
@article{Freund.etal:2008,
author = {Rudolf Freund and Mihai Ionescu and Marion Oswald},
title = {Extended spiking neural {P}~systems with decaying spikes and/or
total spiking},
journal = {International Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {5},
pages = {1223-1234},
bibdate = {04/06/09},
}
@article{Bernardini.etal:2008,
author = {Francesco Bernardini and Marian Gheorghe and Maurice
Margenstern and Sergey Verlan},
title = {How to synchronize the activity of all components of
a {P}~system?},
journal = {International Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {5},
pages = {1183-1198},
bibdate = {04/06/09},
}
@article{Annadurai.etal:2008b,
author = {Subbaiah Annadurai and Thiyagarajan Kalyani and Vincent
Rajkumar Dare and Durairaj Gnanaraj Thomas},
title = {Trajectory {P}~systems},
journal = {Progress in Natural Science},
year = {2008},
volume = {18},
number = {5},
pages = {611-616},
bibdate = {04/06/09},
}
@article{Annadurai.etal:2008,
author = {Subbaiah Annadurai and Thiyagarajan Kalyani and Vincent
Rajkumar Dare and Durairaj Gnanaraj Thomas},
title = {{P}~systems generating iso-picture languages},
journal = {Progress in Natural Science},
year = {2008},
volume = {18},
number = {5},
pages = {617-622},
bibdate = {04/06/09},
}
@article{Xian:2007,
author = {Xu Xian},
title = {Tissue {P}~systems with parallel rules on channels},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {486-491},
bibdate = {04/06/09},
}
@article{Subramanian.etal:2007,
author = {K. G. Subramanian and R. Saravanan and M. Geethalakshmr and
P. Helen Chandra and M. Margenstern},
title = {{P}~systems with array objects and array rewriting rules},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {479-485},
bibdate = {04/06/09},
}
@article{Leporati.etal:2007b,
author = {Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title = {Solving the factorization problem with {P}~systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {471-478},
bibdate = {04/06/09},
}
@article{Korczynski:2007,
author = {Waldemar Korczynski},
title = {Paun's systems as models of economic systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {466-470},
bibdate = {04/06/09},
}
@article{Liang.etal:2007,
author = {Huang Liang and He Xiongxiong and Wang Ning and Xie Yi},
title = {{P}~systems based multi-objective optimization algorithm},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {458-465},
bibdate = {04/06/09},
}
@article{Gutierrez-Naranjo.etal:2007b,
author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario
J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco J. Romero-Campero},
title = {How to express tumours using membrane systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {449-457},
bibdate = {04/06/09},
}
@article{Freund.etal:2007b,
author = {Rudolf Freund and Marion Oswald and Thomas Schirk},
title = {How a membrane agent buys goods in a membrane store},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {442-448},
bibdate = {04/06/09},
}
@article{Ciobanu.etal:2007,
author = {Gabriel Ciobanu and Laura Cornacel},
title = {Probabilistic transitions for {P}~systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {431-441},
bibdate = {04/06/09},
}
@article{Cheruku.etal:2007,
author = {Smitha Cheruku and Andrei P\u{a}un and Francisco
J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez and
Oscar H. Ibarra},
title = {Simulating {FAS}-induced apoptosis by using
{P}~systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {424-431},
bibdate = {04/06/09},
}
@article{Haiming.etal:2007,
author = {Chen Haiming and Tseren-Onolt Ishdorj and Gheorghe P\u{a}un},
title = {Computing along the axon},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {417-423},
bibdate = {04/06/09},
}
@article{Bonchis.etal:2007,
author = {Cosmin Bonchis and Cornel Izbasa and Gabriel Ciobanu},
title = {Compositional asynchronous membrane systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {411-416},
bibdate = {04/06/09},
}
@article{Binder.etal:2007,
author = {Aneta Binder and Rudolf Freund and Georg Lojka and Marion
Oswald},
title = {Applications of membrane systems in distributed systems},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {401-409},
bibdate = {04/06/09},
}
@article{Besozzi.etal:2007,
author = {Daniela Besozzi and Paolo Cazzaniga and Dario Pescini and
Giancarlo Mauri},
title = {Seasonal variance in {P}~system models for metapopulations},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {392-400},
bibdate = {04/06/09},
}
@article{Manca:2007,
author = {Vincenzo Manca},
title = {Metabolic {P}~systems for biochemical dynamics},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {384-391},
bibdate = {04/06/09},
}
@article{Romero-Campero.etal:2007,
author = {Francisco J. Romero-Campero and Marian Gheorghe and Gabriel
Ciobanu and John M. Auld and Mario J. P{\'e}rez-Jim{\'e}nez},
title = {Cellular modelling using {P}~systems and process algebra},
journal = {Progress in Natural Science},
year = {2007},
volume = {17},
number = {4},
pages = {375-383},
bibdate = {04/06/09},
}
@article{Yang.etal:2008,
author = {Linmin Yang and Zhe Dang and Oscar H. Ibarra},
title = {On stateless automata and {P}~systems},
journal = {Intenational Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {5},
pages = {1259-1276},
bibdate = {04/06/09},
}
@article{Mardare.etal:2008,
author = {Radu Mardare and Matteo Cavaliere and Sean Sedwards},
title = {A logical characterization of robustness, mutants and species
in colonies of agents},
journal = {Intenational Journal of Foundations of Computer Science},
year = {2008},
volume = {19},
number = {5},
pages = {1199-1221},
bibdate = {04/06/09},
}
@article{Vitale.etal:2008,
author = {Antonio Vitale and Giancarlo Mauri and Claudio Zandron},
title = {Simulation of a bounded symport/antiport {P}~system with
{B}rane calculi},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {558-571},
bibdate = {04/06/09},
}
@article{Fontana.etal:2008,
author = {Federico Fontana and Vincenzo Manca},
title = {Predator-prey dynamics in {P}~systems ruled by metabolic
algorithm},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {545-557},
bibdate = {04/06/09},
}
@article{Corne.etal:2008,
author = {David W. Corne and Pierluigi Frisco},
title = {Dynamics of {HIV} infection studied with cellular automata
and conformon-{P} systems},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {531-544},
bibdate = {04/06/09},
}
@article{Ciobanu.etal:2008b,
author = {Gabriel Ciobanu and Bogdan Aman},
title = {On the relationship between membranes and ambients},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {515-530},
bibdate = {04/06/09},
}
@article{Besozzi.etal:2008,
author = {Daniela Besozzi and Paolo Cazzaniga and Dario Pescini and
Giancarlo Mauri},
title = {Modelling metapopulations with stochastic membrane systems},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {499-514},
bibdate = {04/06/09},
}
@article{Manca.etal:2008,
author = {Vincenzo Manca and Luca Bianco},
title = {Biological networks in metabolic {P}~systems},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {489-498},
bibdate = {04/06/09},
}
@article{Franco.etal:2008,
author = {Giuditta Franco and Nata\v{s}a Jonoska and Barbara Osborn and
Anna Plaas},
title = {Knee joint injury and repair modeled by membrane systems},
journal = {Biosystems},
year = 2008,
volume = 91,
number = 3,
pages = {473-488},
bibdate = {04/06/09},
}
@article{Spicher.etal:2008,
author = {Antoine Spicher and Olivier Michel and Mikolaj Cieslak and
Jean-Louis Giavitto and Przemyslaw Prusinkiewicz},
title = {Stochastic {P}~systems and the simulation of biochemical
processes with dynamic compartments},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {458-472},
bibdate = {04/06/09},
}
@article{Romero-Campero.etal:2008,
author = {Francisco J. Romero-Campero and Mario J. P{\'e}rez-Jim{\'e}nez},
title = {Modelling gene expression control using {P}~systems: The
{L}ac {O}peron, a case study},
journal = {Biosystems},
year = {2008},
volume = {91},
number = {3},
pages = {438-457},
bibdate = {04/06/09},
}
@article{Gheorghe.etal:2008,
author = {Marian Gheorghe and Natalio Krasnogor and Miguel Camara},
title = {{P}~systems applications to systems biology},
journal = {Biosystems},
year = 2008,
volume = 91,
number = 3,
pages = {435-437},
bibdate = {04/06/09},
}
@article{Zhang.etal:2008b,
author = {Xingyi Zhang and Xiangxiang Zeng and Linqiang Pan},
title = {Smaller Universal Spiking Neural {P}~Systems},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {117-136},
bibdate = {04/06/09},
}
@article{Zhang.etal:2008,
author = {Ge-Xiang Zhang and Marian Gheorghe and Chao-Zhong Wu},
title = {A Quantum-Inspired Evolutionary Algorithm Based on {P}~systems
for Knapsack Problem},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {93-116},
bibdate = {04/06/09},
}
@article{Zandron.etal:2008,
author = {Claudio Zandron and Alberto Leporati and Claudio Ferretti and
Giancarlo Mauri and Mario J. P{\'e}rez-Jim{\'e}nez },
title = {On the Computational Efficiency of Polarizationless
Recognizer {P}~Systems with Strong Division and Dissolution},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {79-91},
bibdate = {04/06/09},
}
@article{Leporati.etal:2008,
author = {Alberto Leporati and Miguel A. Guti{\'e}rrez-Naranjo},
title = {Solving Subset Sum by Spiking Neural {P}~Systems with
Pre-computed Resources},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {61-77},
bibdate = {04/06/09},
}
@article{Ciobanu.etal:2008,
author = {Gabriel Ciobanu and Andreas Resios},
title = {Computational Complexity of Simple {P}~Systems},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {49-59},
bibdate = {04/06/09},
}
@article{Ceterchi.etal:2008,
author = {Rodica Ceterchi and Alexandru Ioan Tomescu},
title = {Implementing Sorting Networks with Spiking Neural {P}~Systems},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {35-48},
bibdate = {04/06/09},
}
@article{Barbuti.etal:2008b,
author = {Roberto Barbuti and Andrea Maggiolo-Schettini and Paolo
Milazzo and Simone Tini},
title = {A {P} Systems Flat Form Preserving Step-by-step Behaviour},
journal = {Fundamenta Informaticae},
year = {2008},
volume = {87},
number = {1},
pages = {1-34},
bibdate = {04/06/09},
}
@article{Muskulus.etal:2007,
author = {Michael Muskulus and Daniela Besozzi and Robert Brijder and
Paolo Cazzaniga and Sanne Houweling and Dario Pescini and
Grzegorz Rozenberg},
title = {Cycles and communicating classes in membrane systems and
molecular dynamics},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
bibdate = {04/06/09},
}
@article{Leporati.etal:2007,
author = {Alberto Leporati and Sara Felloni},
title = {Three ``quantum'' algorithms to solve {3-SAT}},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {218-241},
bibdate = {04/06/09},
}
@article{Ibarra.etal:2007,
author = {Oscar H. Ibarra and Andrei P\u{a}un and Gheorghe P\u{a}un and
Alfonso Rodr{\'i}guez-Pat{\'o}n and Petr Sos{\'i}k and Sara
Woodworth},
title = {Normal forms for spiking neural {P}~systems},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {196-217},
bibdate = {04/06/09},
}
@article{Gutierrez-Naranjo.etal:2007,
author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title = {On the degree of parallelism in membrane systems},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {183-195},
bibdate = {04/06/09},
}
@article{Fontana.etal:2007,
author = {Federico Fontana and Vincenzo Manca},
title = {Discrete solutions to differential equations by metabolic P
systems},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {165-182},
bibdate = {04/06/09},
}
@article{Csuhaj-Varju.etal:2007,
author = {Erzs{\'e}bet Csuhaj-Varj{\'u} and Maurice Margenstern and
Gy\"orgy Vaszil and Sergey Verlan},
title = {On small universal antiport {P}~systems},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {152-164},
bibdate = {04/06/09},
}
@article{Cavaliere.etal:2007,
author = {Matteo Cavaliere and Rudolf Freund and Marion Oswald and
Drago\c{s} Sburlan},
title = {Multiset random context grammars, checkers, and transducers},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {136-151},
bibdate = {04/06/09},
}
@article{Busi:2007,
author = {Nadia Busi},
title = {Using well-structured transition systems to decide divergence
for catalytic {P}~systems},
journal = {Theoretical Computer Science},
year = {2007},
volume = {372},
number = {2-3},
pages = {125-135},
bibdate = {04/06/09},
}
@article{Barbuti.etal:2008,
author = {Roberto Barbuti and Andrea Maggiolo-Schettini and Paolo
Milazzo and Simone Tini},
title = {Compositional semantics and behavioral equivalences for {P}~Systems},
journal = {Theoretical Computer Science},
year = {2008},
volume = {395},
number = {1},
pages = {77-100},
bibdate = {04/06/09},
}
@article{Krishna:2007,
author = {Shankara N. Krishna},
title = {Universality results for {P}~systems based on brane calculi
operations},
journal = {Theoretical Computer Science},
year = {2007},
volume = {371},
number = {1-2},
pages = {83-105},
bibdate = {04/06/09},
}
@article{Gutierrez-Naranjo.etal:2006,
author = {Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Francisco J.
Romero-Campero},
title = {Computational efficiency of dissolution rules in membrane
systems},
journal = {International Journal of Computer Mathematics},
year = {2006},
volume = {83},
number = {7},
pages = {593-611},
bibdate = {04/06/09},
}
@article{Bianco.etal:2006,
author = {Luca Bianco and Vincenzo Manca},
title = {Symbolic generation and representation of complex
oscillations},
journal = {International Journal of Computer Mathematics},
year = {2006},
volume = {83},
number = {7},
pages = {549-568},
bibdate = {04/06/09},
}
@article{Nagy.etal:2006,
author = {Benedek Nagy and Laszlo Szegedi},
title = {Membrane computing and geographical operating systems},
journal = {Journal of Universal Computer Science},
year = {2006},
volume = {12},
number = {9},
pages = {1312-1331},
bibdate = {04/06/09},
}
@article{Alhazov.Rogozhin:SALang:CSJM2006,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Generating Languages by {P}~Systems with Minimal
Symport/Antiport},
journal = {The Computer Science Journal of Moldova},
year = {2006},
volume = {14},
number = {3},
pages = {299--323},
bibdate = {04/06/09},
abstract = {It is known that P systems with two membranes and minimal symport/antiport rules are ``almost'' computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursively enumerable languages.},
url = {http://www.math.md/publications/csjm/issues/v14-n3/8609/},
}
@article{Freund.etal:2007,
author = {Rudolf Freund and Marion Oswald},
title = {Partial halting in {P}~systems},
journal = {International Journal of Foundations of Computer Science},
year = {2007},
volume = {18},
number = {6},
pages = {1215-1225},
bibdate = {04/06/09},
}
@article{Sosik.etal:2007,
author = {Petr Sos{\'i}k and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title = {Membrane computing and complexity theory: A characterization
of {PSPACE}},
journal = {Journal of Computer and System Sciences},
year = {2007},
volume = {73},
number = {1},
pages = {137-152},
bibdate = {04/06/09},
}
@article{Verlan.etal:2008b,
author = {Sergey Verlan and Francesco Bernardini and Marian Gheorghe
and Maurice Margenstern},
title = {Generalized communicating {P}~systems},
journal = {Theoretical Computer Science},
year = {2008},
volume = {404},
number = {1-2},
pages = {170-184},
bibdate = {04/06/09},
}
@article{Subramanian.etal:2009,
author = {K. G. Subramanian and Rosihan M. Ali and Atulya K. Nagar and
Maurice Margenstern},
title = {Array {P} Systems and t-Communication},
journal = {Fundamenta Informaticae},
year = {2009},
volume = {91},
number = {1},
pages = {145-159},
bibdate = {04/06/09},
}
@article{Zhang:2009,
author = {Zhang, Yao; Huang, Liang},
title = {A variant of P systems for optimization},
journal = {NEUROCOMPUTING},
volume = {72},
number = {4-6},
year = {2009},
pages = {1355-1360},
bibdate = {03/11/09},
}
@techreport{Cavaliere:Modelling_Cellular_Processes:TR7/2006,
author = {Matteo Cavaliere and S. Sedwards},
title = {Modelling Cellular Processes using Membrane Systems with Peripheral and
Integral Proteins},
institution = {Microsoft Research - University of Trento, Centre for Computational and
Systems Biology},
address = {Trento, Italy},
number = {07/2006},
note = {Technical Report 7/2006, Microsoft Research - University of Trento, Centre
for Computational and Systems Biology},
}
@techreport{Paun:CDMTCS_TR_101:Multiset_Proces:U,
author={Gheorghe P{\u a}un and Gabriel Thierrin},
title={Multiset Processing by Means of Systems of Finite State Transducers},
institution={University of Auckland},
number={101},
note={CDMTCS Report (www.cs.auckland.ac.nz/CDMTCS)}
}
@techreport{Paun:TUCS_208_98:Computing_with:98,
author={Gheorghe P{\u a}un},
title={Computing with Membranes},
institution={Turku Center for Computer Science-TUCS},
year={1998},
number={208},
note={(www.tucs.fi)}
}
@techreport{Paun:TUCS_218_98:Membrane_Comput:98,
author={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
title={Membrane Computing with External Output},
institution={Turku Center for Computer Science-TUCS},
year={1998},
number={218},
note={Report No 218 (www.tucs.fi)}
}
@techreport{Paun:UWO_TR_539_00:On_Synchronizat:99,
author={Gheorghe P{\u a}un and Sheng Yu},
title={On Synchronization in {P} systems},
institution={University of Western Ontario},
year={1999},
address={Ontario, Canada},
number={539},
note={Report TR 539 (www.csd.uwo.ca/faculty/syu/TR539.html)}
}
@techreport{Calude:CDMTCS_117:Glimpse:2000,
author={Cristian S. Calude and Gheorghe P{\u a}un and Monica Tatar{\^a}m},
title={A Glimpse into Natural Computing},
institution={CDMTCS University of Auckland},
year={2000},
number={117}
}
@techreport{Atanas:RiVU_TR_14_00:P_Systems_and_C:00,
author={Adrian Atanasiu and Carlos Mart{\'i}n-Vide},
title={{P} systems and Context-Free Languages},
institution={Rovira i Virgili University},
year={2000},
address={Tarragona, Spain},
number={14/00},
note={Technical Report 14/00 of Research Group on Mathematical Linguistics},
pages={37--51}
}
@techreport{Paun:CDMTCS_TR_119_00:Computing_with:00,
author={Gheorghe P{\u a}un},
title={Computing with Membranes ({P} systems): Twenty Six Research Topics},
institution={University of Auckland},
year={2000},
number={119},
note={CDMTCS TR 119 (www.cs.auckland.ac.nz/ CDMTCS)}
}
@techreport{Castel:CDMTCS_TR_123_00:P_Systems_with:00,
author={Juan Castellanos and Gheorghe P{\u a}un and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title={{P} systems with Worm-Objects},
institution={University of Auckland},
year={2000},
number={123},
note={www.cs.auckland.ac.nz/CDMTCS}
}
@techreport{Kudlek:CDMTCS_TR_140_00:Toward_FMT_(For:00,
author={Manfred Kudlek and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Toward {FMT} ({F}ormal {M}acroset {T}heory)},
institution={University of Auckland},
year={2000},
number={140},
pages={149--158}
}
@techreport{Malita:CDMTCS_TR_140_00:Membrane_Comput:00,
author={Mihaela Malita},
title={Membrane Computing in {P}rolog},
institution={University of Auckland},
year={2000},
number={140},
pages={159--175}
}
@techreport{Frisco:CDMTCS_TR_140_00:Membrane_Comput:00,
author={Pierluigi Frisco},
title={Membrane Computing Based on Splicing: Improvements},
institution={University of Auckland},
year={2000},
number={140},
pages={100--111}
}
@techreport{Rama:CDMTCS_TR_140_00:Computing_with:00,
author={Raghavan Rama},
title={Computing with {P} systems},
institution={University of Auckland},
year={2000},
number={140},
pages={218--235}
}
@techreport{NKri:CDMTCS_TR_140_00:Computing_with:00,
author={Shankara Narayanan Krishna},
title={Computing with Simple {P} systems},
institution={University of Auckland},
year={2000},
number={140},
pages={124--137}
}
@techreport{Manca:CDMTCS_TR_140_00:Monoidal_System:00,
author={Vincenzo Manca},
title={Monoidal Systems and Membrane Systems},
institution={University of Auckland},
year={2000},
number={140},
note={CDMTCS TR 140},
pages={176--190}
}
@techreport{Suzuki:CDMTCS_TR_140_00:Artificial_Life:00,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Artificial Life and {P} systems},
institution={University of Auckland},
year={2000},
number={140},
pages={265--285}
}
@techreport{Atanas:RiVU_TR_17_01:Recursive_Calcu:01,
author={Adrian Atanasiu and Carlos Mart{\'i}n-Vide},
title={Recursive Calculus with Membranes},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={31--44}
}
@techreport{Paun:RiVU_TR_17_01:P_Systems_with:01,
author={Andrei P{\u a}un},
title={{P} systems with String-Objects: Universality Results},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={229--242}
}
@techreport{Martin:RiVU_TR_21_01:Elements_of_For:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Elements of Formal Language Theory for Membrane Computing},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={21/01},
note={Technical Report 21/01 of Research Group on Mathematical Linguistics}
}
@techreport{Ferret:RiVU_TR_17_01:On_Three_Varian:01,
author={Claudio Ferretti and Giancarlo Mauri and Gheorghe P{\u a}un and Claudio
Zandron},
title={On Three Variants of {P} systems with String-Objects},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={63--76}
}
@techreport{Nico:RiVU_TR_17_01:A_C_Library_f:01,
author={Dan V. {Nicolau Jr.} and Gerardin Solana and Florin Fulga and Dan V. {Nicolau
Sr.}},
title={A "{C}" Library for Implementing {P} systems on the Electronic Computer
(Abstract)},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={221--222}
}
@techreport{Arroyo:RiVU_TR_17_01:A_Recursive_Alg:01,
author={Fernando Arroyo and Angel V. Baranda and Juan Castellanos and Carmen Luengo
and Luis F. Mingo},
title={A Recursive Algorithm for Describing Evolution in Transition {P} systems},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={19--30}
}
@techreport{Cioban:RiVU_TR_17_01:Gene_Expression:01,
author={Gabriel Ciobanu and Bogdan Tanasa},
title={Gene Expression by Software Mechanisms.},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={51--62}
}
@techreport{Cioban:RiVU_TR_17_01:Membrane_Softwa:01,
author={Gabriel Ciobanu and Dorin Paraschiv},
title={Membrane Software. A {P} system Simulator},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={45--50}
}
@techreport{Paun:RiVU_TR_17_01:Further_Researc:01,
author={Gheorghe P{\u a}un},
title={Further Research Topics About {P} systems},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={243--250}
}
@techreport{LGia:RiVU_TR_17_01:MGS:_Implementi:01,
author={Jean Louis Giavitto and Olivier Michel},
title={{MGS}: Implementing a Unified View on Four Biologically Inspired Computing
Models},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={107--122}
}
@techreport{Aguado:RiVU_TR_17_01:P_Systems_with:01,
author = {Joaqu{\'i}n Aguado and Tudor Balanescu and Tony Cowling and Marian Gheorghe
and Florentin Ipate},
title = {{P} systems with Replicated Rewriting and Stream {X-Machines}},
institution = {Rovira i Virgili University},
year = {2001},
address = {Tarragona, Spain},
number = {17/01},
note = {Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages = {7--18},
}
@techreport{Mate:RiVU_TR_17_01:On_the_Power_of:01,
author={Jos{\'e} L. Mat{\'e} and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s Silva},
title={On the Power of {P} systems with {DNA-Worms}},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={209--220}
}
@techreport{Subramanian:RiVU_TR_17_01:self_crosover:01,
author={K.G. Subramanian and D.G. Thomas and M.H. Begum and P.H. Chandra},
title={A note on self crossover and splicing {P} systems},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={259--266}
}
@techreport{Frisco:RiVU_TR_17_01:A_Direct_Constr:01,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom and Paul Sant},
title={A Direct Construction of a Universal {P} system},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={89--106}
}
@techreport{Freund:RiVU_TR_17_01:Variants_of_GP:01,
author={Rudolf Freund and Marion Oswald},
title={Variants of {GP Systems}},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={77--88.}
}
@techreport{Kris:RiVU_TR_17_01:On_the_Power_of:01,
author={Shankara Narayanan Krishna and K. Lakshmanan and Raghavan Rama},
title={On the Power of {P} systems with Contextual Rules},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={143--156}
}
@techreport{Marcus:RiVU_TR_17_01:Membranes_versu:01,
author={Solomon Marcus},
title={Membranes versus {DNA}},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={193--198}
}
@techreport{Ji:RiVU_TR_17_01:The_Bhopalator:01,
author={Sungchul Ji},
title={The {Bhopalator}: An Information/Energy Dual Model of the Living Cell},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={123--142}
}
@techreport{Nish:RiVU_TR_17_01:Simulations_of:01,
author={Taishin Yasunobu Nishida},
title={Simulations of Photosynthesis by a {K-Subset} Transforming System with Membranes},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={223--228}
}
@techreport{Manca:RiVU_TR_17_01:Membrane_Algori:01,
author={Vincenzo Manca},
title={Membrane Algorithms for Propositional Satisfiability},
institution={Rovira i Virgili University},
year={2001},
address={Tarragona, Spain},
number={17/01},
note={Technical Report 17/01 of Research Group on Mathematical Linguistics},
pages={181--192}
}
@techreport{Martin:TUCS_421_01:Tissue_P_System:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and J. Pazos and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title={Tissue {P} systems},
institution={Turku Center for Computer Science-TUCS},
year={2001},
month={September},
number={421},
note={TUCS Technical Report 421}
}
@techreport{Obtulo:RiVU_TR_26_03:Mathematical_Mo:03,
author={Adam Obtulowicz},
title={Mathematical Models of Uncertainty with a Regard to Membrane Systems},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Cordon:RiVU_TR_26_03:A_Prolog_Simula:03,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Fernando Sancho-Caparrini},
title={A {Prolog} Simulator for Deterministic {P} systems with Active Membranes.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{PerezJ:RiVU_TR_26_03:Computing_a_Par:03,
author={Antonio P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Computing a Partial Mapping by a {P} system: Design and Verification},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{PerezJ:RiVU_TR_26_03:Formal_Verifica:03,
author={Antonio P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Formal Verification of a Transition {P} system Generating the Set $2^n+n^2+n
| n > 1$},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Besozz:RiVU_TR_26_03:Hierarchies_of:03,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Hierarchies of Parallel Rewriting {P} systems.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Csuhaj:RiVU_TR_26_03:From_Watson-Cri:03,
author={Erzsebet Csuhaj-Varj{\'u} and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and
Arto Salomaa},
title={From {W}atson-{C}rick {L Systems} to {D}arwinian {P} systems.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Csuhaj:RiVU_TR_26_03:New_Results_and:03,
author={Erzsebet Csuhaj-Varj{\'u} and Gyorgy Vaszil},
title={New Results and Research Directions Concerning {P Automata}, Accepting {P}
systems with Communication Only.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Bernar:RiVU_TR_26_03:Language_Genera:03,
author={Francesco Bernardini and Marian Gheorghe},
title={Language Generating by Means of {P} systems with Active Membranes},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Cioban:RiVU_TR_26_03:Sevilla_Carpets:03,
author={Gabriel Ciobanu and Gheorghe P{\u a}un and Gheorghe Stefanescu},
title={Sevilla Carpets Associated with {P} systems.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Arde:RiVU_TR_26_03:Mechanosensitiv:03,
author={Ioan I. Ardelean and Daniela Besozzi},
title={Mechanosensitive Channels, a Hot Topic in (Micro)Biology: any Excitement
for {P} systems?},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Arde:RiVU_TR_26_03:Playing_with_a:03,
author={Ioan I. Ardelean and Matteo Cavaliere},
title={Playing with a Probabilistic {P} system Simulator: Mathematical and Biological
Problems},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Krithi:RiVU_TR_26_03:P_Automata_with:03,
author={Kamala Krithivasan},
title={{P} Automata with Tapes},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Pere:RiVU_TR_26_03:Complexity_Clas:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Complexity Classes in Cellular Computing with Membranes},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Pere:RiVU_TR_26_03:Solving_VALIDIT:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Solving {VALIDITY} Problem by Active Membranes with Input},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Pere:RiVU_TR_26_03:Verification_of:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Verification of non-deterministic transition {P} systems solving {SAT} problem},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Cavali:RiVU_TR_26_03:Forbidding_and:03,
author={Matteo Cavaliere and Natasha Jonoska},
title={Forbidding and Enforcing in Membrane Computing.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Margen:RiVU_TR_26_03:Can_Hyperbolic:03,
author={Maurice Margenstern},
title={Can Hyperbolic Geometry Help Molecular Computing?},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Madhu:RiVU_TR_26_03:New_Results_in:03,
author={Mutyam Madhu},
title={New Results in Rewriting {P} systems},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Sosik:RiVU_TR_26_03:Solving_a_PSPAC:03,
author={Petr Sos{\'i}k},
title={Solving a {PSPACE}-Complete Problem by {P} systems with Active Membranes},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Ceterc:RiVU_TR_26_03:P_Systems_with:03,
author={Rodica Ceterchi and Carlos Mart{\'i}n-Vide},
title={{P} systems with Communication for Static Sorting.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Ceterc:RiVU_TR_26_03:Array-rewriting:03,
author={Rodica Ceterchi and Mutyam Madhu and Gheorghe P{\u a}un and K.G. Subramanian},
title={Array-rewriting {P} systems.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Ceterc:RiVU_TR_26_03:Generating_Pict:03,
author={Rodica Ceterchi and Radu Gramatovici and Natasha Jonoska and K.G. Subramanian},
title={Generating Picture Languages with {P} systems.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Freund:RiVU_TR_26_03:P_Systems_with:03,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Elementary Graph Productions},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Kris:RiVU_TR_26_03:Three_Universal:03,
author={Shankara Narayanan Krishna and Andrei P{\u a}un},
title={Three Universality Results on {P} systems},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Kris:RiVU_TR_26_03:Some_Universali:03,
author={Shankara Narayanan Krishna and Andrei P{\u a}un},
title={Some Universality Results on Evolution-Communication {P} systems},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Ji:RiVU_TR_26_03:Towards_a_Unifi:03,
author={Sungchul Ji},
title={Towards a Unified Theory of Computing, Mind, and Signs.},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Suzuki:RiVU_TR_26_03:Abstract_Rewrit:03,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Abstract Rewriting Systems on Multisets and Their Application for Modelling
Complex Behaviours},
institution={Rovira i Virgili University},
year={2003},
number={26}
}
@techreport{Lepora:DCSAUS_TR_01_04:Simulating_the:04,
author={Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title={Simulating the {Fredkin} {Gate} with Energy--Based {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Cordon:DCSAUS_TR_01_04:Looking_for_P_T:04,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Looking for {P Truth}},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Cordon:DCSAUS_TR_01_04:Weak_Metrics_on:04,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Weak Metrics on Configurations of a {P} system},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Besozz:DCSAUS_TR_01_04:Size_and_Power:04,
author={Daniela Besozzi and Erzsebet Csuhaj-Varj{\'u} and Giancarlo Mauri and Claudio
Zandron},
title={Size and Power of Extended Gemmating {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Fontan:DCSAUS_TR_01_04:Maximum_Search:04,
author={Federico Fontana and Giuditta Franco},
title={Maximum Search Using {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Sancho:DCSAUS_TR_01_04:A_Note_on_Compl:04,
author={Fernando Sancho-Caparrini},
title={A Note on Complexity Measures for Probabilistic {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Bernar:DCSAUS_TR_01_04:Cell_Communicat:04,
author={Francesco Bernardini and Marian Gheorghe},
title={Cell Communication in Tissue {P} systems and Cell Division in Population
{P Systems}},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Cioban:DCSAUS_TR_01_04:Pumps_Systems_o:04,
author={Gabriel Ciobanu},
title={Pumps Systems of Membranes},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Paun:DCSAUS_TR_01_04:Further_open_pr:04,
author={Gheorghe P{\u a}un},
title={Further open problems in membrane computing},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Paun:DCSAUS_TR_01_04:Tissue_P_System:04,
author={Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Tissue {P} systems with Cell Division},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Paun:DCSAUS_TR_01_04:P_Systems_with:04,
author = {Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title = {{P} systems with Tables of Rules},
institution = {Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year = {2004},
number = {01/2004},
}
@techreport{Franco:DCSAUS_TR_01_04:Membrane_Kauffm:04,
author={Giuditta Franco},
title={{M}embrane {K}auffman {N}etworks},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Arde:DCSAUS_TR_01_04:New_Proposals_f:04,
author={Ioan I. Ardelean and Daniela Besozzi},
title={New Proposals for the Formalization of Membrane Proteins},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Arde:DCSAUS_TR_01_04:Computing_Using:04,
author={Ioan I. Ardelean and Matteo Cavaliere and Dragos Sburlan},
title={Computing Using Signals: From Cells to {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Nepo:DCSAUS_TR_01_04:A_Java_Simulato:04,
author={Isabel A. Nepomuceno-Chamorro},
title={A {Java} Simulator for Basic Transition {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Semp:DCSAUS_TR_01_04:Covering_Rules:04,
author={Jos{\'e} M. Sempere},
title={Covering Rules in {P} systems: Some Preliminary Ideas},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Pan:DCSAUS_TR_01_04:Solving_Multidi:04,
author={Linqiang Pan and Carlos Mart{\'i}n-Vide},
title={Solving Multidimensional 0-1 {Knapsack} {Problem} by {P} systems with Input
and Active Membranes},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Pan:DCSAUS_TR_01_04:P_Systems_with:04,
author={Linqiang Pan and Tseren-Onolt Ishdorj},
title={{P} systems with Active Membranes and Separation Rules},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Ledesm:DCSAUS_TR_01_04:A_Tissue_P_Syst:04,
author={Lucas Ledesma and Daniel Manrique and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s
Silva},
title={A Tissue {P} system and a {DNA} Microfluidic Device for Solving the Shortest
Common Superstring Problem},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Pere:DCSAUS_TR_01_04:Solving_the_BIN:04,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco Jos{\'e} Romero-Campero},
title={Solving the {BINPACKING} Problem by Recognizer {P} systems with Active Membranes},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Pere:DCSAUS_TR_01_04:A_CLIPS_Simulat:04,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco Jos{\'e} Romero-Campero},
title={A {CLIPS} Simulator for Recognizer {P} systems with Active Membranes},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Cavali:DCSAUS_TR_01_04:P_Systems_with:04,
author={Matteo Cavaliere and Daniela Genova},
title={{P} systems with Symport/Antiport of Rules},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Guti:DCSAUS_TR_01_04:Towards_a_Progr:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Towards a Programming Language in Cellular Computing},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Guti:DCSAUS_TR_01_04:An_Efficient_Ce:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={An Efficient Cellular Solution for the Partition Problem},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Guti:DCSAUS_TR_01_04:Deductive_Datab:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Vladimir Rogozhin},
title={Deductive Databases and {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Ionesc:DCSAUS_TR_01_04:On_P_Systems_wi:04,
author={Mihai Ionescu and Dragos Sburlan},
title={On {P} systems with Promoters/Inhibitors},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Frisco:DCSAUS_TR_01_04:About_P_Systems:04,
author={Pierluigi Frisco},
title={About {P} systems with Symport/Antiport},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Ceterc:DCSAUS_TR_01_04:Simulating_Shuf:04,
author={Rodica Ceterchi and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Simulating {Shuffle-Exchange} Networks with {P} systems},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Freund:DCSAUS_TR_01_04:Sequential_P_Sy:04,
author={Rudolf Freund and Alberto Leporati and Marion Oswald and Claudio Zandron},
title={Sequential {P} systems with Unit Rules and Energy Assigned to Membranes},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Freund:DCSAUS_TR_01_04:P_Systems_with_Active:04,
author={Rudolf Freund and Andrei P{\u a}un},
title={{P} systems with Active Membranes and without Polarizations},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Freund:DCSAUS_TR_01_04:Tissue-like_P_S:04,
author={Rudolf Freund and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Tissue-like {P} systems with Channel-States},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Freund:DCSAUS_TR_01_04:P_Systems_with_Antiport:04,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Antiport Rules for Evolution Rules},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Rogozh:DCSAUS_TR_01_04:Simulation_of_M:04,
author={Vladimir Rogozhin and Elena Boian},
title={Simulation of Mobile Ambients by {P} systems. Part 2},
institution={Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla},
year={2004},
number={01/2004}
}
@techreport{Sburlan:RNGC_Report,
author={Dragos Sburlan},
title={Membrane systems with promoters/inhibitors. From computational universality
to algorithms},
institution={Sevilla University},
year={2004},
number={04/2004},
note={RNGC Report 04/2004}
}
@techreport{Cavaliere:RNGC_Report,
author={Matteo Cavaliere},
title={Evolution, communication and observation. From biology to membrane systems
and back},
institution={Sevilla University},
year={2004},
number={03/2004},
note={RNGC Report 03/2004}
}
@techreport{Calude_Paun:CDMTCS_R246:Cells_and_atoms_five_years,
author={Cristian S. Calude and Gheorghe P{\u a}un},
title={Computing with Cells and Atoms: After Five Years},
institution={Univ. of Auckland},
year={2004},
number={R 246},
note={CDMTCS Tech. Rep. R 246}
}
@techreport{Korczynski:W2/2003:Transformacje:04,
author={Waldemar Korczynski},
title={Transformacje systemow {P}auna jako model przeksztalcen systemowych},
institution={WSU Kielce},
year={2004},
number={W2/2003},
note={Raport z Badan Grantu W2/2003}
}
@techreport{Cavaliere:Decision,
author={Matteo Cavaliere and S. Sedwards},
title={Decision Problems in Membrane Systems with Peripheral Proteins, Transport
and Evolution},
institution={Microsoft Research - University of Trento, Centre for Computational and
Systems Biology},
year={2006},
address={Trento, Italy},
number={12/2006},
note={Microsoft Research - University of Trento, Centre for Computational and
Systems Biology}
}
@techreport{Cavaliere:Membrane_Systems:TR_04/2006:2006,
author={Matteo Cavaliere and S. Sedwards},
title={Membrane systems with peripheral proteins: transport and evolution},
institution={Microsoft Research - University of Trento, Centre for Computational and
Systems Biology},
year={2006},
address={Trento, Italy},
number={04/2006},
note={Microsoft Research - University of Trento, Centre for Computational and
Systems Biology}
}
@techreport{Campos:Development:INAOE:2006,
author={J.M. Campos Diaz and E. Lopez Dominguez and S. Lopez Escobar and J. Estudillo
Ramirez and L.D. Huerta Hernandez},
title={Development of a cleaner robot using techniques of membranes},
institution={Report INAOE},
year={2006},
address={Puebla, Mexic},
note={Report INAOE}
}
@techreport{Paun:Bounding_the_indegree:TUCS_TR_773:2006,
author={Gh. Paun and M.J. Perez-Jimenez and A. Salomaa},
title={Bounding the indegree of spiking neural P systems},
institution={TUCS Technical Report 773},
year={2006}
}
@techreport{Cavaliere:Asynchronous,
author={M. Cavaliere and O. Egecioglu and O.H. Ibarra and S. Woodworth and M. Ionescu
and Gh. Paun},
title={Asynchronous Spiking Neural {P} Systems Technical Report 9/2007, Microsoft
Research - University of Trento, Centre for Computational and Systems Biology},
institution={Microsoft Research � University of Trento},
year={2007},
number={9-2007}
}
@techreport{Cavaliere:Colonies_of:TRMR:2007,
author={M. Cavaliere and R. Mardare and S. Sedwards},
title={Colonies of Synchronizing Agents Technical Report 11-2007, Microsoft Research
� University of Trento, Centre for Computational and Systems Biology},
institution={Microsoft Research � University of Trento},
year={2007},
number={11-2007}
}
@phdthesis{Romero-Campero:PhD:2008,
author = {Francisco J. Romero-Campero},
title = {P systems, a computational modelling framework for systems biology},
school = {University of {S}evilla},
year = {2008},
address = {Sevilla, Spain},
}
@phdthesis{Zandron:PhD:2002,
author={Claudio Zandron},
title={A Model for Molecular Computing: Membrane Systems},
school={Dipartimento di Scienze dell'Informazione, Universita' degli Studi di Milano},
year={2002},
address={Milano, Italy}
}
@phdthesis{Sancho-Caparrini:PhD:2002,
author={Fernando Sancho-Caparrini},
title={Verification of Programs in Unconventional Computing Models},
school={University of {S}evilla},
year={2002},
address={Sevilla, Spain}
}
@phdthesis{Krishna:PhD:2002,
author={Shankara-Narayanan Krishna},
title={Languages of {P Systems}. {C}omputability and Complexity},
school={Indian Institute of Technology},
year={2002},
address={Madras, India}
}
@phdthesis{Romero-Jimenez:PhD:2003,
author={Alvaro Romero-Jim{\'e}nez},
title={Complexity and universality in cellular computing models},
school={Departamento de {C}iencias de la {C}omputaci{\'o}n e {I}nteligencia {A}rtificial.
{U}niversidad de {S}evilla},
year={2003},
address={Sevilla, Spain}
}
@phdthesis{Paun:PhD:2003,
author={Andrei P{\u a}un},
title={Unconventional Models of Computation: {DNA} and {M}embrane {C}omputing},
school={University of Western Ontario},
year={2003},
month={May},
address={London, Ontario, Canada}
}
@phdthesis{Oswald:PhD:2003,
author={Marion Oswald},
title={{P Automata}},
school={Faculty of Computer Science. TU Vienna},
year={2003},
month={November},
address={Vienna, Austria}
}
@phdthesis{Madhu:PhD:2003,
author={Mutyam Madhu},
title={Studies of {P Systems} as a model of cellular computing},
school={Dept. of Computer Science and Engineering, Indian Institute of Technology},
year={2003},
address={Madras, India}
}
@phdthesis{Riscos-Nunez:PhD:2004,
author={Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Cellular Programming: Efficient Resolution of {NP-Complete} Numerical Problems},
school={Universidad de Sevilla},
year={2004},
address={Sevilla, Spain}
}
@phdthesis{Besozzi:PhD:2004,
author={Daniela Besozzi},
title={Computational and modelling power of {P systems}},
school={Universita' degli Studi di Milano},
year={2004},
address={Milano, Italy}
}
@phdthesis{Arroyo:PhD:2004,
author={Fernando Arroyo-Montoro},
title={Structures and Biolanguage to Simulate Membrane Computing},
school={Departamento de {I}nteligencia {A}rtificial. {F}acultad de {I}nform{\'a}tica.
{U}niversidad {P}olit{\'e}cnica de {M}adrid},
year={2004},
month={June},
address={Madrid, Spain}
}
@phdthesis{Lakshmanan:PhD:2004,
author = {L. Lakshmanan},
title = {On the Crossroads of {P Systems} and Contextual Grammars: Variants, Computability
Complexity and Efficiency},
school = {Dept. of Mathematics, Indian Institute of Technology},
year = {2004},
address = {Madras, India},
}
@phdthesis{Frisco:PhD:2004,
author={Pierluigi Frisco},
title={Theory of Molecular Computing. {S}plicing and {M}embrane Systems},
school={Leiden University, The Netherlands},
year={2004}
}
@phdthesis{Verlan:PhD:2004,
author = {Sergey Verlan},
title = {Head systems and application to bio-informatics},
school = {{LITA}, Universit\'e de Metz},
year = {2004},
address = {Metz, France},
}
@phdthesis{Bernardini:PhD:2005,
author={Francesco Bernardini},
title={Membrane Systems for Molecular Computing and Biological Modelling},
school={University of Sheffield},
year={2005},
address={Sheffield, UK}
}
@phdthesis{Cienciala:PhD:2005,
author={Ludek Cienciala},
title={P automata},
school={University of Ostrava},
year={2005},
address={Ostrava, Czech Republic}
}
@phdthesis{Alhazov:PhD:2006,
author = {Artiom Alhazov},
title = {Communication in Membrane Systems with Symbol Objects},
school = {University of Sevilla, Spain},
year = {2006},
address = {Sevilla, Spain},
abstract = {This thesis deals with membrane systems with symbol objects as a theoretical
framework of distributed parallel multiset processing systems.
A halting computation can accept, generate or process a number, a vector
or a word, so the system globally defines (by the results of all its computations)
a set of numbers or a set of vectors or a set of words, (i.e., a language)
or a function. The ability of these systems to solve particular problems is
investigated, as well as their computational power, e.g., the language families
defined by different classes of these systems are compared to the classical
ones, i.e., regular, context-free, languages generated by extended tabled
0L systems, languages generated by matrix grammars without appearance
checking, recursively enumerable languages, etc. Special attention is paid to
communication of objects between the regions and to the ways of cooperation
between the objects.
An attempt to formalize the membrane systems is made, and a software
tool is constructed for the non-distributed cooperative variant, the configuration
browser, i.e., a simulator, where the user chooses the next configuration
among the possible ones and can go back. Different distributed models are
considered. In the evolution--communication model rewriting-like rules are
separated from transport rules. Proton pumping systems are a variant of
the evolution--communication systems with a restricted way of cooperation.
A special membrane computing model is a purely communicative one: the
objects are moved together through a membrane.
Determinism is a special property of computational systems; the question
of whether this restriction reduces the computational power is addressed. The
results on proton pumping systems can be carried over to the systems with bistable
catalysts. Some particular examples of membrane systems applications
are solving NP-complete problems in polynomial time, and solving the sorting
problem.},
keywords = {P systems, membrane computing, symport, antiport, parallel multiset processing},
eprint = {http://psystems.disco.unimib.it/download/Alhazovthesis.zip},
url = {http://www.tesisenxarxa.net/TDX-0704107-093050/},
}
@phdthesis{Popa:PhD:2006,
author={B. Popa},
title={Membrane Systems with Limited Parallelism},
school={College of Engineering and Science, Louisiana Tech University, Ruston, USA},
year={2006},
address={Ruston, USA}
}
@phdthesis{Sburlan:PhD:2006,
author={Dragos Sburlan},
title={Promoting and Inhibiting Contexts in Membrane Computing},
school={University of Sevilla},
year={2006},
address={Sevilla, Spain}
}
@phdthesis{Cavaliere:PhD:2006,
author={Mateo Cavaliere},
title={Evolution, communication, observation: From biology to membrane computing
and back},
school={University of Sevilla},
year={2006},
address={Sevilla, Spain}
}
@phdthesis{Bianco:PhD:2007,
author={L. Bianco},
title={Membrane Models of Biological Systems},
school={Universita' degli Studi di Verona, Italy},
year={2007},
address={Verona, Italy}
}
@phdthesis{Hemalatha:PhD:2007,
author={S. Hemalatha},
title={A Study on Rewriting {P} Systems, Splicing Grammar Systems and Picture Array
Languages},
school={University of Chennai, India},
year={2007},
address={India}
}
@phdthesis{Ishdorj:PhD:2007,
author={T. O. Ishdorj},
title={Membrane Computing, Neural Inspiration, Gene Assembly in Ciliates},
school={Universidad de Sevilla, Spain},
year={2007},
address={Sevilla, Spain}
}
@misc{Zandron:Priorities_and_Variable_Thickness:2000,
author={Claudio Zandron and Claudio Ferretti and Giancarlo Mauri},
title={Priorities and Variable Thickness of Membranes in Rewriting {P} Systems},
year={2000}
}
@misc{Freund:Computing_with_Membranes_Three:2000,
author={Rudolf Freund and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Computing with Membranes: Three More Collapsing Hierarchies},
year={2000}
}
@misc{Stefan:Chaotic_membrane_computation:2002,
author={Gheorghe Stefan},
title={Chaotic membrane computation with cellular automata},
year={2002}
}
@misc{Cioban:A_Computational:Un,
author={Gabriel Ciobanu and Vlad Ciubotariu and Bogdan Tanasa},
title={A Computational Model of Membrane Transportation},
howpublished={Submitted}
}
@misc{Bel_En:Dynamic_meaning:Un,
author={Gemma Bel-Enguix and M. Dolores Jim{\'e}nez-L{\'o}pez},
title={Dynamic meaning membrane systems},
howpublished={Submitted}
}
@misc{Bel_En:Membrane_system:Un,
author={Gemma Bel-Enguix and M. Dolores Jim{\'e}nez-L{\'o}pez},
title={Membrane systems for conversation modeling},
note={Gemma Bel-Enguix, Introducing Parallelism in Conversation Modeling with
Membrane Systems (submitted).},
howpublished={Submitted}
}
@misc{Cavali:Evolutioncomm:Un,
author={Matteo Cavaliere},
title={Evolution, communication and observation. From biology to membrane systems
and back},
note={RNGC Report 03/2004, Sevilla University.},
howpublished={Submitted}
}
@misc{Madhu:Rewriting_P_Sys:Un,
author={Mutyam Madhu},
title={Rewriting {P} Systems. Collapsing Hierarchies},
note={Theoretical Computer Science, to appear},
howpublished={Submitted}
}
@misc{Freund:On_Deterministi:Un,
author={Rudolf Freund and Gheorghe P{\u a}un},
title={On Deterministic {P Systems}},
howpublished={Submitted}
}
@misc{Qi:The_P_system_ba:Un,
author={Zhengwei Qi and Jinyuan You and Ying Jin and Hongyan Mao},
title={The {P System} based transaction model for mobile computing},
howpublished={Submitted}
}
@misc{Botton:Membrane_System:00,
author={Paolo Bottoni and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Grzegorz
Rozenberg},
title={Membrane Systems with Promoters/Inhibitors.},
year={2000},
howpublished={Submitted}
}
@misc{Krishna:On_Simple_P_Sys:00,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={On Simple {P Systems} with External Output},
year={2000},
howpublished={Submitted}
}
@misc{Obtulo:Note_on_some_re:01,
author={Adam Obtulowicz},
title={Note on some recursive family of {P Systems} with active membranes},
year={2001},
howpublished={Submitted}
}
@misc{Rodrig:Computing_with_:01,
author={Alfonso Rodriguez-Pat{\'o}n},
title={Computing with Membranes: {P Systems} with {DNA-Worms}},
note={GECCO, 2001 (poster)},
year={2001},
howpublished={GECCO, 2001 (poster)}
}
@misc{Paun:On_the_reachabi:01,
author={Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={On the reachability problem for {P Systems} with porters},
note={Proc. AFL10, Debrecen, 2002},
year={2001},
howpublished={Submitted}
}
@misc{Subr:A_note_on_self_:01,
author={K.G. Subramanian and D.G. Thomas and M.H. Begum and P.H. Chandra},
title={A note on self crossover and splicing {P Systems}},
note={Pre-Proceedings of WMC 2001 (No est{\'a} en los proceedings: Fundamenta Informaticae
49)},
year={2001}
}
@misc{Krishna:Time-Varying_an:01,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={Time-Varying and Null Parallel {P Systems}},
note={No aparece},
year={2001},
howpublished={No aparece}
}
@misc{Ciobanu:Distributed_com:02,
author={Gabriel Ciobanu},
title={Distributed computing in {P Systems} with antiport communication},
year={2002},
howpublished={Submitted}
}
@misc{Madhu:A_Note_on_P_Sys:02,
author={Mutyam Madhu},
title={A Note on {P Systems} with Replicated Rewriting},
year={2002},
howpublished={Submitted}
}
@misc{Madhu_:Hybrid_P_System:02,
author={Mutyam Madhu and Kamala Krithivasan},
title={Hybrid {P Systems}: Improved Universality Results},
note={Poster in Unconventional Models of Computation, UMC-02, Himeji, Japan, October
15-19, 2002},
year={2002},
month={October 15-19},
howpublished={Poster in Unconventional Models of Computation, UMC-02, Himeji, Japan, October
15-19, 2002}
}
@misc{Madhu:Hardware_Realiz:02,
author={Mutyam Madhu and Vadali S. Murty and Kamala Krithivasan},
title={Hardware Realization of {P Systems} with Carriers},
note={Poster presentation in the Eighth International Conference on DNA based
Computers, Hokkaido University, Sapporo Campus, Japan, June 10-13, 2002},
year={2002},
month={June},
howpublished={Poster presentation in the Eighth International Conference on DNA based
Computers, Hokkaido University, Sapporo Campus, Japan, June 10-13, 2002}
}
@article{Sosik:The_power_of_ca:02,
author = {Petr Sos{\'i}k},
title = {The power of catalysts and priorities in membranes},
journal = {Grammars},
year = {2003},
volume = {6},
pages = {13--24},
}
@misc{Krishna:Infinite_hierar:02,
author={Shankara Narayanan Krishna},
title={Infinite hierarchies on some variants of {P Systems}},
year={2002},
howpublished={Submitted}
}
@misc{Ji:Towards_the_mod:Un,
author={Sungchul Ji and Gabriel Ciobanu},
title={Towards the modeling of cell communication and computation using the shape
algebra of biopolymers},
note={psystems.disco.unimib.it},
year={2002},
howpublished={psystems.disco.unimib.it}
}
@misc{Syropo:Fuzzyfying_P_Sy:Un,
author={A. Syropoulos},
title={Fuzzyfying {P Systems}},
year={2003},
howpublished={Submitted}
}
@misc{Obtulo:New_mathematica:Un,
author={Adam Obtulowicz},
title={New mathematical foundations of membrane computing; Attacking {NP} complete
problems revisited},
year={2003},
howpublished={Submitted}
}
@misc{PerezJ:Computing_a_par:01,
author={Antonio Perez-Jimenez and Mario J. Perez-Jimenez and Fernando Sancho-Caparrini},
title={Computing a partial mapping by {P Systems}: Design and verification},
note={M. Cavaliere, C. Mart{\'i}n-Vide, Gh. Paun (Eds), Brainstorming Week on Membrane
Computing; Tarragona, Feb 5-11 2003, 247-260},
year={2003}
}
@misc{Lakshm:Computational_U:Un,
author={K. Lakshmanan},
title={Computational Universality and Solving {NP} Complete Problems using Insertion
Deletion Tissue {P Systems}},
year={2003},
howpublished={Submitted}
}
@misc{Verlan:2MOLCONET:2003,
author={Sergei Verlan},
title={Communicating Distributed H Systems with Alternating Filters and Tissue
P Systems with Minimal Symport/Antiport},
note={EMCC Workshop - 2nd Annual MolCoNet Meeting November 27-29, 2003 Wien, Austria},
year={2003}
}
@misc{Cordon-Franco:Cellular,
author = {A. Cordon-Franco and M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez and A.
Riscos-Nunez},
title = {Cellular solutions to some numerical NP-complete problems. A Prolog implementation
Molecular Computational Models},
note = {Idea-Group, London 2004, 115--149},
year = {2004},
howpublished = {Unconventional Approaches (M. Gheorghe, ed.)},
}
@misc{Binder:Implem_of_Catalytic:Subm04,
author={Aneta Binder and Rudolf Freund and Georg Lojka and Marion Oswald},
title={Implementation of catalytic {P Systems}},
note={CIAA 2004, Ninth Intern. Conf. on Implementation and Application of Automata,
Kingston, Canada, 2004, 24--33},
year={2004},
howpublished={Submitted}
}
@misc{DiNola:Handling_Imprecision:04,
author={Antonio Di-Nola and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Francesc
Rossell{\'o}},
title={(Imprecise Topic About) {H}andling Imprecision in {P Systems}},
year={2004},
howpublished={Submitted}
}
@misc{Sburlan:Bull:2004,
author={D. Sburlan},
title={New Results on {P} systems with multiset promoted/inhibited rules},
note={pages 45--54},
year={2004},
howpublished={Bull. PAMM, 2164}
}
@misc{Bertinshaw:algorithmic_learning:04,
author={Daniel Bertinshaw},
title={Algorithmic learning applications to {P Systems}},
year={2004},
howpublished={Submitted}
}
@misc{Besozzi:Dynamical_prob:Subm04,
author={Daniela Besozzi and Claudio Zandron},
title={Dynamical probabilistic {P Systems}},
note={¿DNA10 poster?},
year={2004},
howpublished={Submitted}
}
@misc{Csuhaj:PC_grammar_systems:Subm04,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gheorghe P{\u a}un and Gyorgy Vaszil},
title={Grammar systems vs. membrane computing: The case of {PC} grammar systems},
year={2004},
howpublished={Submitted}
}
@misc{Csuhaj:CD_grammar_systems:Subm04,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gheorghe P{\u a}un and Gyorgy Vaszil},
title={Grammar systems vs. membrane computing: The case of {CD} grammar systems},
year={2004},
howpublished={Submitted}
}
@misc{CsuhajVarju:On_The_Comp:Subm04,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Oscar H. Ibarra and Gyorgy Vaszil},
title={On the computational complexity of {P automata}},
note={DNA 10},
year={2004},
howpublished={Submitted}
}
@misc{Bel:Linguistic_membrane:Subm04,
author = {Gemma Bel-Enguix and M. Dolores Jim{\'e}nez-L{\'o}pez},
title = {Linguistic membrane systems and applications},
note = {Gemma Bel-Enguix and M. Dolores Jim{\'e}nez-L{\'o}pez, Linguistic membrane systems
and applications, in G. Ciobanu and Gh. P{\u a}un and M.J. P{\'e}rez-Jim{\'e}nez (eds.)
Applications of Membrane Computing, Berlin, Springer-Verlag (in press).},
year = {2004},
howpublished = {Submitted},
}
@misc{Paun:P_Systems_on_Gr:Un,
author={Gheorghe P{\u a}un and Yasubumi Sakakibara and Takashi Yokomori},
title={{P Systems} on Graphs of Restricted Forms},
note={Publicationes Mathematicae Debrecen, to appear},
year={2004},
howpublished={Publicationes Mathematicae Debrecen, to appear}
}
@misc{Bianco:P_,
author={Luca Bianco and Federico Fontana and Giuditta Franco and Vincenzo Manca},
title={{P Systems} in bio systems},
note={in G. Paun, P systems: Applications and Perspectives, to appear, 2004},
year={2004},
howpublished={Submitted}
}
@misc{PerezJimenez:Hard_Problems:04,
author={M.J. Perez-Jimenez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Hard problems addressed through {P Systems}},
year={2004},
howpublished={Submitted}
}
@misc{Cavaliere:Modelling_respiration:Subm04,
author={Matteo Cavaliere and Ioan I. Ardelean},
title={Modelling respiration in bacteria and respiration/photosynthesis interaction
in Cyanobacteria by using a {P System} simulator},
year={2004},
howpublished={Submitted}
}
@misc{Cavaliere:time_free_P_Systems:04,
author={Matteo Cavaliere and Vincenzo Deufemia},
title={On time-free {P Systems}},
year={2004},
howpublished={Submitted}
}
@misc{Madhu:leftmost_rewriting:04,
author={Mutyam Madhu and Kamala Krithivasan},
title={Tissue {P Systems} with leftmost rewriting},
year={2004},
howpublished={Submitted}
}
@misc{Ibarra:Determinism_Versus_Nondeterminism:04,
author={Oscar H. Ibarra},
title={On Determinism Versus Nondeterminism in {P Systems}},
year={2004},
howpublished={Submitted}
}
@misc{Ibarra:maximal_parallelism_in_P:Subm04,
author={Oscar H. Ibarra and H.-C. Yen and Zhe Dang},
title={The power of maximal parallelism in {P Systems}},
note={To appear in Proceedings of DLT'04 Lecture Notes in Computer Science, Springer.
2004.},
year={2004},
howpublished={Submitted}
}
@misc{Freund:Asynchronous_P_systems_on:Subm04,
author={Rudolf Freund},
title={Asynchronous {P Systems} on arrays and strings},
note={DLT'04 - Eighth International Conference on Developments in Language Theory.
To appear in Proceedings of DLT'04 Lecture Notes in Computer Science, Springer.
2004.},
year={2004},
howpublished={Submitted}
}
@misc{Freund:Dynamic_Channels_2004,
author={Rudolf Freund and Marion Oswald},
title={P systems with dynamic channels transporting membrane vesicles},
year={2004},
howpublished={Submitted}
}
@misc{Verlan:Tissue_with_minimal:Subm04,
author={Sergey Verlan},
title={Tissue {P Systems} with minimal symport/antiport},
note={DLT'04 - Eighth International Conference on Developments in Language Theory,
Auckland, New Zealand - December 13-17 2004},
year={2004}
}
@misc{Krishna:Mobile_membranes:04,
author={Shankara Narayanan Krishna and Gheorghe P{\u a}un},
title={{P Systems} with mobile membranes},
year={2004},
howpublished={Submitted}
}
@misc{Ishdorj:Replicative_distribution_rules:Subm04,
author={Tseren Onolt Ishdorj and Mihai Ionescu},
title={Replicative-distribution rules in {P Systems} with active membranes},
note={First International Colloquium on THEORETICAL ASPECTS OF COMPUTING Guiyang,
China 20 - 24 September 2004},
year={2004},
howpublished={Submitted}
}
@misc{Korczynski:tool_to_deal_concurrency:Subm04,
author={Waldemar Korczynski},
title={{P Systems} as a tool to deal with concurrency in accounting},
year={2004},
howpublished={Submitted}
}
@misc{Suzuki:Toward_a_novel:Subm04,
author={Yasuhiro Suzuki and Daniela Besozzi and Claudio Zandron and Hiroshi Tanaka
and Giancarlo Mauri},
title={Toward a novel computational framework for molecular computing: chemical
reaction as computation},
note={DNA10, Milano, 2004},
year={2004},
howpublished={Submitted}
}
@misc{Apostolos:Generalized_fuzzy:2005,
author={A. Apostolos},
title={Generalized fuzzy multisets and {P} systems},
year={2005},
howpublished={Submitted}
}
@misc{Apaun:P,
author={A. Paun and B. Popa},
title={P systems with proteins on membranes},
year={2005},
howpublished={Submitted}
}
@misc{Porreca:Complexity,
author={A. Porreca and G. Mauri and C. Zandron},
title={Complexity Classes for Membrane Systems},
year={2005},
howpublished={Submitted}
}
@misc{Rodriguez:characterize,
author = {A. Rodriguez-Paton and P. Sosik},
title = {P systems with active membranes characterize {PSPACE}},
booktitle = {DNA Computing, 12th Int. Meeting on DNA Computing, DNA 12},
year = {2006},
publisher = {Springer-Verlag, Berlin},
address = {Seoul, Korea},
editor = {C. Mao, T. Yokomori},
pages = {33--46},
abstract = {A P system is a natural computing model inspired by information
processes in cells and a control role of cellular membranes. We show that uniform families of P systems with active membranes are able to solve, in polynomial time, exactly the class of decisional problems {PSPACE}. Similar results were achieved also with other models of bio-inspired computers, such as DNA computing. Together they suggest that {PSPACE} naturally characterizes the computational potential of biological information processing.},
series = {Lecture Notes in Computer Science},
volume = {4287},
}
@misc{Bonchis:UC05:2005,
author={C. Bonchis and G. Ciobanu and C. Isbasha and D. Petcu},
title={A web-based P system simulator and its parallelization},
year={2005},
howpublished={UC05, accepted}
}
@misc{Graciani:UC05:2005,
author={C. Graciani and A. Riscos-Nunez},
title={Looking for simple common schemes to design recognizer P systems with active
membranes that solve numerical decision problems},
year={2005},
howpublished={UC05, accepted}
}
@misc{Csuhaj:Editing_Configurations:2005,
author={Erzsebet Csuhaj-Varju and Antonio Di Nola and Gheorghe P{\u a}un and Mario
Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil},
title={Editing configurations of {P} systems},
year={2005},
howpublished={Submitted}
}
@misc{Bernardini:Quorum,
author={F. Bernardini and M. Gheorghe and N. Krasnogor},
title={Quorum sensing P systems},
year={2005},
howpublished={Submitted}
}
@misc{Bernardini:UC05:2005,
author={F. Bernardini and M. Gheorghe and N. Krasnogor and J.-L. Giavitto},
title={On self-assembly in population P systems},
year={2005},
howpublished={UC05, accepted}
}
@misc{Ciobanu:The,
author={G. Ciobanu and Gheorghe P{\u a}un},
title={The minimal parallelism is still universal (for P systems with symport/antiport
rules)},
year={2005}
}
@misc{Paun:MC_Power_Efficiency_applications:2005,
author={Gheorghe P{\u a}un},
title={Membrane computing: Power, efficiency, applications},
year={2005},
howpublished={Submitted}
}
@misc{Paun:Brief,
author={Gheorghe P{\u a}un and M.J. Perez-Jimenez},
title={Membrane computing: Brief introduction, recent results and applications},
year={2005},
howpublished={Submitted}
}
@misc{Paun:Infinite,
author={Gheorghe P{\u a}un and M.J. Perez-Jimenez and G. Rozenberg},
title={Infinite spike trains in spiking neural P systems},
year={2005},
howpublished={Submitted}
}
@misc{Paun:Spike,
author={Gheorghe P{\u a}un and M.J. Perez-Jimenez and G. Rozenberg},
title={Spike trains in spiking neural P systems},
year={2005},
howpublished={Submitted}
}
@misc{Paun:MC_and_Economics:submitted:2005,
author={Gheorghe P{\u a}un and R. Paun},
title={Membrane Computing and Economics: Numerical P Systems},
year={2005},
howpublished={Submitted}
}
@misc{Paun:Mcas_a_framework:2005,
author={Gheorghe P{\u a}un and R. Paun},
title={Membrane computing as a framework for modeling economic processes},
year={2005},
howpublished={Submitted}
}
@misc{Cardona:Handling,
author={M. Cardona and M. Angels Colomer and M.J. Perez-Jimenez and A. Zaragoza},
title={Handling Markov chains with membrane computing},
year={2005},
howpublished={Submitted}
}
@misc{Cavaliere:external,
author={M. Cavaliere and A. Riscos-Nunez and G. Rozenberg and D. Sburlan},
title={Membrane systems with external control},
year={2005},
howpublished={Submitted}
}
@misc{Cavaliere:marked,
author={M. Cavaliere and A. Riscos-Nunez and R. Brijder and G. Rozenberg},
title={Membrane systems with marked membranes},
year={2005},
howpublished={Submitted}
}
@misc{Gheorghe:self-assembly:submitted:2005,
author={M. Gheorghe and Gheorghe P{\u a}un},
title={Computing by self-assembly: DNA molecules, polyominoes, cells},
year={2005},
howpublished={Submitted}
}
@misc{Gutierrez-Naranjo:UC05:2005,
author = {M. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez},
title = {P systems with active membranes, without polarizations and without dissolution:
a characterization of P},
year = {2005},
howpublished = {UC05, accepted},
}
@misc{Ionescu:Spiking,
author={M. Ionescu and Gheorghe P{\u a}un and T. Yokomori},
title={Spiking neural-like P systems},
year={2005},
howpublished={Submitted}
}
@misc{Perez-Jimenez:ECAL:2005,
author={M.J. Perez-Jimenez and F.J. Romero-Campero},
title={Modelling Vibrio fischeri's behaviour Using P Systems},
year={2005},
month={September},
howpublished={accepted in the Systems Biology Workshop, ECAL 2005}
}
@misc{Perez:Modelling_EFGR:2005,
author={Mario J. P{\'e}rez-Jimenez and Francisco Jos{\'e} Romero-Campero},
title={Modelling EGFR signalling network using continuous membrane systems},
year={2005},
howpublished={Submitted}
}
@misc{Ibarra:context-sensitive,
author={O.H. Ibarra and Gheorghe P{\u a}un},
title={Characterizations of context-sensitive languages and other language classes
in terms of symport/antiport P systems},
year={2005},
howpublished={Submitted}
}
@misc{Ibarra:On,
author={O.H. Ibarra and H.-C. Yen},
title={On deterministic catalytic P systems},
year={2005},
howpublished={Submitted}
}
@misc{Brijder:Communication,
author={R. Brijder and G. Rozenberg and M. Cavaliere and A. Riscos-Nunez and D. Sburlan},
title={Communication membrane systems with active symports},
year={2005},
howpublished={Submitted}
}
@misc{R_Paun:Producers_retailers:manuscript:2005,
author={R. Paun},
title={Producers, retailers, and their investments. A membrane computing approach},
year={2005},
howpublished={manuscript}
}
@misc{Freund:Tissue_P_Sys_Symp_Ant_are_universal:2005,
author={Rudolf Freund and Marion Oswald},
title={Tissue P systems with symport/antiport rules of one symbol are computationally
universal},
year={2005},
howpublished={Submitted}
}
@misc{Dang:UC05:2005,
author={Z. Dang and O.H. Ibarra and C. Li and G. Xie},
title={On model-checking of P systems},
year={2005},
howpublished={UC05, accepted}
}
@article{Alhazov.etal:DivCreaOC:IJCM2006,
author = {Artiom Alhazov and Rudolf Freund and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
title = {Membrane Division, Restricted Membrane Creation
and Object Complexity in {P}~Systems},
journal = {International Journal of Computer Mathematics},
volume = {83},
number = {7},
year = {2006},
pages = {529--548},
abstract = {We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region (except the environment) contains more than one object of the same kind. We show here that they generate all recursively enumerable languages, and that two membrane labels are sufficient (the same result holds for accepting all recursively enumerable vectors of non-negative integers). Moreover, at most two objects are present inside the system at any time in the generative case. We then prove that 10+m symbols are sufficient to generate any recursively enumerable language over m symbols. P systems with active membranes without polarizations are known to generate all recursively enumerable sets of vectors of non-negative integers. We show that they generate all recursively enumerable languages; four starting membranes with three labels or seven starting membranes with two labels are sufficient. P systems with active membranes and two polarizations are known to generate/accept all recursively enumerable sets of vectors of non-negative integers, using only rules of rewriting and sending objects out. We show that accepting can be done by deterministic systems. Finally, we show that P systems with restricted membrane creation (the newly created membrane can only be of the same kind as the parent one) generate at least matrix languages, even when having at most one object in the configuration (except the environment). We conclude by presenting a summary of the main results obtained in this paper and a list of open questions.},
keywords = {Membrane division, Restricted membrane creation, Object complexity, P systems},
url = {http://dx.doi.org/10.1080/00207160601065314},
}
@misc{Apaun:ewriting,
author={A. Paun and B. Popa},
title={Rewriting P systems with communication by symport rules},
year={2006},
howpublished={Submitted}
}
@misc{Apaun:Small_universal:Submitted:2006,
author={A. Paun and Gheorghe P{\u a}un},
title={Small universal spiking neural P systems},
year={2006},
howpublished={Submitted}
}
@misc{GhPaun:Manuscript:2006,
author={Gheorghe P{\u a}un},
title={2006 Research topics in membrane computing},
year={2006},
howpublished={Nanuscript}
}
@misc{Chen:Spiking_neural:Submitted:2006,
author={H. Chen and Gheorghe P{\u a}un and M.J. Perez-Jimenez},
title={Spiking neural P systems with extended rules},
year={2006},
howpublished={Submitted}
}
@misc{Chen:Trace_languages:Submitted:2006,
author={H. Chen and M. Ionescu and A. Paun and Gheorghe P{\u a}un and B. Popa},
title={On trace languages generated by spiking neural P systems},
year={2006},
howpublished={Submitted}
}
@misc{Chen:String_languages:Submitted:2006,
author={H. Chen and R. Freund and M. Ionescu and Gheorghe P{\u a}un and M.J. Perez-Jimenez},
title={On string languages generated by spiking neural P systems},
year={2006},
howpublished={Submitted}
}
@misc{Kleijn:Process_semantics:Submitted:2006,
author={J. Kleijn and M. Koutny and G. Rozenberg},
title={Process semantics for membrane systems},
year={2006},
howpublished={Submitted}
}
@misc{Bianco:Computation_of_biochemical:2006,
author={L. Bianco and F. Fontana and V. Manca},
title={Computation of biochemical dynamics using MP systems},
year={2006},
howpublished={Computational Methods in Systems Biology, International Conference (poster)}
}
@misc{GutierrezNaranjo:Manuscript:2006,
author = {M.A. Guti{\'e}rrez-Naranjo},
title = {Fractals and P systems},
year = {2006},
howpublished = {Manuscript},
}
@misc{Busi:Decidability:Submitted:2006,
author={N. Busi},
title={Decidability of divergence for catalytic P systems},
year={2006},
howpublished={Submitted}
}
@misc{Ibarra:Normal_forms:Submitted:2006,
author={O.H. Ibarra and A. Paun and Gheorghe P{\u a}un and A. Rodriguez-Paton and
P. Sosik and S.Woodworth},
title={Normal forms for spiking neural P systems},
year={2006},
howpublished={Submitted}
}
@misc{Frisco:Dynamics_of_HIV:2006,
author={P. Frisco and D. W. Corne},
title={Dynamics of HIV infection studied with Cellular Automata and Conformon-P
systems},
year={2006},
howpublished={Submitted}
}
@misc{Krishna:Combining:Submitted:2006,
author={S. Krishna},
title={Combining brane calculus and membrane computing},
year={2006},
howpublished={Submitted}
}
@misc{Ishdorj:Minimal,
author={T.-O. Ishdorj},
title={Minimal parallelism for polarizationless P systems},
year={2006},
howpublished={Submitted}
}
@misc{Dang:Decidability:Submitted:2006,
author={Z. Dang and O.H. Ibarra and C. Li},
title={Decidability of model-checking P systems},
year={2006},
howpublished={Submitted}
}
@mastersthesis{Besozzi:Master:2000,
author={Daniela Besozzi},
title={{P Systems} with Gemmation},
school={Universita' degli Studi di Milano},
year={2000}
}
@mastersthesis{Prakash:Master:2001,
author={Peranandam Prakash-Mohan},
title={Computing with membranes},
school={TU Dresden, Fakultat Informatik},
year={2001},
month={April}
}
@mastersthesis{Domine:Master:2001,
author={Richard Domine},
title={Theorem proving using membrane computing},
school={Dresden University},
year={2001}
}
@mastersthesis{Buzzi:Master:2003,
author={Mara Buzzi},
title={Calcolo con membrane. {P Sistemi} probabilistici},
school={Univ. of Como},
year={2003}
}
@inproceedings{Alhazov.etal:MinCoo3m:PostWMC5:2005,
author = {Artiom Alhazov and Maurice Margenstern and Vladimir Rogozhin
and {\relax Yu}rii Rogozhin and Sergey Verlan},
title = {Communicative {P} Systems with Minimal Cooperation},
booktitle = {International Workshop WMC5, Milano, Italy, 2004},
editor = {Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {3365},
publisher = {Springer},
year = {2005},
pages = {146--160},
abstract = {We prove that two classes of communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with symport rules of size 2, are computationally complete: they generate all recursively enumerable sets of vectors of nonnegative integers. The result of computation is obtained in the elementary membrane.},
url = {http://www.springerlink.com/content/66xpyl1a4vlg8fw7/},
}
@inproceedings{Gutuleac:Descriptive,
author={E. Gutuleac},
title={Descriptive times membrane Petri nets for modelling of parallel computing},
booktitle={Proc. of ICCCC 2006, Oradea, Romania, June 2006},
pages={256--261}
}
@inproceedings{Ciobanu:A,
author={G. Ciobanu},
title={A programming perspective of the membrane computing},
booktitle={Proc. of ICCCC 2006, Oradea, Romania, June 2006},
pages={13--22}
}
@inproceedings{Cavaliere:Modelling_Cellular_Processes:LNBI:,
author={M. Cavaliere and S. Sedwards},
title={Modelling Cellular Processes using Membrane Systems with Peripheral and
Integral Proteins},
booktitle={Fourth International Conference on Computational Methods in Systems Biology,
CMSB2006},
publisher={Springer-Verlag},
series={Lecture Notes In Bioinformatics}
}
@inproceedings{Gontineac:Mealy,
author={M. Gontineac},
title={Mealy membrane automata: an automata-like approach to membrane computing},
booktitle={Proc. of ICCCC 2006, Oradea, Romania, June 2006},
pages={222--227}
}
@inproceedings{Cavaliere:WMC5:Time_Independent_P_S:LNCS:2005,
author={Matteo Cavaliere and Dragos Sburlan},
title={Time-independent {P} systems},
booktitle={Membrane Computing. International Workshop WMC5, Milano, Italy, 2004 (TO
APPEAR)},
editor={Giancarlo Mauri and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa}
}
@inproceedings{Krishna:WMC5:traces,
author={Shankara-Narayanan Krishna},
title={{P} systems with symport/antiport: The traces of {RBCs}},
booktitle={Membrane Computing. International Workshop WMC5, Milano, Italy, 2004, LNCS,
Springer, 2005 (TO APPEAR)},
editor={Giancarlo Mauri and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa}
}
@inproceedings{Manca:PreWMP:Monoidal_Systems_and:U,
author={Vincenzo Manca},
title={Monoidal Systems and Membrane Systems},
booktitle={Pre-proceedings of Workshop on Multiset Processing},
address={Curtea de Arges, Romania}
}
@inproceedings{Manca:WMC5:Evolution_Oscilation:LNCS:2005,
author={Vincenzo Manca and Luca Bianco and Federico Fontana},
title={Evolution and oscillation in {P} systems: Applications to biological phenomena},
booktitle={Membrane Computing, International Workshop, WMC5, Milano, Italy, 2004, Selected
Papers (G. Mauri, Gh. Paun, M.J. Perez-Jimenez, G. Rozenberg, A. Salomaa,
eds.), LNCS, Springer-Verlag, Berlin, 2005, to appear},
editor={Giancarlo Mauri and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Grzegorz
Rozenberg and Arto Salomaa}
}
@inproceedings{Paun:WIA99:Multiset_Processing_:99,
author={Gheorghe P{\u a}un and Gabriel Thierrin},
title={Multiset Processing by Means of Systems of Finite State Transducers},
booktitle={Pre-Proceedings of Workshop on Implementing Automata WIA99},
year={1999},
month={August},
address={Potsdam}
}
@inproceedings{Paun:PreIM_DNA1999:Membrane_Computing_B:99,
author={Gheorghe P{\u a}un and Takashi Yokomori},
title={Membrane Computing Based on Splicing},
booktitle={Preliminary Proceedings of Fifth International Meeting on DNA Based Computers},
year={1999},
month={June},
editor={E. Winfree and D. Gifford},
pages={213--227},
organization={MIT}
}
@inproceedings{Petre:FCT99:Mobile_Ambients_and_:99,
author={Ion Petre and Luigia Petre},
title={Mobile Ambients and {P} systems},
booktitle={Workshop on Formal Languages, FCT99, Iasi},
year={1999}
}
@inproceedings{Freund:FCT99:Generalized_P_Systems_With:99,
author={Rudolf Freund},
title={Generalized {P} systems with Splicing and Cutting/Recombination},
booktitle={Workshop on Formal Languages, FCT99, Iasi},
year={1999}
}
@inproceedings{Freund:FCT99:Generalized_P_System:99,
author={Rudolf Freund},
title={Generalized {P} systems},
booktitle={Fundamentals of Computation Theory, FCT'99, Iasi, 1999},
year={1999},
publisher={Springer-Verlag},
address={Berlin},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un},
pages={281--292},
series={Lecture Notes in Computer Science},
volume={1684?}
}
@inproceedings{Paun:UMC2000:On_P_Systems_with_Ac:00,
author={Andrei Paun},
title={On {P} systems with Active Membranes},
booktitle={Unconventional Models of Computation},
year={2000},
month={February},
publisher={Springer-Verlag},
address={London},
editor={I. Antoniou and Cristian Calude and M.J. Dinneen},
pages={187--201},
note={Contributed paper}
}
@inproceedings{Martin:ASFLCW2000:String-Objects_in_P_:00,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={String-Objects in {P} systems},
booktitle={Proc. of Algebraic Systems, Formal Languages and Computations Workshop},
year={2000},
address={Kyoto},
pages={161--169},
organization={RIMS Kokyuroku, Kyoto Univ.}
}
@inproceedings{Martin:UMC2000:P_Systems_with_Valua:00,
author={Carlos Mart{\'i}n-Vide and Victor Mitrana},
title={{P} systems with Valuations},
booktitle={Unconventional Models of Computation},
year={2000},
month={February},
publisher={Springer-Verlag},
address={London},
editor={I. Antoniou and Cristian Calude and M.J. Dinneen},
pages={154--166},
note={Contributed paper}
}
@inproceedings{Zandron:UMC2000:Solving_NP-Complete_:00,
author={Claudio Zandron and Claudio Ferretti and Giancarlo Mauri},
title={Solving {NP}-Complete Problems Using {P} systems with Active Membranes},
booktitle={Unconventional Models of Computation},
year={2000},
month={February},
publisher={Springer-Verlag},
address={London},
editor={I. Antoniou and Cristian Calude and M.J. Dinneen},
pages={289--301},
note={Contributed paper}
}
@inproceedings{Zandron:WGS2000:Universality_and_Nor:00,
author={Claudio Zandron and Giancarlo Mauri and Claudio Ferretti},
title={Universality and Normal Forms on Membrane Systems},
booktitle={Proc. Intern. Workshop Grammar Systems 2000},
year={2000},
month={July},
address={Bad Ischl, Austria},
editor={Rudolf Freund and Alica Kelemenova},
pages={61--74}
}
@inproceedings{Paun:UMC2000:Computing_with_Membr:00,
author={Gheorghe P{\u a}un},
title={Computing with Membranes: Attacking {NP}-Complete Problems},
booktitle={Unconventional Models of Computation},
year={2000},
month={February},
publisher={Springer-Verlag},
address={London},
editor={I. Antoniou and Cristian Calude and M.J. Dinneen},
pages={94--115},
note={Invited paper}
}
@inproceedings{Paun:WNCP2000:On_the_Generative_Po:00,
author={Gheorghe P{\u a}un},
title={On the Generative Power of {P} systems},
booktitle={Theorietag 2000. Workshop on New Computing Paradigms},
year={2000},
editor={Rudolf Freund},
pages={59--78},
organization={TU University Vienna}
}
@inproceedings{Paun:WGS2000:From_Cells_to_Comput:00,
author={Gheorghe P{\u a}un},
title={From Cells to Computers: Computing with Membranes ({P} systems)},
booktitle={Proc. Intern. Workshop Grammar Systems 2000},
year={2000},
month={July},
address={Bad Ischl, Austria},
editor={Rudolf Freund and Alica Kelemenova},
pages={9--40}
}
@inproceedings{Castel:SPIRE_2000:P_Systems_with_Worm-:00,
author={Juan Castellanos and Gheorghe P{\u a}un and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title={{P} systems with Worm-Objects},
booktitle={Proceedings of the Seventh International Symposium on String Processing
Information Retrieval (SPIRE'00)},
year={2000},
month={September},
publisher={IEEE Computer Society},
address={A Coru{\~n}a, Spain},
pages={64--74},
abstract={We consider a combination of P systems with objects described by symbols
with P systems with objects described by strings. Namely, we work with
multisets of strings and consider as the result of a computation the number
of strings in a given output membrane. The strings (also called worms)
are processed by replication, splitting, mutation, and recombination; no
priority among rules and no other ingredient is used. In these circumstances,
it is proved that: (1) P systems of this type can generate all recursively
enumerable sets of numbers; and moreover, (2) the Hamiltonian Path Problem
in a directed graph can be solved in quadratic time, while the SAT problem
can be solved in linear time. The interest of the latter result comes from
the fact that it is the first time that a polynomial solution to an NP-complete
problem has been obtained in the P system framework without making use
of the (non-realistic) operation of membrane division.}
}
@inproceedings{Kudlek:PreWMP:Toward_FMT_(Formal_M:U,
author={Manfred Kudlek and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Toward {FMT} (Formal Macroset Theory)},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Malita:PreWMP:Membrane_Computing_i:U,
author={Mihaela Malita},
title={Membrane Computing in {Prolog}},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Frisco:PreWMP:Membrane_Computing_B:U,
author={Pierluigi Frisco},
title={Membrane Computing Based on Splicing: Improvements},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Rama:PreWMP:Computing_with_P_Sys:U,
author={Raghavan Rama},
title={Computing with {P} systems},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Freund:WNCP2000:Sequential_P_Systems:00,
author={Rudolf Freund},
title={Sequential {P} systems},
booktitle={Theorietag 2000. Workshop on New Computing Paradigms},
year={2000},
editor={Rudolf Freund},
pages={177--183},
organization={TU University Vienna}
}
@inproceedings{Freund:DNA62000:Molecular_Computing_:00,
author={Rudolf Freund and Franziska Freund},
title={Molecular Computing with Generalized Homogeneous {P} systems},
booktitle={Proc. Conf. DNA6},
year={2000},
address={Leiden},
editor={Anne Condon and Grzegorz Rozenberg},
pages={113--125}
}
@inproceedings{NKri:PreWMP:Computing_with_Simpl:U,
author={Shankara-Narayanan Krishna},
title={Computing with Simple {P} systems},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Suzuki:PreWMP:Artificial_Life_and_:U,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Artificial Life and {P} systems},
booktitle={Pre-Proceedings Workshop on Multiset Processing},
year={2000},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Suzuki:GECCO2000:A_New_Molecular_Comp:00,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={A New Molecular Computing Model, Artificial Cell Systems},
booktitle={Genetic and Evolutionary Computation Conf. GECCO},
year={2000},
publisher={Morgan Kaufman},
pages={833--840}
}
@inproceedings{Suzuki:CEC2000:Computational_Living:00,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Computational Living Systems Based on an Abstract Chemical System},
booktitle={Proc. CEC2000},
year={2000},
publisher={IEEE},
pages={1369--1376}
}
@inproceedings{Suzuki:SAB2000:Adaptive_Behavior:2000,
author={Yasuhiro Suzuki and Junji Takabayashi and Hiroshi Tanaka},
title={Adaptive Behavior in a Tritrophic Interactions Consisting of Plants, Herbivors
and Carnivores},
booktitle={The Sixth International Conference on the Simulation of Adaptive Behavior
(SAB2000) September 11-15 2000, Paris, France},
year={2000},
month={September}
}
@inproceedings{Obtulo:MP2001:On_P_Systems_with_Ac:01,
author={Adam Obtulowicz},
title={On {P} systems with Active Membranes Solving Integer Factorizing Problem
in a Polynomial Time},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={267--286},
abstract={There are presented deterministic P systems with active membranes which
are able to solve the Integer Factorization Problem in a polynomial time,
which is the main result of the paper. There is introduced a class of programs
for the description and correct implementation of algorithms of elementary
number theory in nonstandard computing systems, especially in P systems
with active membranes. By using some of these programs there is achieved
the main result.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Atanas:PreWMC2001:Recursive_Calculus_w:01,
author={Adrian Atanasiu and Carlos Mart{\'i}n-Vide},
title={Recursive Calculus with Membranes},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Dovier:MP2001:Multiset_Constraints:01,
author={Agostino Dovier and Carla Piazza and Gianfranco Rossi},
title={Multiset Constraints and {P} systems},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={103--122},
abstract={Multisets are the fundamental data structure of P systems. In this paper
we relate P systems with the language and theory for multisets presented
in [9.] This allows us, on the one hand, to define and implement P systems
using multiset constraints in a constraint logic programming framework,
and, on the other hand, to define and implement constraint solving procedures
used to test multiset constraint satisfiability in terms of P systems with
active membranes. While the former can be exploited to provide a precise
formulation of a P system, as well as a working implementation of it, based
on a first-order theory, the latter provides a way to obtain a P system
for a given problem (in particular, NP problems) starting from a rather
natural encoding of its solution in terms of multiset constraints.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Paun:MDNABC2001:On_P_Systems_with_Gl:01,
author={Andrei Paun},
title={On {P} systems with Global Rules},
booktitle={Proc. 7th Intern. Meeting on DNA Based Computers},
year={2001},
address={Tampa, Florida, USA},
editor={Natasha Jonoska and N.C. Seeman},
pages={43--52}
}
@inproceedings{Paun:PreWMC2001:P_Systems_with_Strin:01,
author={Andrei Paun},
title={{P} systems with String-Objects: Universality Results},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{VBar:ECAL2001:Bio-Language_for_Com:01,
author={Angel V. Baranda and Juan Castellanos and Fernando Arroyo and Carmen Luengo},
title={Bio-Language for Computing with Membranes},
booktitle={Advances in Artificial Life : 6th European Conference, ECAL 2001, Prague,
Czech Republic, September 10-14, 2001, Proceedings.},
year={2001},
month={September},
publisher={Springer-Verlag},
address={Praga},
editor={Jozef Kelemen and Petr Sosik},
pages={176--185},
abstract={This paper presents a bio-language that integrates data structures and processes
for a formal computational model from the field of computing with membranes.
A bio-language is a new concept extracted from biological behaviour. In
order to define such a bio-language, the static and dynamic structures
of a Transition P system are formalised.},
series={LNAI},
volume={2159}
}
@inproceedings{VBar:MDNABC2001:Towards_an_Electroni:01,
author={Angel V. Baranda and Juan Castellanos and Fernando Arroyo and Rafael Gonzalo},
title={Towards an Electronic Implementation of Membrane Computing: A Formal Description
of Nondeterministic Evolution in Transition {P} systems},
booktitle={Proc. 7th Intern. Meeting on DNA Based Computers},
year={2001},
address={Tampa, Florida, USA},
editor={Natasha Jonoska and N.C. Seeman},
pages={273--282}
}
@inproceedings{Martin:MCU2001:Computing_with_Membr:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Computing with Membranes ({P} systems): Universality Results},
booktitle={Machines, Computations, and Universality. Third International Conference,
MCU 2001 Chisinau, Moldava, May 23-27, 2001. Proceedings.},
year={2001},
publisher={Springer-Verlag},
address={Chisinau, Moldova},
editor={Maurice Margenstern and Yurii Rogozhin},
pages={82--101},
abstract={This is a survey of universality results in the area of Membrane Computing
(P systems), at the level of December 2001. We consider both P systems
with symbol-objects and with string-objects; in the latter case, we consider
systems based on rewriting, splicing, as well as rewriting together with
other operations (replication, crossingover), with sets or with multisets
of strings. Besides recalling characterizations of recursively enumerable
languages and of recursively enumerable sets of vectors of natural numbers,
we also briefly discuss the techniques used in the proofs of such results.
Several open problems are also formulated.},
series={Lecture Notes in Computer Science},
volume={2055}
}
@inproceedings{Ferret:PreWMC2001:On_Three_Variants_of:01,
author={Claudio Ferretti and Giancarlo Mauri and Gheorghe P{\u a}un and Claudio
Zandron},
title={On Three Variants of {P} systems with String-Objects},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Zandron:MCU2001:Two_Normal_Forms_for:01,
author={Claudio Zandron and Claudio Ferretti and Giancarlo Mauri},
title={Two Normal Forms for Rewriting {P} systems},
booktitle={Machines, Computations, and Universality. Third International Conference,
MCU 2001 Chisinau, Moldava, May 23-27, 2001. Proceedings.},
year={2001},
publisher={Springer-Verlag},
address={Chisinau, Moldova},
editor={Maurice Margenstern and Yurii Rogozhin},
pages={153--164},
abstract={P systems have been recently introduced by Gh. Paun as a new model for molecular
computations based on the notion of membrane structure. In this work, we
consider Rewriting P Systems which use electrical charges to move objects
between the membranes. We show that electrical charges, a feature introduced
in order to obtain more �realistic� systems, induces simple systems: we
define two normal forms for two variants of Rewriting P Systems which make
use of electrical charges.},
series={Lecture Notes in Computer Science},
volume={2055}
}
@inproceedings{Nico:PreWMC2001:A_C_Library_for_Im:01,
author={Dan V. Nicolau-Jr. and Gerardin Solana and Florin Fulga and Dan V. Nicolau-Sr.},
title={A {C} Library for Implementing {P} systems on the Electronic Computer ({A}bstract)},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Besozz:ICTCS2001:P_Systems_with_Gemma:01,
author={Daniela Besozzi and Claudio Zandron and Giancarlo Mauri and N. Sabadini},
title={{P} systems with Gemmation of Mobile Membranes},
booktitle={Theoretical Computer Science. 7th Italian Conference, ICTCS 2001, Torino,
Italy, October 4-6, 2001. Proceedings.},
year={2001},
month={October},
publisher={Springer-Verlag},
address={Turin},
editor={Antonio Restivo and Simona Ronchi-Della-Rocca and Luca Roversi},
pages={136--153},
abstract={P systems are computational models inspired by some biological features
of the structure and the functioning of real cells. In this paper we introduce
a new kind of communication between membranes, based upon the natural budding
of vesicles in a cell. We define the operations of gemmation and fusion
of mobile membranes, and we use membrane structures and rules over strings
of biological inspiration only. We prove that P systems of this type can
generate all recursively enumerable languages and, moreover, the Hamiltonian
Path Problem can be solved in a quadratic time. Some open problems are
also formulated.},
series={Lecture Notes in Computer Science},
volume={2202}
}
@inproceedings{Arroyo:PreWMC2001:A_Recursive_Algorith:01,
author={Fernando Arroyo and Angel V. Baranda and Juan Castellanos and Carmen Luengo
and Luis F. Mingo},
title={A Recursive Algorithm for Describing Evolution in Transition {P} systems},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Arroyo:MP2001:Structures_and_Bio-L:01,
author={Fernando Arroyo and Angel V. Baranda and Juan Castellanos and Carmen Luengo
and Luis F. Mingo},
title={Structures and Bio-Language to Simulate Transition {P} systems on Digital
Computers},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={1--16},
abstract={The aim of this paper is to show that some computational models inspired
from biological membranes, such as P systems, can be simulated on digital
computers in an efficient manner. To this aim, it is necessary to characterize
non-determinism and parallel execution of evolution rules inside regions.
Both these issues are formally described here in order to obtain a feasible
description in terms of data structures and operations able to be implemented
in a functional programming language. Static and dynamic structures of
transition P systems are formalised in order to define a bio-language to
represent them. Finally, a draft of a language for describing a transition
P systems is presented. It will facilitate the description of transition
P systems in terms of sentences in a high level programming language; such
sentences will define a program. A process of compilation will parse the
program to appropriate data structures and will launch the execution of
the simulation process.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Cioban:PreWMC2001:Gene_Expression_by_S:01,
author={Gabriel Ciobanu and Bogdan Tanasa},
title={Gene Expression by Software Mechanisms},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Cioban:PreWMC2001:Membrane_SoftwareA:01,
author={Gabriel Ciobanu and Dorin Paraschiv},
title={Membrane Software. {A} {P} system Simulator},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Paun:PreWMC2001:Further_Research_Top:01,
author={Gheorghe P{\u a}un},
title={Further Research Topics About {P} systems},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{LGia:PreWMC2001:MGS:_Implementing_a_:01,
author={Jean-Louis Giavitto and Olivier Michel},
title={{MGS}: Implementing a Unified View on Four Biologically Inspired Computing
Models},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Aguado:PreWMC2001:P_Systems_with_Repli:01,
author={Joaqu{\'i}n Aguado and Tudor Balanescu and Tony Cowling and Marian Gheorghe
and Florentin Ipate},
title={{P} systems with Replicated Rewriting and Stream {X-Machines}},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Mate:PreWMC2001:On_the_Power_of_P_Sy:01,
author={Jos{\'e} L. Mat{\'e} and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s Silva},
title={On the Power of {P} systems with {DNA-Worms}},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Mutyam:MCU2001:membrane_creation:2001,
author={Madhu Mutyam and Kamala Krithivasan},
title={P Systems with Membrane Creation: Universality and Efficiency},
booktitle={Machines, Computations, and Universality: Third International Conference,
MCU 2001 Chisinau, Moldavia, May 23-27, 2001, Proceedings},
year={2001},
month={May 23-27},
publisher={Springer-Verlag Heidelberg},
editor={M. Margenstern, Y. Rogozhin},
pages={276--287},
abstract={P systems, introduced by Gh. Paun form a new class of distributed computing
model. Several variants of P systems were already shown to be computationally
universal. In this paper, we propose a new variant of P systems, P systems
with membrane creation, in which some objects are productive and create
membranes. This new variant of P systems is capable of solving the Hamiltonian
Path Problem in linear time. We show that P systems with membrane creation
are computationally complete.},
series={Lecture Notes In Computer Science},
volume={2055}
}
@inproceedings{Kudlek:MP2001:Toward_a_Formal_Macr:01,
author={Manfred Kudlek and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Toward a Formal Macroset Theory},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={123--134},
abstract={A macroset is a (finite or infinite) set of multisets over a finite alphabet.
We introduce a Chomsky-like hierarchy of multiset rewriting devices which,
therefore, generate macrosets. Some results are proved about the power
of these devices and some open problems are formulated. We also present
an algebraic characterization of some of the macroset families as least
fixed point solutions of algebraic systems of equations.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Gheorg:IPCAT2001:Computational_models:01,
author={Marian Gheorghe and Mike Holcombe and Petros Kefalas},
title={Computational models of collective foraging},
booktitle={Proc. Fourth Intern. Workshop on Information Processing in IPCAT 2001, Cells
and Tissues},
year={2001},
month={August},
address={Brussels}
}
@inproceedings{Margen:MDNABC2001:Computing_with_Membr:01,
author={Maurice Margenstern and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Computing with Membranes, Variants with an Enhanced Membrane Handling},
booktitle={Proc. 7th Intern. Meeting on DNA Based Computers},
year={2001},
address={Tampa, Florida, USA},
editor={Natasha Jonoska and N.C. Seeman},
pages={53--62}
}
@inproceedings{Margenstern:7DNABC:Enhanced_Membrane_Handling:2001,
author={Maurice Margenstern and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Computing with Membranes: Variants with an Enhanced Membrane Handling},
booktitle={Proceedings 7th International Meeting on DNA Based Computers},
year={2001},
month={June 10-13},
address={Tampa, Florida, USA},
editor={N. Jonoska, N.C. Seeman},
pages={53--62}
}
@inproceedings{Holcom:IPCAT2001:A_hybrid_machine_mod:01,
author={Mike Holcombe and Lucy Holcombe and Marian Gheorghe and N. Talbot},
title={A hybrid machine model of rice blast fungus Magnaporthe grisea},
booktitle={Proc. Fourth Intern. Workshop on Information Processing in IPCAT 2001, Cells
and Tissues},
year={2001},
month={August},
address={Brussels}
}
@inproceedings{Madhu_:MP2001:Universality_Results:01,
author={Mutyam Madhu and Kamala Krithivasan},
title={Universality Results for Some Variants of {P} systems},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
address={Berlin},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={237--253},
abstract={P systems, introduced by Gh. Paun, form a new class of distributed computing
models. Many variants of P systems were shown to be computationally universal.
In this paper, we consider several classes of P systems with symbol-objects
where we allow the catalysts to move in and out of a membrane. We prove
universality results for these variants of P systems with a very small
number of membranes.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Madhu_:MCU2001:P_Systems_with_Membr:01,
author={Mutyam Madhu and Kamala Krithivasan},
title={{P} systems with Membrane Creation: Universality and Efficiency},
booktitle={Machines, Computations, and Universality. Third International Conference,
MCU 2001 Chisinau, Moldava, May 23-27, 2001. Proceedings.},
year={2001},
publisher={Springer-Verlag},
address={Berlin},
editor={Maurice Margenstern and Yurii Rogozhin},
pages={276--287},
abstract={P systems, introduced by Gh. Paun form a new class of distributed computing
model. Several variants of P systems were already shown to be computationally
universal. In this paper, we propose a new variant of P systems, P systems
with membrane creation, in which some objects are productive and create
membranes. This new variant of P systems is capable of solving the Hamiltonian
Path Problem in linear time. We show that P systems with membrane creation
are computationally complete.},
series={Lecture Notes in Computer Science},
volume={2055}
}
@inproceedings{Sosik:CDLT2001:String_Rewriting_Seq:01,
author={Petr Sosik and Rudolf Freund},
title={String Rewriting Sequential {P} systems and Regulated Rewriting},
booktitle={Proc. Conf. Developments in Language Theory},
year={2001},
address={Vienna}
}
@inproceedings{Frisco:PreWMC2001:A_Direct_Constructio:01,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom and Paul Sant},
title={A Direct Construction of a Universal {P} system},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Freund:DNA6:Generalized_Homogeneous:2001,
author={Rudolf Freund and Franziska Freund},
title={Molecular Computing with Generalized Homogeneous {P}-Systems},
booktitle={DNA Computing: 6th International Workshop on DNA-Based Computers, DNA 2000,
Leiden, The Netherlands, June 13-17, 2000, Revised Papers},
year={2001},
month={June},
publisher={Springer-Verlag Heidelberg},
address={Leiden, The Netherlads},
editor={A. Condon and G. Rozenberg},
pages={113--125},
abstract={Recently P-systems were introduced by Gheorghe Paun as a new model for computations
based on membrane structures. The basic variants of P-systems shown to
have universal computational power only took account of the multiplicities
of atomic objects, some other variants considered rewriting rules on strings.
Using the membranes as a kind of filter for specific objects when transferring
them into an inner compartment or out into the surrounding compartment
turned out to be a very powerful mechanism in combination with suitable
rules to be applied within the membranes in the model of generalized P-systems,
GP-systems for short. GP-systems were shown to allow for the simulation
of graph controlled grammars of arbitrary type based on productions working
on single objects; moreover, various variants of GP-systems using splicing
or cutting and recombination of strings were shown to have universal computational
power, too. In this paper, we consider GP-systems with homogeneous membrane
structures, GhP-systems for short, using splicing or cutting and recombination
of string objects with specific markers at the ends of the strings that
can be interpreted as electrical charges. The sum of these electrical charges
determines the permeability of the membranes to the string objects, and
we allow only objects with the absolute value of the difference of electrical
charges being equal to 1 to pass a membrane in both directions. We show
that such GhP-systems have universal computational power; for GhP-systems
using splicing and a bounded number of markers the obtained results are
optimal with respect to the underlying membrane structure. Moreover, a
very restricted variant of such GhP-systems characterizes the (strictly)
minimal linear languages.},
series={Lecture Notes In Computer Science},
volume={2054}
}
@inproceedings{Freund:PreWMC2001:Variants_of_GP_Syste:01,
author={Rudolf Freund and Marion Oswald},
title={Variants of {GP Systems}},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Kris:PreWMC2001:On_the_Power_of_P_Sy:01,
author={Shankara-Narayanan Krishna and Kuppuswamy Lakshmanan and Raghavan Rama},
title={On the Power of {P} systems with Contextual Rules},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Kris:MDNABC2001:Insertion-Deletion_P:01,
author={Shankara-Narayanan Krishna and Raghavan Rama},
title={Insertion-Deletion {P} systems},
booktitle={Proc. 7th Intern. Meeting on DNA Based Computers},
year={2001},
address={Tampa, Florida, USA},
editor={Natasha Jonoska and N.C. Seeman},
pages={350--359}
}
@inproceedings{Marcus:PreWMC2001:Membranes_versus_DNA:01,
author={Solomon Marcus},
title={Membranes versus {DNA}},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Ji:PreWMC2001:The_Bhopalator:_An_I:01,
author={Sungchul Ji},
title={The {Bhopalator}: An Information/Energy Dual Model of the Living Cell},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Nish:PreWMC2001:Simulations_of_Photo:01,
author={Taishin Yasunobu Nishida},
title={Simulations of Photosynthesis by a {K}-{S}ubset Transforming System with
Membranes},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Manca:PreWMC2001:Membrane_Algorithms_:01,
author={Vincenzo Manca},
title={Membrane Algorithms for Propositional Satisfiability},
booktitle={Pre-Proceedings of Workshop on Membrane Computing},
year={2001},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Suzuki:MP2001:Artificial_Life_Appl:01,
author={Yasuhiro Suzuki and Yoshi Fujiwara and Hiroshi Tanaka and Junji Takabayashi},
title={Artificial Life Applications of a Class of {P} systems: Abstract Rewriting
Systems on Multisets},
booktitle={Multiset Processing: Mathematical, Computer Science, and Molecular Computing
Points of View},
year={2001},
publisher={Springer-Verlag},
address={Berlin},
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
pages={299--346},
abstract={Artificial chemical system are well studied in Artificial Life and Complexity.
Here we overview results about such a class of artificial chemical systems:
Rewriting Systems on Multisets (ARMS), which are particular types of P
Systems and exhibit complex behaviors such as non-linear oscillations.
In short, an ARMS consists of a membrane which contains �chemical compounds�
(denoted by symbols); these compounds evolve through chemical reactions
in a cell-like device. To such systems we apply a genetic method and, by
a simulation on computer, we find several results of Artificial Life interest.},
series={Lecture Notes in Computer Science},
volume={2235}
}
@inproceedings{Obtulo:Pre2WMC2002:Probabilistic_P_syst:02,
author={Adam Obtulowicz},
title={Probabilistic {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Atanas:Pre2WMC2002:Authentication_of_me:02,
author={Adrian Atanasiu},
title={Authentication of messages using {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Romero:UMC02:Diophantine:2002,
author={Alvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Generation of Diophantine Sets by Computing P Systems with External Output},
booktitle={Unconventional Models of Computation: Third International Conference, UMC
2002, Kobe, Japan, October 15-19, 2002. Proceedings},
year={2002},
month={October 15--19},
publisher={Springer-Verlag Heidelberg},
address={London, UK},
editor={Cristian Calude and Michael J. Dinneen and Ferdinand Peper},
pages={176--190},
abstract={In this paper a variant of P systems with external output designed to compute
functions on natural numbers is presented. These P systems are stable under
composition and iteration of functions. We prove that every diophantine
set can be generated by such P systems; then, the universality of this
model can be deduced from the theorem by Matiyasevich, Robinson, Davis
and Putnam in which they establish that every recursively enumerable set
is a diophantine set.},
series={Lecture Notes In Computer Science},
volume={2509}
}
@inproceedings{Paun:Pre2WMC2002:Membrane_systems_wit:02,
author={Andrei Paun},
title={Membrane systems with symport/antiport. {Universality} results},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Profir:Pre2WMC2002:P_systems_of_biocomp:02,
author={Aurelia Profir and Elena Boian},
title={{P} systems of biocomputing systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Besozz:Pre2WMC2002:Parallel_rewritint_P:02,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Parallel rewritint {P} systems without target conflicts},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Balbot:Pre2WMC2002:A_MzScheme_implement:02,
author={Delia Balbotin-Noval and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={A {MzScheme} implementation of transition {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Csuhaj:Pre2WMC2002:P_Automata:02,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil},
title={{P Automata}},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Czeizl:Pre2WMC2002:Self-activating_P_sy:02,
author={Eugen Czeizler},
title={Self-activating {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Arroyo:Pre2WMC2002:A_software_simulatio:02,
author={Fernando Arroyo and Carmen Luengo and Angel V. Baranda and L.F. de Mingo},
title={A software simulation of transition {P} systems in {H}askell},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Bernar:Pre2WMC2002:P_systems_with_bound:02,
author={Francesco Bernardini and Vincenzo Manca},
title={{P} systems with boundary rules},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Cioban:Pre2WMC2002:Molecular_Networks_a:02,
author={Gabriel Ciobanu and Bogdan Tanasa and Daniel Dumitriu and Dorin Huzum and
Gabriel Moruz},
title={Molecular Networks as Communicating Membranes},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Cioban:Pre2WMC2002:Membrane_systems_and:02,
author={Gabriel Ciobanu and Rahul Desai and Akash Kumar},
title={Membrane systems and distributed computing},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Bel_En:Pre2WMC2002:P_systems_a_prelimi:02,
author={Gemma Bel-Enguix},
title={{P} systems, a preliminary application to linguistics},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Bel_En:Pre2WMC2002:Generating_context-f:02,
author={Gemma Bel-Enguix and Matteo Cavaliere and Rodica Ceterchi and Carlos Mart{\'i}n-Vide},
title={Generating context-free languages with dynamic {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Alford:Pre2WMC2002:Membrane_systems_wit:02,
author={Gordon Alford},
title={Membrane systems with heat control},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Ardele:Pre2WMC2002:The_relevance_of_mic:02,
author={Ioan I. Ardelean},
title={The relevance of microbiology for {P} systems. A discussion of some concepts
used in microbiology and {P Systems}},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Bartosik:Systemy_Mem:PEIZ:2002,
author={J. Bartosik and Waldemar Korczynski},
title={Systemy membranowe jako modele hierarchicznych struktur zarzadzania},
booktitle={Mat. Pokonferencyjne Ekonomia, Informatyka, Zarzadzanie. Teoria i Praktyka},
year={2002},
organization={Wydzial Zarzadzania AGH, Tom II, AGH}
}
@inproceedings{LGia:Pre2WMC2002:Accretive_rules_in_C:02,
author={Jean-Louis Giavitto and Olivier Michel},
title={Accretive rules in {Cayley} {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Arulanandham:UMC02:Bead_Sort:2002,
author={Joshua J. Arulanandham},
title={Implementing Bead-Sort with {P} systems},
booktitle={Unconventional Models of Computation: Third International Conference, UMC
2002, Kobe, Japan, October 15-19, 2002. Proceedings},
year={2002},
month={October 15--19},
publisher={Springer-Verlag Heidelberg},
address={London, UK},
editor={Cristian Calude and Michael J. Dinneen and Ferdinand Peper},
pages={115--125},
abstract={In this paper, we implement Bead-Sort, a natural sorting algorithm that
we introduced in [1], with the new, biochemically inspired P systems. In
Bead-Sort, positive integers are represented by a set of beads (like those
used in an Abacus). The beads representing integers to be sorted are allowed
to slide through the rods of the Abacus. In this process, the smaller "numbers"
always emerge above the larger ones and this creates a natural comparison
and thus a natural sorting action. This natural sorting phenomenon is "implemented"
with a special type of P system -- a tissue P system that computes by means
of communication (using symport/antiport rules) only. Beads are represented
by objects placed within membranes of a tissue P system; a rod is represented
by a 'group' of membranes that can communicate with one another by means
of symport/antiport rules. The "flow" of objects between the group of membranes
representing a rod (using communication rules) reflects the actual flow
of beads in the physical system.},
series={Lecture Notes In Computer Science},
volume={2509}
}
@inproceedings{Kudlek:Pre2WMC2002:Some_Considerations_:02,
author={Manfred Kudlek and Victor Mitrana},
title={Some Considerations on a Multiset Model for Membrane Computing},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Pere:Pre2WMC2002:Decision_P_systems_a:02,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Decision {P} systems and the {P} $ \neq $ {NP} conjecture},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Ionesc:Pre2WMC2002:P_systems_with_sympo:02,
author={Mihai Ionescu and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={{P} systems with symport/antiport rules: The traces of objects},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Madhu:DCFS-2002:Complexity_Issues_in:02,
author={Mutyam Madhu},
title={Complexity Issues in Rewriting {P} systems},
booktitle={Pre-proceedings of Fourth International Workshop on Descriptional Complexity
of Formal Systems, DCFS-2002},
year={2002},
month={August 21-24},
address={London, Ontario, Canada}
}
@inproceedings{Madhu:Pre2WMC2002:A_Survey_on_Some_Var:02,
author={Mutyam Madhu and Kamala Krithivasan},
title={A Survey on Some Variants {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Botton:FNC2002:Rewriting_P_Systems_:02,
author={Paolo Bottoni and Anna Labella and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Rewriting {P} systems with Conditional Communication},
booktitle={Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg},
year={2002},
publisher={Springer-Verlag},
address={Berlin},
editor={W. Brauer and H. Ehrig and J. Karhum{\"a}ki and Arto Salomaa},
pages={325--353},
abstract={A membrane system (P system) is a model of computation inspired by some
basic features of the structure and behaviour of living cells. In this
paper we consider systems with string-objects processed by rewriting, with
the communication controlled by conditions on the contents of the strings.
Symbols, substrings (in an arbitrary place, or as a prefix/suffix), or
the shape of the whole string are used as permitting and as forbidding
conditions when moving strings from a membrane to a neighboring membrane.
Many of the obtained variants lead to new characterizations of recursively
enumerable languages (as expected, these characterizations indicate a trade-off
between the number of membranes and the strength of the communication conditions
used). Several open problems are also formulated.},
series={Lecture Notes in Computer Science},
volume={2300}
}
@inproceedings{Sosik:Pre2WMC2002:P_systems_versus_reg:02,
author={Petr Sosik},
title={{P} systems versus register machines: two universality proofs},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Sosik:UMC02:communication_enough:2002,
author={Petr Sos{\'i}k and Jir{\'i} Mat{\'y}sek},
title={Membrane computing: when communication is enough},
booktitle={Unconventional Models of Computation: Third International Conference, UMC
2002, Kobe, Japan, October 15-19, 2002. Proceedings},
year={2002},
month={October 15--19},
publisher={Springer-Verlag Heidelberg},
address={London, UK},
editor={Cristian Calude and Michael J. Dinneen and Ferdinand Peper},
pages={264--275},
abstract={We study the computational power of P system, the mathematical model of
cellular membrane systems whose operations are motivated by some principles
of regulated transfer of objects (molecules) through membranes and simple
mutual reactions of these objects. The original model of P system describes
several possible types of operations applicable to these objects, resulting
in universal computational power. We show that P systems with symbol objects
keep their universal computational power even if we restrict ourselves
to catalyzed transport of objects through labelled membranes without their
change or mutual reactions. Each transport operation is initiated by a
complex of at most two objects. Moreover we do not need some other mathematical
tools of P systems like priorities of operators or dissolution or creation
of membranes to reach the universal computational power. In the second
part of the paper we present a communicating P-system computing optimal
parallel algorithm for finding maximum of a given set of integers. We therefore
demonstrate that despite the simplicity of the model, it is (theoretically)
capable to solve nontrivial computing tasks in a highly parallel and effective
way.},
series={Lecture Notes In Computer Science},
volume={2509}
}
@inproceedings{Frisco:Pre2WMC2002:Simulating_counter_a:02,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom},
title={Simulating counter automata by {P} systems with symport/antiport},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Frisco:Pre2WMC2002:Towards_a_hierarchy_:02,
author={Pierluigi Frisco and Sungchul Ji},
title={Towards a hierarchy of info-energy {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Frisco:DNA82002:Info-energy_P_system:02,
author={Pierluigi Frisco and Sungchul Ji},
title={Info-energy {P} systems},
booktitle={Proceedings DNA 8 conference},
year={2002},
month={June},
address={Sapporo, Japan},
organization={Hokkaido University}
}
@inproceedings{Ceterc:Pre2WMC2002:Generating_P_systems:02,
author={Rodica Ceterchi and Carlos Mart{\'i}n-Vide},
title={Generating {P} systems with contextual grammar},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Freund:Pre2WMC2002:Energy-controlled_P_:02,
author={Rudolf Freund},
title={Energy-controlled {P} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Narayanan:UMC02:Minimal_mode:2002,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={On The Power of Tissue {P} systems Working in Minimal Mode},
booktitle={Unconventional Models of Computation: Third International Conference, UMC
2002, Kobe, Japan, October 15-19, 2002. Proceedings},
year={2002},
month={October 15--19},
publisher={Springer-Verlag Heidelberg},
address={London, UK},
editor={Cristian Calude and Michael J. Dinneen and Ferdinand Peper},
pages={208--219},
abstract={In this paper, we continue the study of tissue P systems ( systems) recently
introduced by C. MartinVide et.al in [5]. We consider here only systems
working in the minimal mode. All the results in this paper are solutions
to some of the open problems listed in [5] with respect to systems working
in the minimal mode. We obtain two characterizations of recursively enumerable
languages: systems having 2 cells and 3 states as well as systems having
4 cells and 2 states generate . We also show that 2 cells and 2 states
are sufficient for generating languages, whereas 3 cells and 2 states are
sufficient for generating languages.},
series={Lecture Notes In Computer Science},
volume={2509}
}
@inproceedings{Kris:Pre2WMC2002:Tissue_P_systems_wit:02,
author={Shankara-Narayanan Krishna and Kuppuswamy Lakshmanan and Raghavan Rama},
title={Tissue {P} systems with contextual and rewriting rules},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Balane:Pre2WMC2002:A_variant_of_EP_syst:02,
author={Tudor Balanescu and Marian Gheorghe and Mike Holcombe and Florentin Ipate},
title={A variant of {EP} systems},
booktitle={Pre-Proceedings of Second Workshop on Membrane Computing},
year={2002},
month={August},
address={Curtea de Arges, Romania}
}
@inproceedings{Obtulo:BWMC2003:Mathematical_Models_:03,
author={Adam Obtulowicz},
title={Mathematical Models of Uncertainty with a Regard to Membrane Systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={241--246}
}
@inproceedings{Obtulo:WMC-CdeA2002:Probabilistic_P_syst:03,
author={Adam Obtulowicz},
title={Probabilistic {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={377--387},
abstract={There are introduced and discussed stochastic and randomized P systems.
Stochastic P systems are aimed to describe distortions which may appear
in evolution processes of membrane systems considered in the area of membrane
computing. Randomized P systems serve for implementation of randomized
algorithms. There is presented a family of randomized P systems which serve
for implementation of Miller-Rabin randomized algorithm for primality of
integers. P systems of this family verify primality of integers in a polynomial
time, with a low error probability, and with a subexponential number of
processors modelled as membranes with evolving contents.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Atanas:WMC-CdeA2002:Authentication_of_me:03,
author={Adrian Atanasiu},
title={Authentication of messages using {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={33--42},
abstract={The paper is an attempt to use P systems in dealing with a cryptographic
issue, that of message authentication. Two algorithms are proposed, with
and without confirmation from the sender, based on P systems with active
membranes. We are not concerned with the practical usefulness of these
algorithms, but with proving the usefulness of the membrane computing framework
in addressing the authentication question.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Georgi:PreWMC2003:Generative_devices_u:03,
author={Alexandros Georgiou and Marian Gheorghe},
title={Generative devices used in graphics},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={266--272}
}
@inproceedings{Romero:PreWMC2003:Computing_partial_re:03,
author={Alvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Computing partial recursive functions through transition {P} systems},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={428--444}
}
@inproceedings{PerezJ:WMC2003:Computing_Partial_Re:03,
author={{\'A}lvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Computing Partial Recursive Functions by Transition {P} systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={320--340},
abstract={In this paper a variant of transition P systems with external output designed
to compute partial functions on natural numbers is presented. These P systems
are stable under composition, iteration and unbounded minimization (-recursion)
of functions. We prove that every partial recursive function can be computed
by such P systems, from which the computational completeness of this model
can be deduced.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Cordon:BWMC2003:A_Prolog_Simulator_f:03,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Fernando Sancho-Caparrini},
title={A {Prolog} Simulator for Deterministic {P} systems with Active Membranes},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={141--154}
}
@inproceedings{Cordon:WMC2003:Implementing_in_Prol:03,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Fernando Sancho-Caparrini},
title={Implementing in {Prolog} an Effective Cellular Solution to the {Knapsack}
Problem},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={140--152},
abstract={In this paper we present an implementation in Prolog of an effective solution
to the Knapsack problem via a family of deterministic P systems with active
membranes using 2-division.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Cordon:PreWMC2003:Implementing_in_Prol:03,
author = {Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Fernando Sancho-Caparrini},
title = {Implementing in {Prolog} an effective cellular solution for the {Knapsack},
problem},
booktitle = {Preproceedings of the Workshop on Membrane Computing},
year = {2003},
month = {July 17-22},
address = {Tarragona},
editor = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages = {185--196},
}
@inproceedings{PerezJ:BWMC2003:Formal_Verification_:03,
author={Antonio P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Formal Verification of a Transition {P} system Generating the Set $2^n+n^2+n
| n > 1$},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={261--269}
}
@inproceedings{PerezJ:BWMC2003:Computing_a_Partial_:03,
author={Antonio P{\'e}rez-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Computing a Partial Mapping by a {P} system: Design and Verification},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={247--260}
}
@inproceedings{Mamata:WMC2003:A_Distributed_Simula:03,
author={Apostolos Syropoulos and Eleftherios G. Mamatas and Peter C. Allilomes and
Konstantinos T. Sotiriades},
title={A Distributed Simulation of Transition {P} systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={357--368},
abstract={P systems is a new model of computation, inspired by natural processes,
that has a distributive nature. By exploring this distributive nature of
P systems, we have built a purely distributive simulation of P systems.
The simulation, whose implementation is described here, was programmed
in the Java programming language and makes heavy use of its Remote Method
Invocation protocol. The class of P systems that the simulator can accept
is a subset of the family of systems, which have the computational power
of Turing machines. The paper concludes with some remarks concerning the
usefulness of the simulation. In addition, there is a brief discussion
of some ideas that can be used in the formulation of a foundation of distributive
computing.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Alhazov:MinECP:BWMC2003,
author = {Artiom Alhazov},
title = {Minimizing Evolution-Communication {P} Systems and {EC} {P} Automata},
booktitle = {Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year = {2003},
month = {February 5-11},
address = {Tarragona, Spain},
editor = {Matteo Cavaliere and Carlos Mart{\'i}n-Vide and {\relax Gh}eorghe P{\u a}un},
pages = {23--31},
abstract = {Evolution-communication P systems is a variant of P systems
allowing both rewriting rules and symport/antiport rules.
The idea is to separate rewriting and communication
and this separation helps to obtain good generative capacity
even restricting both evolution and communicative rules.
The purpose of this paper is to solve an open problem stated in [1]
namely generating PsRE instead of NRE. The same construction also
reduces the 3-membrane non-cooperative case
and the 2-membrane 1-catalyst case to the 2-membrane
non-cooperative case. Here EC P automata are also introduced and it is
proved that 2-membrane EC P automata with a promoter can accept RE.},
eprint = {http://psystems.disco.unimib.it/download/rep26.zip},
url = {http://grlmc-dfilrom.urv.cat/grlmc/reports/rep26.html},
}
@inproceedings{Alhazov:GenClasses:BWMC2003,
author = {Artiom Alhazov},
title = {Generating Classes of Languages by {P} Systems and Other Devices},
booktitle = {Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year = {2003},
month = {February 5-11},
address = {Tarragona},
editor = {Matteo Cavaliere and Carlos Mart{\'i}n-Vide and {\relax Gh}eorghe P{\u a}un},
pages = {18--22},
abstract = {The purpose of this paper is to give a finite description of the
classes of languages (as opposed to the description of languages)
by a generative device, like a P system. The definition
of the generated class is inspired by the forbidding-enforcing systems.
A more general definition of generating a class of languages
by two devices is also given and some relationships between these
two definitions are studied.},
eprint = {http://psystems.disco.unimib.it/download/rep26.zip},
url = {http://grlmc-dfilrom.urv.cat/grlmc/reports/rep26.html},
}
@inproceedings{Alhazov.Sburlan:PSort:PreWMC2003,
author = {Artiom Alhazov and Drago{\c s} Sburlan},
title = {Static Sorting Algorithms for {P}~Systems},
booktitle = {Preproceedings of the Workshop on Membrane Computing},
year = {2003},
month = {July 17-22},
address = {Tarragona},
editor = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and {\relax Gh}eorghe P{\u a}un},
pages = {17--40},
abstract = {We explore here P Sorting. Traditional studies of sorting assume
a constant time for comparing two numbers and compute the time complexity
with respect to the number of components of a vector to be sorted. In this
paper we assume the number of components to be a fixed number k, and study
various algorithms with distinct generative features based on different models
of P systems, and their time complexity with respect to the maximal number
or to their sum. Massive parallel computations that can be realized within the
framework of P systems offer a premise to major improvements of the classical
integer sorting problems. Despite this important characteristic we will see
that, depending on the model used, the massive parallelism feature cannot
be always used, and so, some results will have the complexity ``comparable''
with the classical integer sorting algorithms. Still, computing an (ordered)
word from an (unordered) multiset can be a goal not only for computer science
but also, at least, for bio-synthesis (separating mixed objects
according to some characteristics). Here, we will pass from
ranking algorithms that, starting with numbers represented as multisets
produce symbols in an order, to effective sorting algorithms.},
eprint = {http://psystems.disco.unimib.it/download/WMC03.zip},
url = {http://grlmc-dfilrom.urv.cat/grlmc/reports/WMC03.html},
}
@inproceedings{Alhazov.Cavaliere:Proton:PostWMC2003:2004,
author = {Artiom Alhazov and Matteo Cavaliere},
title = {Proton Pumping {P}~Systems},
booktitle = {Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain
July, 17-22, 2003, Revised Papers},
year = {2004},
month = {July},
publisher = {Springer},
editor = {Carlos Mart{\'i}n-Vide and Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
series = {Lecture Notes in Computer Science},
volume = {2933},
pages = {1--18},
abstract = {We propose here a (biologically inspired) model of P system called proton
pumping P system that is a special case of evolution-communication P system.
In cell biology there are transport mechanisms, involving protons. We generalize
this idea by considering a few different types of protons. A proton pumping
P system is, essentially, an evolution-communication P system where a special
subset of symbol-objects (called protons) is used. In such a system we
have simple evolution rules (classical evolution rules without target indications)
symport and antiport rules that exchange some objects (among them, possibly
other protons) for a proton; taking inspiration from biology, this particular
type of antiports is often called proton pumping rules. We show that, as
expected, the new model is universal, using non-cooperative rules, symport
and antiport rules of weight one, and enough types of protons available
for the computation. If we decrease the number of types of protons to one
or two, then the model is at least as powerful as ET0L system, provided
that (total) weak or strong priority of antiport rules over symport and
evolution rules are used. Finally, we consider some descriptional complexity
measures (again, inspired from biology) for the newly introduced model.},
url = {http://www.springerlink.com/content/w034nr0qjnd0yd6c/},
}
@inproceedings{Alhazov.Cavaliere:PPump:PreWMC2003,
author = {Artiom Alhazov and Matteo Cavaliere},
title = {Proton Pumping {P}~Systems},
booktitle = {Preproceedings of the Workshop on Membrane Computing},
year = {2003},
month = {July 17-22},
address = {Tarragona},
editor = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and {\relax Gh}eorghe P{\u a}un},
pages = {1--16},
abstract = {We propose here a (biologically inspired) model of P system called
proton pumping P system that is a special case of evolution--communication
P system. In cell biology there are transport mechanisms, involving protons.
We generalize this idea by considering a few different types of protons. A
proton pumping P system is, essentially, an evolution--communication P system
where a special subset of symbol-objects (called protons) is used. In such a
system we have simple evolution rules (classical evolution rules without target
indications), symport and antiport rules that exchange some objects (among
them, possibly, other protons) for a proton; taking inspiration from biology
this particular type of antiports is often called proton pumping rules.
We show that, as expected, the new model is universal, using non-cooperative
rules, symport and antiport rules of weight one, and enough types of protons
available for the computation. If we decrease the number of types of protons to
one or two, then the model is at least as powerful as PsET0L, provided that
(total) weak or strong priority of antiport rules over symport and evolution
rules are used. Finally, we consider some descriptional complexity measures
(again, inspired from biology) for the newly introduced model.},
eprint = {http://psystems.disco.unimib.it/download/WMC03.zip},
url = {http://grlmc-dfilrom.urv.cat/grlmc/reports/WMC03.html},
}
@inproceedings{Profir:PreWMC2003:Modeling_molecular_g:03,
author={Aurelia Profir and Elena Boian},
title={Modeling molecular genetic triggers by means of {P} systems},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={365--386}
}
@inproceedings{Petres:PreWMC2003:A_hardware_membrane_:03,
author={Biljana Petreska and Christof Teuscher},
title={A hardware membrane system},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={343--355}
}
@inproceedings{Petreska:WMC2003:A_Reconfigurable_Har:03,
author={Biljana Petreska and Christof Teuscher},
title={A Reconfigurable Hardware Membrane System},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={269--285},
abstract={P systems are massively parallel systems and software simulations do no
usually allow to exploit this parallelism. We present a parallel hardware
implementation of a special class of membrane systems. The implementation
is based on a universal membrane hardware component that allows to efficiently
run membrane systems on specialized hardware such as FPGAs. The implementation
is presented in detail as well as performance results and an example.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Kevorchian:AIDC:2003,
author={C. Kevorchian},
title={An algebraic topology approach of membrane computing},
booktitle={Proc. AIDC'2003, Craiova, Romania.},
year={2003}
}
@inproceedings{Besozzi:DNA8:Parallel_Rewriting:2003,
author={Daniela Besozzi and Claudio Ferretti and Giancarlo Mauri and Claudio Zandron},
title={Parallel Rewriting {P} systems with deadlock},
booktitle={DNA Computing: 8th International Workshop on DNA-Based Computers, DNA8 Sapporo,
Japan, June 10-13, 2002. Revised Papers},
year={2003},
publisher={Springer-Verlag Heidelberg},
editor={Masami Hagiya and Azuma Ohuchi},
pages={302--314},
abstract={We analyze P systems with different parallel methods for string rewriting.
The notion of deadlock state is introduced when some rules with mixed target
indications are simultaneously applied on a common string. The computational
power of systems with and without deadlock is analyzed and a lower bound
for the generative power is given, for some parallelism methods. Some open
problems are also formulated.},
series={Lecture Notes In Computer Science},
volume={2568}
}
@inproceedings{Besozz:BWMC2003:Hierarchies_of_Paral:03,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Hierarchies of Parallel Rewriting {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={61--74}
}
@inproceedings{Besozz:WMC-CdeA2002:Parallel_rewritint_P:03,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Parallel rewriting {P} systems without target conflicts},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={119--133},
abstract={We consider rewriting P systems with parallel application of evolution rules,
where no conflicts on the communication of objects can arise. Different
parallelism methods are used and only rules which have the same target
indication can be simultaneously applied to a common string. The computational
power is analyzed, with respect to Lindenmayer systems, and some relations
among different parallel rewriting P systems are studied. Some open problems
are also formulated.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Besozzi:WMC2003:Collapsing_Hierarchi:03,
author={Daniela Besozzi and Giancarlo Mauri and Gy{\"o}rgy Vaszil and Claudio Zandron},
title={Collapsing Hierarchies of Parallel Rewriting {P} systems without Target
Conflicts},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={55--69},
abstract={We continue the investigation of parallel rewriting P systems without target
conflicts, a class of rewriting P systems with parallel application of
evolution rules where the possible consistency problems for the communication
of the resulting strings are eliminated by not allowing the application
of conflicting rules. We refine and improve some of the previously known
results about the generative power of these systems and point out the problems
which are still open for investigation. Work partially supported by contribution
of the EU commission under The Fifth Framework Programme, project MolCoNet
IST-2001-32008, and by contribution of the Hungarian Scientific Research
Fund, OTKA, grant no. F 037567.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Besozz:PreWMC2003:Collapsing_hierarchi:03,
author={Daniela Besozzi and Giancarlo Mauri and Gy{\"o}rgy Vaszil and Claudio Zandron},
title={Collapsing hierarchies of parallel rewriting {P} systems without target
conflicts},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={103--116}
}
@inproceedings{Besozz:EMCC2003:The_potential_of_P_s:03,
author={Daniela Besozzi and Ioan I. Ardelean and Giancarlo Mauri},
title={The potential of {P} systems for modelling the activity of mechanosensitive
channels},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Besozz:PreWMC2003:The_potential_of_P_s:03,
author={Daniela Besozzi and Ioan I. Ardelean and Giancarlo Mauri},
title={The potential of {P} systems for modelling the activity of mechanosensitive
channels},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={84--102}
}
@inproceedings{Balbot:WMC-CdeA2002:A_MzScheme_implement:03,
author={Delia Balbotin-Noval and Mario Jes{\'u}s P{\'e}rez Jim{\'e}nez and Fernando Sancho Caparrini},
title={A {MzScheme} implementation of transition {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={58--73},
abstract={The main goal of this paper is to present the design of an MzScheme program
that allows us to simulate the behavior of transition P systems. For that,
a library of procedures have been developed that work in two stages. In
the first one, the parsing/compiling stage, the input P system is checked,
and if it is well defined, then it is represented by means of an internal
grammar. In a second stage, the simulation, the computation tree associated
to the P system is generated until a prefixed level.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Jackson:WMC2003:An_Agent-Based_Behav:03,
author={Duncan Jackson and Marian Gheorghe and Mike Holcombe and Francesco Bernardini},
title={An Agent-Based Behavioural Model of Monomorium Pharaonis Colonies},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={232--239},
abstract={In this study X-machines and hierarchical organized X-machines will be used
to model different aspects of the behaviour of social insect communities.
The model is organized as a community of complex agents showing similarities
to networks of P systems.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Csuhaj:EMCC2003:On_Gemmating_P_Syste:03,
author={Erzs{\'e}bet Csuhaj-Varj{\'u}},
title={On Gemmating {P} systems},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Csuhaj:BWMC2003:From_Watson-Crick_L_:03,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and
Arto Salomaa},
title={From {W}atson-{C}rick {L} {Systems} to {Darwinian} {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={155--170}
}
@inproceedings{Csuhaj:WMC-CdeA2002:P_Automata_or_Purely:03,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil},
title={{P Automata} or Purely Communicating Accepting {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={219--233},
abstract={In this paper we introduce the notion of a P automaton with one-way communication,
a concept related both to P systems and the traditional concept of automata.
A P automaton with one-way communication is a purely communicating accepting
P system. The result of the computation in these systems is the set of
multiset sequences consumed by the skin membrane, supposing that the P
automaton started functioning in an initial state and entered a so-called
final state. As a result, we show that for any recursively enumerable language,
a P automaton and a certain type of projection can be constructed such
that the given language is obtained as the image of the set of accepted
input multiset sequences of the P automaton.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Csuhaj:EMCC2003:The_Computational_Co:03,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil},
title={The Computational Complexity of {P} Automata, Accepting {P} systems with
Communication Only},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Csuhaj:BWMC2003:New_Results_and_Rese:03,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil},
title={New Results and Research Directions Concerning {P Automata}, Accepting {P}
systems with Communication Only},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={171--179}
}
@inproceedings{Czeizl:WMC-CdeA2002:Self-activating_P_sy:03,
author={Eugen Czeizler},
title={Self-activating {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={234--246},
abstract={Until now, the solving of NP complete problems in polynomial time in the
framework of P systems was accomplished by the use of three different techniques:
the duplication of membranes, the creation of membranes, and the replication
of strings. In this paper we introduce a new type of P systems which comes
with a new technique of approaching this class of problems. In the initial
configuration of these P systems we have an arbitrarily large number of
unactivated base-membranes, which, in a polynomial time, are activated
in an exponential number. Using these type of systems we solve the SAT
problem in a linear time, with respect to the number of variables and clauses.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Arroyo:WMC-CdeA2002:A_software_simulatio:03,
author={Fernando Arroyo and Carmen Luengo and Angel V. Baranda and Luis F. de Mingo},
title={A software simulation of transition {P} systems in {H}askell},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={19--32},
abstract={P systems are a parallel and distributed computational mo-del, based on
the membrane structure notion. Membranes define regions. Inside regions,
objects and rules are placed in order to make evolve the P system. Evolution
is achieved by transitions between two consecutive system configurations.
Therefore, a computation can be obtained as a transitions series between
consecutive configurations. Where and how P systems can be implemented
is nowadays an open problem, but implementation on digital computers could
be one way to show the capabilities of such systems. This paper presents
a transition P systems implementation in Haskell, based on a theoretical
framework previously developed.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Arroyo:PreWMC2003:A_binary_data_struct:03,
author={Fernando Arroyo and Carmen Luengo and Juan Castellanos and L.F. de Mingo},
title={A binary data structure for membrane processors: Connectivity arrays},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={41--52.},
abstract={This paper defines membrane processors as digital processors capable of
implementing local processing performed inside membranes in transition
P systems. In order to encode the membrane structures of transition P systems,
additional binary data structures are needed. Such binary data structures
are named connectivity arrays. The main purposes of the connectivity arrays
are to distribute information about the system membrane structure among
the different processors that implement the transition P system, and to
facilitate communication processes among different membrane processors.
The information kept in processor has to be versatile and compact; versatile
means to easily permit changes in the membrane structure of the system
processors, and compact means that not too much memory space is needed.
Considering these two requests, a binary word of variable length is considered
here in order to represent in membrane processors the local information
about the membrane structures of transition P systems. This paper presents
the abstract data type connectivity array which defines the data structure
and the needed operations over it in order to parse the P system into a
membrane processor tree and to keep congruent the P system membrane structure
with the membrane processor tree.}
}
@inproceedings{Mingo:WMC2003:A_Binary_Data_Struct:03,
author={Fernando Arroyo and Juan Castellanos and Carmen Luengo and Luis F. Mingo},
title={A Binary Data Structure for Membrane Processors: Connectivity Arrays},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={19--30},
abstract={This paper defines membrane processors as digital processors capable of
implementing local processing performed inside membranes in transition
P systems. In order to encode the membrane structures of transition P systems,
additional binary data structures are needed. Such binary data structures
are named connectivity arrays. The main purposes of the connectivity arrays
are to distribute information about the system membrane structure among
the different processors that implement the transition P system, and to
facilitate communication processes among different membrane processors.
The information kept in processor has to be versatile and compact; versatile
means to easily permit changes in the membrane structure of the system
processors, and compact means that not too much memory space is needed.
Considering these two requests, a binary word of variable length is considered
here in order to represent in membrane processors the local information
about the membrane structures of transition P systems. This paper presents
the abstract data type connectivity array which defines the data structure
and the needed operations over it in order to parse the P system into a
membrane processor tree and to keep congruent the P system membrane structure
with the membrane processor tree. Work partially supported by contribution
of EU commission under the Fifth Framework Programme, project MolCoNet
IST-2001-32008.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Bernardini:WMC2003:Universality_of_Mini:03,
author={Francesco Bernardini and Andrei Paun},
title={Universality of Minimal Symport/Antiport: Five Membranes Suffice},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={43--54},
abstract={P systems with symport/antiport rules of a minimal size (only one object
passes in any direction in a communication step) have been recently proved
to be computationally universal. The result originally reported in [2]
has been subsequently improved in [6] by showing that six membranes suffice.
In [6] it has been also conjectured that at least one membrane can be saved.
Here we prove that conjecture: P systems with five membranes and symport/antiport
rules of a minimal size are computationally complete. The optimality of
this result remains open.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Bernar:EMCC2003:Molecular/Cellular_X:03,
author={Francesco Bernardini and Marian Gheorghe},
title={{Molecular/Cellular} {X} {M}achines},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Bernar:PreWMC2003:On_the_power_of_mini:03,
author={Francesco Bernardini and Marian Gheorghe},
title={On the power of minimal symport/antiport},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={72--83}
}
@inproceedings{Bernar:BWMC2003:Language_Generating_:03,
author={Francesco Bernardini and Marian Gheorghe},
title={Language Generating by Means of {P} systems with Active Membranes},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={46--60}
}
@inproceedings{Bernar:WMC-CdeA2002:P_systems_with_bound:03,
author={Francesco Bernardini and Vincenzo Manca},
title={{P} systems with boundary rules},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={107--118},
abstract={We propose a new variant of P Systems, based on boundary rules , shortly
called PB Systems. Boundary rules means that rules are not internal to
regions but they are able to "see" even externally, that is, they are sensible
to what happens around the border of the membranes. We prove the computational
universality for PB systems with three membranes which sense at most one
symbol outside and one symbol inside a membrane. Finally, we investigate
the relationships with the basic model of P systems by proving an equivalence
between P systems without priority, thickness or dissolution operator,
and PB systems that use communication rules of a restricted form.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{FFreund:WMC2003:P_Systems_with_Cutti:03,
author={Franziska Freund and Rudolf Freund and Marion Oswald and Maurice Margenstern
and Yurii Rogozhin and Sergey Verlan},
title={{P} systems with Cutting/Recombination Rules Assigned to Membranes},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={191--202},
abstract={We introduce a new variant of splicing P systems, where the rules are directly
assigned to the membranes and not to the regions as this is usually observed
in the area of membrane systems. The strings involved in the splicing operation
are either taken from inside or from outside the membrane and the strings
resulting from the splicing operation also may go inside or outside the
membrane. Instead of the splicing operation, also the operations of cutting
and recombination are used as rules assigned to membranes. For the application
of rules leading from one configuration of the system to the succeeding
configuration we consider a sequential model and do not use the model of
maximal parallelism. We will show that for such sequential P systems using
splicing rules or cutting/recombination rules assigned to the skin membrane
we already obtain universal computational power with only one membrane.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Cioban:WMC-CdeA2002:Client-Server_P_Syst:03,
author={Gabriel Ciobanu and Daniel Dumitriu and Dorin Huzum and Gabriel Moruz and
Bogdan Tanasa},
title={Client-Server {P} systems in Modeling Molecular Interaction},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={203--218},
abstract={We present a new version of P systems called Client-Server P Systems (CSPS).
The client membranes are characterized by their states; the server membrane
stores the states of the clients and triggers the corresponding interaction
rules. We show that CSPS have the same expressive power as Turing machines.
CSPS is used to model various molecular processes in which interaction
and state transitions are causally linked. Signaling pathways and T cell
activation are described by using a CSPS software environment called MOlNET
(MOlecular NETworks). MOlNET can describe the dynamics of molecular interactions,
including both qualitative and quantitative aspects and simulating the
signaling pathways that tune the activation thresholds for T cells.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Cioban:PreWMC2003:A_parallel_implement:03,
author={Gabriel Ciobanu and G. Wenyuan},
title={A parallel implementation of transition {P} systems},
booktitle={Pre-proceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={169--184}
}
@inproceedings{Cioban:BWMC2003:Sevilla_Carpets_Asso:03,
author={Gabriel Ciobanu and Gheorghe P{\u a}un and Gh. Stefanescu},
title={Sevilla Carpets Associated with {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={135--140}
}
@inproceedings{Gabriel:WMC2003:P_Systems_Running_on:03,
author={Gabriel Ciobanu and Guo Wenyuan},
title={{P} systems Running on a Cluster of Computers},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={123--139},
abstract={The paper presents a parallel implementation of the membrane systems. We
implement the simplest variant of P systems, which however defines the
essential features of the membrane systems, and acts as a framework for
other variants of P systems with advanced functionalities. The mechanisms
used in this implementation could be easily adapted to other versions of
P systems with minor changes. The implementation is designed for a cluster
of computers; it is written in C++ and it makes use of Message Passing
Interface as its communication mechanism.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Cioban:WMC-CdeA2002:Membrane_systems_and:03,
author={Gabriel Ciobanu and Rahul Desai and Akash Kumar},
title={Membrane systems and distributed computing},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={187--202},
abstract={This paper presents membrane systems as an appropriate model for distributed
computing, an efficient and natural environment to present the fundamental
distributed algorithms. We support the idea that P systems can become a
primary model for distributed computing, particularly for message-passing
algorithms. We present the core theory, the fundamental algorithms and
problems in distributed computing. We focus on an example describing an
immune response system against virus attacks. The example is implemented
using a P system library created by the authors to simulate the main functions
of a P system, and an MPI program that takes advantage of the highly parallel
features provided by the model. The program uses distributed leader election
and synchronization algorithms.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Bel_En:WMC-CdeA2002:Preliminaries_About_:03,
author={Gemma Bel-Enguix},
title={Preliminaries About Some Possible Applications of {P} systems in Linguistics},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={74--89},
abstract={Membrane computing [Paun, 2000] is a new and fruitful paradigm of natural
computing. The present paper is devoted to some preliminary ideas about
how membrane computing can be applied to linguistics. To this end, first
some concepts are defined which introduce what we call linguistic P systems.
Then, three examples of quite simple applications to pragmatics, phonetic
evolution, and dialogue are discussed.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Bel_En:WMC-CdeA2002:An_Application_of_Dy:03,
author={Gemma Bel-Enguix and Matteo Cavaliere and Rodica Ceterchi and Radu Gramatovici
and Carlos Mart{\'i}n-Vide},
title={An Application of Dynamic {P} systems: Generating Context-Free Languages},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={90--106},
abstract={We present a method of generating context-free languages, in a parallel
way, using dynamic P systems, which evolve in time in a coherent manner.
The evolution is described by a contextual grammar D(G), which can be canonically
associated to any context-free grammar G. The dynamic P system generated
by D(G) will "compute" the language L(G), i.e., one of the configurations
of the system will contain all words of L(G) of length n at depth 2n-1.
Our approach is an attempt to prove the richness and power of the concept
of dynamic P system, both in the area of P systems, and in the area of
contextual grammars.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Bel-En:PreWMC2003:Active_P_automata_an:03,
author={Gemma Bel-Enguix and Radu Gramatovici},
title={Active {P} automata and natural language processing},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={61--71}
}
@inproceedings{Bel-Enguix:WMC2003:Parsing_with_Active_:03,
author={Gemma Bel-Enguix and Radu Gramatovici},
title={Parsing with Active {P} Automata},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={31--42},
abstract={New classes of P automata are introduced corresponding to the basic classes
of languages in the Chomsky hierarchy. Unlike the previously defined P
automata, active P automata are computing with the structure of the membrane
systems, using operations like membrane creation, division and dissolution.
The model is applied to the parsing of (natural language) sentences into
dependency trees. The research of the first author has been supported by
Marie Curie Fellowships of the European Community programme Human Potential
(IHP) under contract number HPMF-CT-2002-01582. The research of the second
author has been supported by a fellowship from the NATO Scientific Committee
in Spain.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Paun:FCT2003:Membrane_computing:03,
author={Gheorghe P{\u a}un},
title={Membrane computing},
booktitle={Fundamentals of Computation Theory 14th International Symposium, FCT 2003,
Malm{\"o}, Sweden, August 12-15, 2003, Proceedings.},
year={2003},
publisher={Springer},
editor={Andrzej Lingas and Bengt J. Nilsson},
pages={284--295},
abstract={This is a brief overview of membrane computing, at about five years since
this area of natural computing has been initiated. One informally introduces
the basic ideas and the basic classes of membrane systems (P systems),
some directions of research already well developed (mentioning only some
central results or types of results along these directions), as well as
several research topics which seem to be of interest.},
series={Lecture Notes in Computer Science},
volume={2751}
}
@inproceedings{Paun:DCFS2003:Descriptional_comple:03,
author={Gheorghe P{\u a}un},
title={Descriptional complexity issues in membrane computing},
booktitle={Proc. of DCFS Workshop},
year={2003},
address={Budapest, Hungary},
pages={66--77}
}
@inproceedings{Franco:EMCC2003:Modeling_some_Biolog:03,
author={Giuditta Franco and Vincenzo Manca},
title={Modeling some Biological Phenomena by {P} systems},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Franco:WMC2003:A_Membrane_System_fo:03,
author={Giuditta Franco and Vincenzo Manca},
title={A Membrane System for the Leukocyte Selective Recruitment},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={181--190},
abstract={A formal description is developed for the phenomenon of leukocyte recruitment
that plays a critical role in the immune response. Due to its complex nature
and capability to rapidly adapt to the attack of infectious agents, the
immune system may be considered a typical example of complex adaptive system
[9]. Here the leukocyte selective recruitment, crucial in immunity, is
modeled as a dynamical system of interactions between leukocytes and endothelial
cells, where a special kind of membrane structure turns out to be a very
useful tool in the formal analysis of the recruitment process. In our membrane
system, besides the traditional rules for communication and transformation
of P systems [8], rules are allowed for the expression of receptors, for
adhesion between membranes, and for the encapsulation of a membrane inside
another membrane.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Franco:PreWMC2003:A_membrane_system_fo:03,
author={Giuditta Franco and Vincenzo Manca},
title={A membrane system for the leucocyte selective recruitment},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={222--230.}
}
@inproceedings{Hoogeboom:DLT2002:,
author={Hendrik Jan Hoogeboom},
title={Carriers and counters. {P} systems with carriers vs. (blind) counter automata},
booktitle={Developments in Language Theory, 6th International Conference, DLT 2002,
Kyoto, Japan, September 18-21, 2002, Revised Papers},
year={2003},
publisher={Springer-Verlag Heidelberg},
editor={Masami Ito and Masafumi Toyama},
pages={140--151},
abstract={P systems with carriers are shown to be computationally complete with only
a single membrane and two carriers. We argue that their power is due to
the maximal parallelism required in the application of the rules. In fact,
with a single carrier, these systems are equivalent to blind counter automata.
Finally, with a single passenger restriction the systems are again computationally
complete.},
series={Lecture Notes In Computer Science},
volume={2450}
}
@inproceedings{Arde:WMC-CdeA2002:Molecular_Biology_of:03,
author={Ioan I. Ardelean},
title={Molecular Biology of Bacteria and its Relevance for {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={1--18},
abstract={We recall several elements of molecular biology of bacteria, also discussing
their (possible) relevance for the membrane computing area.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Arde:BWMC2003:Mechanosensitive_Cha:03,
author={Ioan I. Ardelean and Daniela Besozzi},
title={Mechanosensitive Channels, a Hot Topic in (Micro){B}iology: any Excitement
for {P} systems?},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={32--36}
}
@inproceedings{Arde:BWMC2003:Playing_with_a_Proba:03,
author={Ioan I. Ardelean and Matteo Cavaliere},
title={Playing with a Probabilistic {P} system Simulator: {M}athematical and Biological
Problems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={37--45}
}
@inproceedings{Gia:WMC-CdeA2002:Accretive_rules_in_C:03,
author={Jean-Louis Giavitto and Olivier Michel},
title={Accretive rules in {Cayley} {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={319--338},
abstract={During a discussion taking place at WMC'01, G. Paun put the question of
what could be computed only by moving symbols between membranes. In this
paper we provide some elements of the answer, in a setting similar to tissue
P systems, where the set of membranes is organized into a finite graph
or into a Cayley graph, and using a very simple propagation process characterizing
accretive growth. Our main result is to characterize the final configuration
as a least fixed point and to establish two series of approximations that
converge to it. All the notions introduced (Cayley graph of membranes,
accretive rule and iteration) have been implemented in the MGS programming
language and the two approximation series can be effectively computed in
Pressburger arithmetics using the omega calculator in the case of Abelian
Cayley graphs.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Semper:WMC2003:P_Systems_with_Exter:03,
author={Jose M. Sempere},
title={{P} systems with External Input and Learning Strategies},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={341--356},
abstract={This is a preliminary work in which we propose a variant of P systems by
adding in every region a dynamic engine that allows the change of the internal
rewriting rules along the computation time, obtaining in this way a new
family of P systems with adaptation to changing environments. They will
be called adaptative P systems. Here, the engine that we propose to act
inside every membrane is based on learning algorithms under the grammatical
inference framework. The behavior of every region changes according to
the information received from the external environment and the internal
regions.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Semp:PreWMC2003:P_systems_with_exter:03,
author={Jos{\'e} M. Sempere},
title={{P} systems with external input and learning strategies},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={445--448}
}
@inproceedings{Pazos:IWANN2003:Solving_SAT_in_linea:03,
author={Juan Pazos and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s Silva},
title={Solving {SAT} in linear time with a neural-like membrane system},
booktitle={Artificial Neural Nets. Problem Solving Methods 7th International Work-Conference
on Artificial and Natural Neural Networks, IWANN 2003, Ma{\'o}, Menorca, Spain,
June 3-6. Proceedings, Part II.},
year={2003},
publisher={Springer},
editor={Jos{\'e} Mira and Jos{\'e} R. Alvarez},
pages={662--669},
abstract={We present in this paper a neural-like membrane system solving the SAT problem
in linear time. These neural P systems are nets of cells working with multisets.
Each cell has a finite state memory, processes multisets of symbol-impulses,
and can send impulses ("excitations") to the neighboring cells. The maximal
mode of rules application and the replicative mode of communication between
cells are at the core of the efficiency of these systems.},
series={Lecture Notes in Computer Science},
volume={2687}
}
@inproceedings{SDer:WMC2003:P_Systems_Generating:03,
author={K. S. Dersanambika and Kamala Krithivasan and K. G. Subramanian},
title={{P} systems Generating Hexagonal Picture Languages},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={168--180},
abstract={P systems generating rectangular arrays have been recently introduced in
[1,2,3], thus bringing together the two areas of theoretical computer science,
namely membrane computing and picture grammars. In this paper, hexagonal
arrays on triangular grids are considered and the capabilities of the three
approaches [1,2,3] that construct P systems for generation of arrays on
rectangular grids, to handle arrays on triangular grids, are demonstrated.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Ders:PreWMC2003:P_systems_generating:03,
author={K.S. Dersanambika and Kamala Krithivasan and K.G. Subramanian},
title={{P} systems generating hexagonal picture languages},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={209--221}
}
@inproceedings{Krithi:BWMC2003:P_Automata_with_Tape:03,
author={Kamala Krithivasan},
title={{P Automata} with Tapes},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={216--225}
}
@inproceedings{Lakshm:PreWMC2003:On_the_power_of_tiss:03,
author={Kuppuswamy Lakshmanan and Raghavan Rama},
title={On the power of tissue {P} systems with insertion and deletion rules},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={304--318}
}
@inproceedings{Cienci:PreWMC2003:P_automata_with_prio:03,
author={Ludek Cienciala and Lucie Ciencialova},
title={{P} automata with priorities},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={161--168}
}
@inproceedings{Kudlek:WMC-CdeA2002:Considerations_on_a_:03,
author={Manfred Kudlek and Victor Mitrana},
title={Considerations on a Multiset Model for Membrane Computing},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={352--359},
abstract={We define, in an inductive way, structured multisets, as well as Chomsky-like
productions for such higher order multisets. The usefulness of the approach
for Petri nets and membrane computing is briefly discussed.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Gheorg:IWANN2003:An_agent_based_appro:03,
author={Marian Gheorghe and Carlos Mart{\'i}n-Vide and Victor Mitrana and Mario J. P{\'e}rez-Jim{\'e}nez},
title={An agent based approach of collective foraging},
booktitle={Artificial Neural Nets. Problem Solving Methods 7th International Work-Conference
on Artificial and Natural Neural Networks, IWANN 2003, Ma{\'o}, Menorca, Spain,
June 3-6. Proceedings, Part II.},
year={2003},
publisher={Springer},
editor={Jos{\'e} Mira and Jos{\'e} R. Alvarez},
pages={639--645},
abstract={In this paper the behaviour of a bee colony is modeled as a society of communicating
agents acting in parallel and synchronizing their behaviour. Two computational
models for defining the agents behaviour are introduced and compared and
tools developed for these models are briefly illustrated.},
series={Lecture Notes in Computer Science},
volume={2687}
}
@inproceedings{Gheorg:FBCI2003:Eilenberg_P_systems::03,
author={Marian Gheorghe and Mike Holcombe and Petros Kefalas},
title={Eilenberg {P} systems: a bio-computational model},
booktitle={Proc. First Balkan Conf. on Informatics},
year={2003},
address={Thessaloniki, Greece},
pages={147--160}
}
@inproceedings{Pere:PreWMC2003:A_linear-time_soluti:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={A linear-time solution for the {Knapsack} problem using active membranes},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={326--342}
}
@inproceedings{PerezJ:WMC2003:A_Linear-Time_Soluti:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={A Linear-Time Solution to the {Knapsack} Problem Using {P} systems with
Active Membranes},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={250--268},
abstract={Up to now, P systems dealing with numerical problems have been rarely considered
in the literature. In this paper we present an effective solution to the
Knapsack problem using a family of deterministic P systems with active
membranes using 2-division. We show that the number of steps of any computation
is of linear order, but polynomial time is required for pre-computing resources.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Pere:BWMC2003:Complexity_Classes_i:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Complexity Classes in Cellular Computing with Membranes},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={270--278},
abstract={In this paper we introduce four complexity classes for cellular computing
systems with membranes: the first and the second ones contain all decision
problems solvable in polynomial time by a family of deterministic P systems,
without and with an input membrane, respectively; the third and fourth
classes contain all decision problems solvable in polynomial time by a
family of non-deterministic P systems, without and with an input membrane,
respectively. We illustrate the usefulness of these classes by solving
two NP�complete problems, namely HPP and SAT, in both variants of P systems.}
}
@inproceedings{Pere:BWMC2003:Solving_VALIDITY_Pro:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Solving {VALIDITY} Problem by Active Membranes with Input},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={279--290}
}
@inproceedings{PerezJ:WMC-CdeA2002:Decision_P_Systems_a:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Decision {P} systems and the {P} $ \neq $ {NP} Conjecture},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={388--399},
abstract={We introduce decision P systems, which are a class of P systems with symbol-objects
and external output. The main result of the paper is the following: if
there exists an NP-complete problem that cannot be solved in polynomial
time, with respect to the input length, by a deterministic decision P system
constructed in polynomial time, then $P \neq NP$. From Zandron-Ferreti-Mauri's
theorem it follows that if $P \neq NP$, then no NP-complete problem can
be solved in polynomial time, with respect to the input length, by a deterministic
P system with active membranes but without membrane division, constructed
in polynomial time from the input. Together, these results give a characterization
of $P \neq NP$ in terms of deterministic P systems.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Pere:BWMC2003:Verification_of_non-:03,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Verification of non-deterministic transition {P} systems solving {SAT} problem},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={291--304}
}
@inproceedings{Oswald:SALR2003:P_Automata_with_memb:03,
author={Marion Oswald and Rudolf Freund},
title={{P Automata} with membrane channels},
booktitle={Proceedings of the eighth Int. Symp. on Artificial Life and Robotics},
year={2003},
address={Beppu, Japan},
editor={M. Sugisaka and H. Tanaka},
pages={275--278}
}
@inproceedings{Cavali:WMC-CdeA2002:Evolution-Communicat:03,
author={Matteo Cavaliere},
title={Evolution-Communication {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={134--145},
abstract={We propose a new class of P systems that use simple evolution rules (classical
evolution rules without communication targets) and symport/antiport rules
(for communication). This type of P system is realistic for (at least)
three different reasons: we do not have target indications in the evolution
rules, we use very simple symport/antiport rules to realize communication,
and we do not need objects available in the environment at the beginning
of a computation. Somewhat expected, this new variant is still universal.
We prove the universality in two cases: when using catalytic rules (but
only one catalyst), symport/antiport rules of weight one, and two membranes,
and when we use three membranes, symport/antiport rules of weight one,
and no catalyst. Especially the latter result is of interest, because the
catalysts were used in most universality proofs for P systems with symbol-objects.
Also new is the proof technique we use: we start from programmed grammars
with unconditional transfer.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Cavali:BWMC2003:Forbidding_and_Enfor:03,
author={Matteo Cavaliere and Natasha Jonoska},
title={Forbidding and Enforcing in Membrane Computing},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={75--84}
}
@inproceedings{Cavali:PreWMC2003:Evolution_and_observ:03,
author={Matteo Cavaliere and Peter Leupold},
title={Evolution and observation - a new way to look at membrane systems},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={117--132}
}
@inproceedings{Cavaliere:WMC2003:Evolution_and_Observ:03,
author={Matteo Cavaliere and Peter Leupold},
title={Evolution and Observation: A New Way to Look at Membrane Systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={70--87},
abstract={An architecture for investigating the dynamical behaviour of biological
systems is proposed by using the concepts of behaviour and observer. The
behaviour of a biological system is the sequence of states traversed as
time passes; the observer is a device translating this behaviour into a
readable output. As an instance of this architecture we investigate P/O
systems constituted by a membrane system and a multiset finite automaton
observer. We first characterize the infinite behaviours of conservative
systems, i.e., systems whose number of objects is constant. These systems
behave very regularly. For more sophisticated systems we then use also
more complicated multiset automata as observers: they map the configurations
into an output alphabet and thus we obtain words describing the entire
computations. Even for seemingly simple membrane systems using only non-cooperative
rules and regular-like observers through this combination a great power
emerges, in our case computational universality.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Margenstern:WMC2003:Can_Hyperbolic_Geome:03,
author={Maurice Margenstern},
title={Can Hyperbolic Geometry Be of Help for {P} systems?},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={240--249},
abstract={The goal of this paper is to propose a possible new approach to P systems
by making use of hyperbolic geometry. The ideas of the paper are a continuation
of the ideas which the author presented at the Brainstorming meeting organised
in Tarragona, Spain, on February 5-12, 2003. The hope of this approach
is that this could be of some help in order to better understand the computational
power of Nature.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Margen:PreWMC2003:Can_hyperbolic_geome:03,
author={Maurice Margenstern},
title={Can hyperbolic geometry be of help for {P} systems?},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={319--325.}
}
@inproceedings{Margen:BWMC2003:Can_Hyperbolic_Geome:03,
author={Maurice Margenstern},
title={Can Hyperbolic Geometry Help Molecular Computing?},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={226--231}
}
@inproceedings{Guti:EMCC2003:Solving_Numerical_NP:03,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Solving Numerical {NP}-Complete Problems Using {P} systems with Active membranes:
the Partition Problem and Beyond},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Ionescu:DNA8:Unexpected_Universal_Results:2003,
author={Mihai Ionescu and Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un},
title={Unexpected Universality Results for Three Classes of {P} systems with Symport/Antiport},
booktitle={DNA Computing: 8th International Workshop on DNA-Based Computers, DNA8 Sapporo,
Japan, June 10-13, 2002. Revised Papers},
year={2003},
publisher={Springer-Verlag Heidelberg},
editor={M. Hagiya and A. Ohuchi},
pages={281--290},
abstract={Symport and antiport are biological ways of transporting molecules through
membranes in "collaborating" pairs; in the case of symport the two molecules
pass in the same direction, in the case of antiport the two molecules pass
in opposite directions. Here we first survey the results about the computing
power of membrane systems (P systems) using only symport/antiport rules
(hence these systems compute only by using communication), then we introduce
a novel way of defining the result of a computation in a membrane system:
looking for the trace of certain objects in their movement through membranes.
Rather unexpected, in this way we get characterizations of recursively
enumerable languages by means of membrane systems with symport/antiport
which work with multisets of objects (note the qualitative difference between
the data structure used by computations - multisets: no ordering - and
the data structure of the output - strings: linear ordering). A similar
remark holds true for the case of analysing P systems: the sequence of
certain distinguished objects taken from the environment during a computation
is the string recognized by the computation. We also survey universality
results from this area, with sketched proofs.},
series={Lecture Notes In Computer Science},
volume={2568}
}
@inproceedings{Madhu:BWMC2003:New_Results_in_Rewri:03,
author={Mutyam Madhu},
title={New Results in Rewriting {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={232--240}
}
@inproceedings{Madhu:WMC-CdeA2002:A_Survey_on_Some_Var:03,
author={Mutyam Madhu and Kamala Krithivasan},
title={A Survey on Some Variants {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={360--370},
abstract={In this paper we give a brief survey of some variants of P systems and their
computational capacity. An improvement of a known result about rewriting
P systems with leftmost derivation is given. We also give the generalized
definition for normal forms of rewriting P systems.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Ibar:PreWMC2003:The_number_of_membra:03,
author={Oscar H. Ibarra},
title={The number of membranes matters},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={273--285}
}
@inproceedings{Ibarra:WMC2003:The_Number_of_Membra:03,
author={Oscar H. Ibarra},
title={The Number of Membranes Matters},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={218--231},
abstract={We look at a restricted model of a communicating P system, called RCPS,
whose environment does not contain any object initially. The system can
expel objects into the environment but only expelled objects can be retrieved
from the environment. Such a system is initially given an input (with each
i j representing the multiplicity of distinguished object a i , ) and is
used as an acceptor. We show that RCPSs are equivalent to two-way multihead
finite automata over bounded languages (i.e., subsets of , for some distinct
symbols ). We then show that there is an infinite hierarchy of RCPSs in
terms of the number of membranes. In fact, for every r, there is an s>
r and a unary language L accepted by an RCPS with s membranes that cannot
be accepted by an RCPS with r membranes. This provides an answer to an
open problem in [12] which asks whether there is a nonuniversal model of
a membrane computing system which induces an infinite hierarchy on the
number of membranes. We also consider variants/generalizations of RCPSs,
e.g., acceptors of languages; models that allow a polynomial bounded supply
of objects in the environment initially; models with tentacles, etc. We
show that they also form an infinite hierarchy with respect to the number
of membranes (or tentacles). The proof techniques can be used to obtain
similar results for other restricted models of P systems, like symport/antiport
systems This research was supported in part by NSF Grants IIS-0101134 and
CCR02-08595.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Ibarra:MFCS2003:Characterizations:2003,
author={Oscar H. Ibarra and Zhe Dang and Omer Egecioglu and Gaurav Saxena},
title={Characterizations of Catalytic Membrane Computing Systems (Extended Abstract)},
booktitle={Mathematical Foundations of Computer Science 2003: 28th International Symposium,
MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings},
year={2003},
month={December},
publisher={Springer-Verlag Heidelberg},
editor={Branislav Rovan, Peter Vojt{\'a}�},
pages={480--489},
abstract={We look at 1-region membrane computing systems which only use rules of the
form , where C is a catalyst, a is a noncatalyst, and v is a (possibly
null) string of noncatalysts. There are no rules of the form . Thus, we
can think of these systems as purely catalytic. We consider two types:
(1) when the initial configuration contains only one catalyst, and (2)
when the initial configuration contains multiple (not necessarily distinct)
catalysts. We show that systems of the first type are equivalent to communication-free
Petri nets, which are also equivalent to commutative context-free grammars.
They define precisely the semilinear sets. This partially answers an open
question in [19]. Systems of the second type define exactly the recursively
enumerable sets of tuples (i.e., Turing machine computable). We also study
an extended model where the rules are of the form (where q and p are states),
i.e., the application of the rules is guided by a finite-state control.
For this generalized model, type (1) as well as type (2) with some restriction
correspond to vector addition systems.},
series={Lecture Notes In Computer Science},
volume={2747}
}
@inproceedings{Sosík:BWMC2003:Solving_a_PSPACE-Com:03,
author={Petr Sosik},
title={Solving a {PSPACE}-{C}omplete {P}roblem by {P} systems with Active Membranes},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={305--312}
}
@inproceedings{Sosik:WMC-CdeA2002:P_Systems_Without_Pr:03,
author={Petr Sosik and Rudolf Freund},
title={{P} systems Without Priorities are Computationally Universal},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={400--409},
abstract={The "classical" model of P systems was introduced by Gheorghe Paun in 1998;
this model with symbol objects was shown to be computationally universal
in [8], provided that catalysts and priorities of rules are used. We now
show by reduction via register machines that the priorities may be omitted
from the model without loss of computational power. As a consequence, several
universality results for P systems in [10] are improved.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Frisco:WMC-CdeA2002:Simulating_counter_a:03,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom},
title={Simulating counter automata by {P} systems with symport/antiport},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={288--301},
abstract={The complexity, expressed in number of membranes and weight of rules, of
P systems with symport/antiport generating recursively enumerable sets
is reduced if counter automata instead of matrix grammars are simulated.
We consider both subsets of $\mathbb{N}$ obtained by counting objects in
a designated membrane, and string languages obtained by following the traces
of a designated object.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Frisco:WMC-CdeA2002:Towards_a_Hierarchy_:03,
author={Pierluigi Frisco and Sungchul Ji},
title={Towards a Hierarchy of Conformons-{P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={302--318},
abstract={The combination of a theoretical model of the living cell and membrane computing
suggested a new variant of a computational model called conformons-P system
based on membrane-enclosed compartments where conformon-like objects evolve.
Some variants of such model are presented and their computational power
is sketched.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Ceterc:BWMC2003:P_Systems_with_Commu:03,
author={Rodica Ceterchi and Carlos Mart{\'i}n-Vide},
title={{P} systems with Communication for Static Sorting},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={101--117}
}
@inproceedings{Ceterc:WMC-CdeA2002:Dynamic_P_systems.:03,
author={Rodica Ceterchi and Carlos Mart{\'i}n-Vide},
title={Dynamic {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={146--186},
abstract={We propose in this paper a uniform manner of generating families of P systems,
using contextual grammars, specifically, variants of bracketed contextual
grammars. We introduce the concept of enriched bracketed contextual grammar,
which can be used to generate families of P systems with symport/antiport
rules. More generally, we define the notion of dynamic P system associated
to grammars able to "generate" families of P systems, and introduce the
notion of dynamic computation sequence, which combines the previous generative
approach with computational aspects. We illustrate these notions with an
application to the problem of sorting. The model of sorting we propose
uses symport/antiport rules with priority relations, and the notion of
stable configuration of a P system.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Ceterchi_:WMC2003:Simulating_Boolean_C:03,
author={Rodica Ceterchi and Dragos Sburlan},
title={Simulating Boolean Circuits with {P} systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={104--122},
abstract={We propose a model for simulating Boolean circuits with P systems. The simulation
is done in two steps, by first simulating the gates of such a circuit,
and next by showing how these can be combined to obtain actual circuits.
The type of P systems used is with symbol objects, context-free rewriting
rules and some other features like mobile catalysts, weak priorities and
promoters.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Ceterc:PreWMC2003:Simulating_Boolean_c:03,
author={Rodica Ceterchi and Dragos Sburlan},
title={Simulating Boolean Circuits with {P} systems},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={145--160}
}
@inproceedings{Ceterc:BWMC2003:Array-rewriting_P_sy:03,
author={Rodica Ceterchi and Mutyam Madhu and Gheorghe P{\u a}un and K.G. Subramanian},
title={Array-rewriting {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={118--134}
}
@inproceedings{Ceterchi_:WMC2003:Tiling_Rectangular_P:03,
author={Rodica Ceterchi and Radu Gramatovici and Natasa Jonoska},
title={Tiling Rectangular Pictures with {P} systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={88--103},
abstract={We introduce a class of two-dimensional tiling languages which are distinct
from the local and recognizable picture languages. These languages arise
from tilings of the integer lattice Z 2. For such picture languages, we
define a class of tissue-like P systems with active membranes as a generative
device. We also make a comparison with the model introduced in [2,3] for
the generation of local and recognizable two-dimensional languages, using
a similar type of P systems. The first author has been supported by the
grant SAB2000-0145, from the Secretaria de Estato de Educacion y Universidades,
of the Spanish Ministry for Education, Culture, and Sport. The second author
has been supported by a fellowship of the NATO Scientific Committee. The
third author has been partially supported by grants EIA-0086015 and EIA-0074808
from the National Science Foundation, USA.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Ceterc:PreWMC2003:P_systems_for_tiling:03,
author={Rodica Ceterchi and Radu Gramatovici and Natasha Jonoska},
title={{P} systems for tiling rectangular pictures},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={133--144}
}
@inproceedings{Ceterc:BWMC2003:Generating_Picture_L:03,
author={Rodica Ceterchi and Radu Gramatovici and Natasha Jonoska and K.G. Subramanian},
title={Generating Picture Languages with {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={85--100}
}
@inproceedings{Vasilc:WMC-CdeA2002:The_Architecture_for:03,
author={Roxana Vasilco and Alina Popescu and Roxandra Chiurtu and Dan Dascalu},
title={The Architecture for Living Structures - A Possible Basis for Molecular
Computing},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={410--421},
abstract={The paper recalls basic biological facts about living structures, as useful
supports for molecular computing. Particular emphasis is made on membranes
and proteins, whose structural and conformational dynamics might be considered
as generating a computational environment in living systems.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Freund:WMC-CdeA2002:Energy-controlled_P_:03,
author={Rudolf Freund},
title={Energy-controlled {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={247--260},
abstract={As already considered in [13], we investigate P systems where each evolution
rule "produces" or "consumes" some quantity of energy, in amounts which
are expressed as integer numbers. Yet in contrast to P systems with energy
accounting as considered in [13], for energy-controlled P systems we demand
that in each evolution step and in each membrane the total energy consumed
by the application of a multiset of evolution rules has to be the maximum
possible within a specific non-negative range. Only equipped with this
control feature, energy-controlled P systems are very powerful. In the
case of multisets of symbol objects we find that energy-controlled P systems
with even only one membrane and an energy range of $\left\{ 0,1\right\}
$ for the total energy involved in an evolution step characterize the recursively
enumerable sets of vectors of natural numbers (without using catalysts
or priorities or membrane dissolving features). In the case of string objects
similar results can be obtained. Energy-controlled P systems with even
only one membrane and the minimal energy range of $\left\{ 0\right\} $
for the total energy involved in an evolution step at least generate any
set of vectors of natural numbers that can be generated by matrix grammars
without appearance checking.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Freund:WMC-CdeA2002:Membrane_Systems_wit:03,
author={Rudolf Freund and Andrei P{\u a}un},
title={Membrane Systems with Symport/Antiport: Universality Results},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={270--287},
abstract={Symport and antiport are biological ways for transporting molecules through
membranes in a "collaborating" manner; in the case of symport several molecules
pass in the same direction, in the case of antiport two or more molecules
pass in opposite directions. In this paper we first survey the results
on the computing power of membrane systems (P systems) using only symport/antiport
rules and then improve some of the results known so far. A recent variant
of P systems with purely communicating rules introduced in [24] with the
name of communicating P systems is revisited and optimal (with respect
to the number of membranes) universality results for that particular variant
are obtained, too.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Freund:DLT2003:On_tree_classes_automata_like:2003,
author={Rudolf Freund and Carlos Mart{\'i}n-Vide and Adam Obtulowicz and Gheorghe P{\u a}un},
title={On Three Classes of Automata-Like {P} systems},
booktitle={Developments in Language Theory, 7th International Conference, DLT 2003,
Szeged, Hungary, July 7-11, 2003, Proceedings},
year={2003},
publisher={Springer-Verlag Heidelberg},
editor={Zolt{\'a}n {\'E}sik and Zolt{\'a}n F{\"u}l{\"o}p},
pages={292--303},
abstract={We investigate the three classes of accepting P systems considered so far,
namely the P automata of Csuhaj-Varj{\'u}, Vaszil [3], their variant introduced
by Madhu, Krithivasan [10], and the related machinery of Freund, Oswald
[5]. All three variants of automata-like P systems are based on symport/antiport
rules. For slight variants of the first two classes we prove that any recursively
enumerable language can be recognized by systems with only two membranes
(this considerably improves the result from [3], where systems with seven
membranes were proved to be universal). We also introduce the initial mode
of accepting strings (the strings are introduced into the system, symbol
by symbol, at the beginning of a computation), and we briefly investigate
this mode for the three classes of automata, especially for languages over
a one-letter alphabet. Some open problems are formulated, too.},
series={Lecture Notes In Computer Science},
volume={2710}
}
@inproceedings{Freund:PreWMC2003:P_systems_with_condi:03,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with conditional communication rules assigned to membranes},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={231--240}
}
@inproceedings{Freund:BWMC2003:P_Systems_with_Eleme:03,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Elementary Graph Productions},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={180--188}
}
@inproceedings{Freund:WMC-CdeA2002:P_systems_with_Activ:03,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Activated/Prohibited Membrane Channels},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={261--269},
abstract={We investigate a variant of purely communicating P systems, where multisets
of activators can open channels for certain objects to pass through membranes
in one direction; however, the permeability of a channel can be controlled
by multisets of prohibitors, too. We will show that for such systems with
only one membrane and using only singleton activator and prohibitor sets,
we already obtain universal computational power. When using systems with
activating multisets for membrane channels only, we obtain a similar result.
By showing a close correspondence to P systems with symport/antiport as
introduced in [13] we can optimize some results given there.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Freund:EMCC2003:Complexity_of_P_Auto:03,
author={Rudolf Freund and Marion Oswald},
title={Complexity of {P} Automata with Catalysts},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Freund:PreWMC2003:P_systems_with_cutti:03,
author={Rudolf Freund and Marion Oswald and Franziska Freund and Maurice Margenstern
and Sergey Verlan and Yurii Rogozhin},
title={{P} systems with cutting/recombination rules assigned to membranes},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={241--251}
}
@inproceedings{Freund:PreWMC2003:Omega-P_automata_wit:03,
author={Rudolf Freund and Marion Oswald and Ludwig Staiger},
title={{Omega-P} automata with communication rules},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={252--265}
}
@inproceedings{RFreund:WMC2003:omega-P_Automata_wit:03,
author={Rudolf Freund and Marion Oswald and Ludwig Staiger},
title={{omega-P} Automata with Communication Rules},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={203--217},
abstract={We introduce omega-P automata based on the model of P systems with membrane
channels (see [8]) using only communication rules. We show that omega-P
automata with only two membranes can simulate the computational power of
usual (non-deterministic) omega-Turing machines. A very restricted variant
of omega-P automata allows for the simulation of omega-finite automata
in only one membrane.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Verlan:WMC2003:About_Splicing_P_Sys:03,
author={Sergey Verlan},
title={About Splicing {P} systems with Immediate Communication and Non-extended
Splicing {P Systems}},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={369--382},
abstract={We consider splicing P systems with immediate communication introduced by
Gh. Pun in [5]. We solve the open problem Q17 from that book by proving
that systems with two membranes can generate any recursively enumerable
language. We discuss the similarities between splicing P systems with immediate
communication having two membranes and time-varying distributed H systems
with two components. We also consider non-extended splicing P systems,
i.e., without a terminal alphabet. We show that it is possible to generate
any recursively enumerable language by such systems with two membranes.
In this way we solve the open problem Q16 from the same book.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Verlan:EMCC2003:Communicating_Distri:03,
author={Sergey Verlan},
title={Communicating Distributed {H Systems} with Alternating Filters and Tissue
{P} systems with Minimal Symport/Antiport},
booktitle={EMCC Workshop},
year={2003},
month={November},
address={Vienna}
}
@inproceedings{Verlan:PreWMC2003:About_splicing_P_sys:03,
author={Sergey Verlan},
title={About splicing {P} systems with immediate communication and non-extended
splicing {P Systems}},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={461--473.}
}
@inproceedings{Kris:BWMC2003:Some_Universality_Re:03,
author={Shankara-Narayanan Krishna and Andrei P{\u a}un},
title={Some Universality Results on Evolution-Communication {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={207--215}
}
@inproceedings{Kris:BWMC2003:Three_Universality_R:03,
author={Shankara-Narayanan Krishna and Andrei P{\u a}un},
title={Three Universality Results on {P} systems},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={198--206}
}
@inproceedings{Kris:WMC-CdeA2002:Tissue_P_systems_wit:03,
author={Shankara-Narayanan Krishna and Kuppuswamy Lakshmanan and Raghavan Rama},
title={Tissue {P} systems with contextual and rewriting rules},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={339--351},
abstract={The study of tissue P systems was initiated in [6], inspired from the way
neurons cooperate, processing impulses in the complex net established by
synapses. These systems use multisets of objects for processing, and it
was shown that computational completeness can be achieved using a small
number of cells and states. In this paper, we use string objects as the
underlying data structure. The control structure used is a restricted form
of contextual rules and rewriting rules. We obtain two characterizations
of recursively enumerable languages using these systems: ${\rm tP}$ systems
having 2 states and 2 cells as well as ${\rm tP}$ systems having 4 states
and a single cell generate all recursively enumerable languages. We also
discuss the relationships with ET0L and E0L languages.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Dal-Zilio:WMC2003:On_the_Dynamics_of_P:03,
author={Silvano Dal-Zilio and Enrico Formenti},
title={On the Dynamics of {PB Systems}: A {Petri} Net View},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={153--167},
abstract={We study dynamical properties of PB systems, a new computational model of
biological processes, and propose a compositional encoding of PB systems
into Petri nets. Building on this relation, we show that three properties:
boundedness, reachability and cyclicity, which we claim are useful in practice,
are all decidable.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Dal_Zi:PreWMC2003:On_the_dynamics_of_P:03,
author={Silvano Dal-Zilio and Enrico Formenti},
title={On the dynamics of {PB systems}},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={197--208}
}
@inproceedings{Marcus:WMC-CdeA2002:Bridging_P_Systems_a:03,
author={Solomon Marcus},
title={Bridging {P} systems and Genomics: A Preliminary Approach},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={371--376},
abstract={Bringing genomics within the framework of P systems could give to the former
the possibility to take profit of the computational capacities of the latter.
Moreover, suggestions coming from genomics could enrich the study of P
systems with new biological and computational ideas. In what follows, a
first attempt is made in this respect.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Ji:BWMC2003:Towards_a_Unified_Th:03,
author={Sungchul Ji},
title={Towards a Unified Theory of Computing, Mind, and Signs},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={189--197}
}
@inproceedings{Balane:WMC-CdeA2002:Eilenberg_P_Systems:03,
author={Tudor Balanescu and Marian Gheorghe and Mike Holcombe and Florentin Ipate},
title={{Eilenberg} {P} systems},
booktitle={Membrane Computing: International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002. Revised Papers.},
year={2003},
month={July},
publisher={Springer-Verlag, Berlin},
address={Curtea de Arges, Romania},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
pages={43--57},
abstract={A class of P systems, called EP systems, with string objects processed by
evolution rules distributed alongside the transitions of an Eilenberg machine,
is introduced. A parallel variant of EP systems, called EPP systems, is
also defined and the power of both EP and EPP systems is investigated in
relationship with three parameters: number of membranes, states and set
of distributed rules. It is shown that EPP systems represent a promising
framework for solving NP-complete problems. In particular linear time solutions
are provided for the SAT problem.},
series={Lecture Notes in Computer Science},
volume={2597}
}
@inproceedings{Paka:PreWMC2003:On_the_power_of_tiss:03,
author={V.J. Pakash},
title={On the power of tissue {P} systems working in the maximal-one mode},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={356--364}
}
@inproceedings{ladimi:WMC2003:Simulation_of_Mobile:03,
author={Vladimir Rogozhin and Elena Boian},
title={Simulation of Mobile Ambients by {P} systems. {P}art 1},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={304--319},
abstract={Ambient calculus is an abstract model of the basic features of distribution
and mobility of the computing and computation. The central notion of ambient
calculus is that of a mobile ambient, which is a bounded place where a
computation happens. It was shown that a P system with symbol-objects with
membrane dissolution can be expressed in ambient calculus. We want to do
here the converse work: to express ambient calculus in membrane computing.
In this paper we present the first part of this work: we show that the
Ethernet Network (local electronic computer network) can be expressed in
terms of P systems with symbol-objects. Work is supported by NATO project
PST.CLG.976912, MolCoNet project IST-2001-32008, CRDF (The U.S. Civilian
Research and Development Foundation) project, BGP-II Award No. MM2-3034.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Rogozh:PreWMC2003:Simulation_of_mobile:03,
author={Vladimir Rogozhin and Elena Boian},
title={Simulation of mobile ambients by {P} systems. {Part} 1},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={404--427}
}
@inproceedings{Suzuki:BWMC2003:Abstract_Rewriting_S:03,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Abstract Rewriting Systems on Multisets and Their Application for Modelling
Complex Behaviours},
booktitle={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003},
month={February 5-11},
address={Tarragona},
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={313--331}
}
@inproceedings{Suzuki:PreWMC2003:Modeling_the_p53_sig:03,
author={Yasuhiro Suzuki and S. Ogishima and Hiroshi Tanaka},
title={Modeling the p53 signaling network by using {P} systems},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={449--454}
}
@inproceedings{Qi:PreWMC2003:P_systems_and_Petri_:03,
author={Zhengwei Qi and Jinyuan You},
title={{P} systems and {Petri} nets},
booktitle={Preproceedings of the Workshop on Membrane Computing},
year={2003},
month={July 17-22},
address={Tarragona},
editor={Artiom Alhazov and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
pages={387--403.}
}
@inproceedings{Zhengwei:WMC2003:P_Systems_and_Petri_:03,
author={Zhengwei Qi and Jinyuan You and Hongyan Mao},
title={{P} systems and {Petri} Nets},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July, 17-22, 2003, Revised Papers},
year={2003},
month={July},
publisher={Springer},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
pages={286--303},
abstract={We propose an intriguing relationship between P systems and Petri nets.
For a basic model of P systems, this paper presents a new formalization
based on place/transition nets, which can adopt one transition to implement
the structural operational semantics of one evolving rule in P systems
and utilize incidence matrix to analyze the computation of one macro-step.
We also define the behavioral properties in P systems such as terminating,
liveness, and boundedness based on this formalization. For a general class
of P systems, we briefly describe a high-level framework called membrane
Petri nets (MP-nets). MP-nets extend ordinary colored Petri nets (CPN)
through introducing the dynamic features such as dissolve, divide, and
move inspired by P systems. Therefore, MP-nets can be a graphical as well
as an algebraic modelling tool for both generic P systems and dynamic CPN.},
series={Lecture Notes in Computer Science},
volume={2933}
}
@inproceedings{Leporati:WUMC:Quantum_energy_based:2004,
author={A. Leporati and D. Pescini and C. Zandron},
title={Quantum Energy-based {P} systems},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Obtulowicz:WUMC:Fuzzy_P_Systems:2004,
author={A. Obtulowicz},
title={Fuzzy {P} systems and fuzzy rule-based decisionmaking systems},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Syropoulos:Distributed_Computing:WMC5:2004,
author={A. Syropoulos},
title={On {P} systems and Distributed Computing},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={405--413}
}
@inproceedings{Syropoulos:WUMC:Fuzzifying:2004,
author={A. Syropoulos},
title={Fuzzifying {P} systems},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Syropoulos:Computing_Recursive_Functions:WMC5:2004,
author={A. Syropoulos and Stratos Doumanis and Kostantinos T. Sotiriades},
title={Computing Recursive Functions with {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={414--421}
}
@inproceedings{Obtulowicz:General_Multi-fuzzy_Sets:WMC5:2004,
author={Adam Obtulowicz},
title={General Multi-fuzzy Sets and Fuzzy Membrane Systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={316--326}
}
@inproceedings{Leporati:Conservative_Computations:WMC5:2004,
author={Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title={Conservative Computations in Energy-based {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={268--283}
}
@inproceedings{Lepora:BWMC2004:Simulating_the_Fredk:04,
author={Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title={Simulating the {Fredkin} Gate with Energy--Based {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={292--308}
}
@inproceedings{Cordon:Non-discrete_P_Systems:WMC5:2004,
author={Andr{\'e}s Cord{\'o}n-Franco and Fernando Sancho-Caparrini},
title={Non-discrete {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={205--207}
}
@inproceedings{Cordon:BWMC2004:Looking_for_P_Truth:04,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Looking for {P} Truth},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={134--138}
}
@inproceedings{Cordon:Exploring_Computation_Trees:WMC5:2004,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Exploring Computation Trees Associated with {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={196--204}
}
@inproceedings{Cordon:BWMC2004:Weak_Metrics_on_Conf:04,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Weak Metrics on Configurations of a {P} system},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={139--151}
}
@inproceedings{Binder:Catalytic:CIAA:2004,
author={Aneta Binder and Rudolf Freund and Georg Lojka and Marion Oswald},
title={Implementation of Catalytic {P} systems},
booktitle={Ninth International Conference on Implementation and Application of Automata
Queen's University, Kingston, Ontario, Canada, July 22-24, 2004},
year={2004},
month={July 22-24},
address={Ontario, Canada},
pages={24--33}
}
@inproceedings{Syropoulos:WMC2003:Distributed_Simulation:2004,
author={Apostolos Syropoulos and Eleftherios G. Mamatas and Peter C. Allilomes and
Konstantinos T. Sotiriades},
title={A Distributed Simulation of Transition {P} systems},
booktitle={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July 17-22, 2003, Revised Papers},
year={2004},
publisher={Springer-Verlag Heidelberg},
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un, Grzegorz
Rozenberg and Arto Salomaa},
pages={357--368},
abstract={P systems is a new model of computation, inspired by natural processes,
that has a distributive nature. By exploring this distributive nature of
P systems, we have built a purely distributive simulation of P systems.
The simulation, whose implementation is described here, was programmed
in the Java programming language and makes heavy use of its Remote Method
Invocation protocol. The class of P systems that the simulator can accept
is a subset of the family of systems, which have the computational power
of Turing machines. The paper concludes with some remarks concerning the
usefulness of the simulation. In addition, there is a brief discussion
of some ideas that can be used in the formulation of a foundation of distributive
computing.},
series={Lecture Notes In Computer Science},
volume={2933}
}
@inproceedings{Alhazov:DECP:BWMC2004,
author = {Artiom Alhazov},
title = {On the Power of Deterministic {EC P Systems}},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {11--15},
abstract = {It is commonly believed that a significant part of the computational
power of membrane systems comes from their inherent non-determinism. Recently, R. Freund and Gh. P{\u a}un have considered deterministic P systems, and
formulated the general question whether the computing (generative) capacity
of non-deterministic P systems is strictly larger than the (recognizing) capacity
of their deterministic counterpart.
In this paper, we study the computational power of deterministic P systems
in the evolution--communication framework. It is known that, in the generative case, two membranes are enough for universality. For the deterministic
systems, we obtain the universality with three membranes, leaving the original
problem open.},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@inproceedings{Alhazov:Activators:BWMC2004,
author = {Artiom Alhazov},
title = {A Note on {P} Systems with Activators},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {16--19},
abstract = {The usual assumption in P systems behavior is that of maximal
parallelism, however in living cells it is not the case because they have
a limited number of enzymes. The aim of this paper is to try to merge
these ideas by introducing a notion of activator - a formal model
of enzyme as a usual symbol-object, more or less a middle notion between
a catalyst and a promoter. Each activator executes one (context-free) rule
and can evolve in the same step.
The rules will need activators to be applied, so the parallelism
of each rule is maximal, but limited to the number of its activators.
Such systems can generate any recursively enumerable language
or deterministically accept any recursively enumerable set of vectors
of nonnegative integers. It is open what is the power of P systems
with uniport rules and activators.},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@inproceedings{Alhazov.Sburlan:PMRncooPro:PreWMC5:2004,
author = {Artiom Alhazov and Drago{\c s} Sburlan},
title = {({U}ltimately Confluent) Parallel Multiset-Rewriting Systems
with Permitting Context},
editor = {Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Claudio Zandron},
booktitle = {Pre-proceedings of the Fifth Workshop on Membrane Computing},
address = {Milano, Italy},
year = {2004},
month = {June},
pages = {95--103},
abstract = {The aim of this paper is to study the power of parallel
multiset-rewriting systems with permitting contexts (or P systems with
non-cooperative rules with promoters). The main result obtained is that
if we use promoters of weight two, then the system is universal.
Moreover, the construction satisfies a special property we define:
it is ultimately confluent. This means that if the system allows at least
one halting computation, then its final configuration is reachable from
any reachable configuration.},
url = {http://psystems.disco.unimib.it/procwmc5.html},
}
@inproceedings{Alhazov.Freund:Pol2Eff:PreWMC5:2004,
author = {Artiom Alhazov and Rudolf Freund},
title = {On the Efficiency of {P} Systems with Active Membranes and Two Polarizations},
editor = {Giancarlo Mauri and {\relax Gh}eorghe P{\u a}un and Claudio Zandron},
booktitle = {Pre-proceedings of the Fifth Workshop on Membrane Computing},
address = {Milano, Italy},
year = {2004},
month = {June},
pages = {81--94},
abstract = {We present an algorithm for deterministically deciding SAT in linear time by P systems with active membranes using only two polarizations and rules of types (a), (c) and (e). Moreover, various restrictions on the general form of the rules are considered: global, non-renaming, independent of the polarization, preserving it, changing it, producing two membranes with different polarizations, having exactly one or two objects in (each membrane of) the right-hand side, improving results from [1]. Several problems related to different combinations of these restrictions are formulated, too.},
url = {http://psystems.disco.unimib.it/procwmc5.html},
}
@inproceedings{Alhazov.etal:Pol2:BWMC2004,
author = {Artiom Alhazov and Rudolf Freund and {\relax Gh}eorghe P{\u a}un},
title = {{P} systems with Active Membranes and Two Polarizations},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {20--36},
abstract = {P systems with active membranes using only two electrical charges
and only rules of types (a) and (c) assigned to at most two membranes
are shown to be computationally complete -- thus improving
the previous result of this type from the point of view of the number
of polarizations as well as with respect to the number of membranes.
Allowing a special variant of rules of type (c) to delete symbols
by sending them out, even only one membrane is needed.
Moreover, we present an algorithm for deterministically deciding SAT
in linear time using only two polarizations and global rules
of types (a), (c), and (e).},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@inproceedings{Alhazov.Ishdorj:MemOps:BWMC2004,
author = {Artiom Alhazov and {\relax Ts}eren-Onolt Ishdorj},
title = {Membrane Operations in {P} systems with Active Membranes},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {37--44},
abstract = {In this paper we define a general class of P systems covering some
biological operations with membranes, including evolution, communication
modifying the membrane structure, and we describe and formally specify some
of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can
be used in solving SAT problem in linear time.},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@inproceedings{Profir:Modelling_Molecular_Genetic:WMC5:2004,
author={Aurelia Profir and Elena Boian and N. Barbacari and E. Gutuleac and Cleo
Zelinschi},
title={Modelling Molecular Genetic trigger by Means of {P} Transducer},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={360--362}
}
@inproceedings{Fu:Encoding_P_Systems:WMC5:2004,
author={Cheng Fu and Zhengwei Qi and Jinyuan You},
title={Encoding {P} systems in Non-interleaving $\pi$-{C}alculus},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={233--244}
}
@inproceedings{Teuscher:Chemical_Blending:UPP04:2004,
author={Christof Teuscher},
title={Chemical blending with particles, cells and artificial chemistries},
booktitle={Pre-Proc. Unconventional Programming Paradigms, UPP04, Le Mont Saint-Michel},
year={2004},
month={September},
pages={29--37}
}
@inproceedings{Genova:MAA:2004,
author={D. Genova},
title={Models in membrane computing},
booktitle={Joint Annual Meeting MAA Florida Section and FTYCMA, Univ. of Central Florida},
year={2004},
month={February}
}
@inproceedings{Besozz:BWMC2004:Size_and_Power_of_Ex:04,
author={Daniela Besozzi and Erzs{\'e}bet Csuhaj-Varj{\'u} and Giancarlo Mauri and Claudio
Zandron},
title={Size and Power of Extended Gemmating P Pystems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={92--101}
}
@inproceedings{Besozzi:A_P_Systems_Description_of:WMC5:2004,
author={Daniela Besozzi and Gabriel Ciobanu},
title={A {P} systems Description of the Sodium-Potassium Pump},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={154--160}
}
@inproceedings{Sburlan:Cells_to_software:MMELSP:2004,
author={Dragos Sburlan},
title={From cells to software architecture. {A} {P} system outlook of computational
design},
booktitle={Third Workshop on Mathematical Modelling of Environmental and Life Sciences
Problems},
year={2004},
address={Constancta}
}
@inproceedings{Sburlan:Clock-free:WMC5:2004,
author={Dragos Sburlan},
title={Clock-free {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={372--383}
}
@inproceedings{Csuhaj:P_automata:_Models_Results:WMC5:2004,
author={Erzs{\'e}bet Csuhaj-Varj{\'u}},
title={{P} automata: Models, Results, and Research Topics},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={1--11}
}
@inproceedings{Csuhaj:Reducing_the_Size_of_Extended:WMC5:2004,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Gy{\"o}rgy Vaszil},
title={Reducing the Size of Extended Gemmating {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={208--220}
}
@inproceedings{Sancho:BWMC2004:A_Note_on_Complexity:04,
author={F. Sancho-Caparrini},
title={A Note on Complexity Measures for Probabilistic {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={443--448}
}
@inproceedings{Fontan:BWMC2004:Maximum_Search_Using:04,
author={Federico Fontana and Giuditta Franco},
title={Maximum Search Using {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={152--163}
}
@inproceedings{Arroyo:Representing_Multisets:WMC5:2004,
author={Fernando Arroyo and Carmen Luengo and Juan Castellanos and L.F. de Mingo},
title={Representing Multisets and Evolution Rules in Membrane Processors},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={126--137}
}
@inproceedings{Bernardini:Computing_at_Population:WMC5:2004,
author={Francesco Bernardini and Marian Gheorghe},
title={Computing at Population Level in {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={151--153}
}
@inproceedings{Bernar:BWMC2004:Cell_Communication_i:04,
author={Francesco Bernardini and Marian Gheorghe},
title={Cell Communication in Tissue {P} systems and Cell Division in Population
{P Systems}},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={74--91}
}
@inproceedings{BelEnguix1:LNAI3192:2004,
author={G. Bel Enguix and M.D. Jimenez-Lopez},
title={Computing speech acts, Artificial Intelligence.},
booktitle={Methodology, Systems and Applications},
year={2004},
publisher={Springer},
editor={Ch. Bussler and D. Fensel},
pages={236--245},
series={LNAI 3192}
}
@inproceedings{Cioban:BWMC2004:Pumps_Systems_of_Mem:04,
author={Gabriel Ciobanu},
title={Pumps Systems of Membranes},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={130--133}
}
@inproceedings{Ciobanu:meta_programming:UPP04:2004,
author={Gabriel Ciobanu},
title={Cellular meta-programming},
booktitle={Pre-Proc. Unconventional Programming Paradigms, UPP04, Le Mont Saint-Michel},
year={2004},
month={September},
pages={55--63}
}
@inproceedings{Bel:Analyzing_P_Systems_Structure:WMC5:2004,
author={Gemma Bel-Enguix},
title={Analyzing {P} systems Structure: Working, Predictions, and some Linguistic
Suggestions},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={138--150}
}
@inproceedings{Bel:Explaining_language:MTA:2004,
author={Gemma Bel-Enguix and Mar{\'i}a-Dolores Jim{\'e}nez-L{\'o}pez},
title={Explaining language change with membranes},
booktitle={Pre-Proceedings of Workshop on Grammar Systems, Computer and Automation
Research Institute (SZTAKI) of the Hungarian Academy of Sciences (MTA)},
year={2004},
month={July 5-9},
address={Budapest},
pages={31--46}
}
@inproceedings{Paun:WUMC:Introduction_MC:2004,
author={Gheorghe P{\u a}un},
title={Introduction to Membrane Computing},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Paun:Grammar_Sys_vs_MC:MTA:2004,
author={Gheorghe P{\u a}un},
title={Grammar systems vs. membrane computing: A preliminary approach},
booktitle={Pre-Proceedings of Workshop on Grammar Systems, Computer and Automation
Research Institute (SZTAKI) of the Hungarian Academy of Sciences (MTA).},
year={2004},
month={July 5-9},
address={Budapest},
pages={225--245}
}
@inproceedings{Paun:MC_Introduction:UPP04:2004,
author={Gheorghe P{\u a}un},
title={Membrane computing. {An} introduction},
booktitle={Pre-Proc. Unconventional Programming Paradigms, UPP04, Le Mont Saint-Michel},
year={2004},
month={September},
pages={39--48}
}
@inproceedings{Paun:DNA10:Membrane_Computing:2004,
author={Gheorghe P{\u a}un},
title={Membrane computing: Power and efficiency (A quick overview)},
booktitle={THE TENTH INTERNATIONAL MEETING ON DNA COMPUTING (DNA 10), Universita' di
Milano-Bicocca, Milan, Italy},
year={2004},
month={June 7-10},
address={Milan, Italy}
}
@inproceedings{Paun:ICCC2004:Learning_new_computing:2004,
author={Gheorghe P{\u a}un},
title={Learning new computing models from biology: Membrane computing},
booktitle={International Conference on Computers and Communications-ICCC 2004, Baile
Felix Spa, Oradea, ROMANIA},
year={2004},
month={May 27-29},
address={Oradea, ROMANIA}
}
@inproceedings{Paun:BWMC2004:Further_open_problem:04,
author={Gheorghe P{\u a}un},
title={Further open problems in {Membrane} {Computing}, {Sevilla}, {Spain}, February
2--7 2004},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={354--365}
}
@inproceedings{Paun:WoLLIC2004:Membrane_systems:2004,
author={Gheorghe P{\u a}un},
title={Membrane systems: From cells to computers},
booktitle={WoLLIC'2004 11th Workshop on Logic, Language, Information and Computation,
July 19th to 22nd, 2004, Paris, France},
year={2004},
month={July 19th to 22nd},
address={Paris, France}
}
@inproceedings{Paun:BWMC2004:P_Systems_with_Table:04,
author={Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={{P} systems with Tables of Rules},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={366--379}
}
@inproceedings{Paun:BWMC2004:Tissue_P_Systems_wit:04,
author={Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Tissue {P} systems with Cell Division},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={380--386}
}
@inproceedings{Franco:BWMC2004:Membrane_Kauffman_Ne:04,
author={Giuditta Franco},
title={Membrane {Kauffman} Networks},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={164--167}
}
@inproceedings{Rozenberg:Selectivity_in_Molecular:WMC5:2004,
author={Grzegorz Rozenberg},
title={Selectivity in Molecular Computing},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={64--64}
}
@inproceedings{Vaszil:On_the_Size_of_P_Systems:WMC5:2004,
author={Gy{\"o}rgy Vaszil},
title={On the Size of {P} systems with Minimal Symport/Antiport},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={422--431}
}
@inproceedings{Arde:BWMC2004:New_Proposals_for_th:04,
author={Ioan I. Ardelean and Daniela Besozzi},
title={New Proposals for the Formalization of Membrane Proteins},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={53--59}
}
@inproceedings{Ardelean:Aerobic_Respiration_is_a:WMC5:2004,
author={Ioan I. Ardelean and Daniela Besozzi and Corrado Manara},
title={Aerobic Respiration is a Bio-logic Circuit Containing Molecular Logic Gates},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={119--125}
}
@inproceedings{Arde:BWMC2004:Computing_Using_Sign:04,
author={Ioan I. Ardelean and Matteo Cavaliere and Dragos Sburlan},
title={Computing Using Signals: From Cells to {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={60--73}
}
@inproceedings{Stamatopoulou:Modelling_of_Dynamic:WMC5:2004,
author={Ioanna Stamatopoulou and Marian Gheorghe and Petros Kefalas},
title={Modelling of Dynamic Configuration of Biology-Inspired Multi-agent Systems
with Communicating {X}-machines and Population {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={392--404}
}
@inproceedings{Nepo:BWMC2004:A_Java_Simulator_for:04,
author={Isabel A. Nepomuceno-Chamorro},
title={A {Java} Simulator for Basic Transition {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={309--315}
}
@inproceedings{Bartosik:Paun_systems:CTMDT:2004,
author={J. Bartosik},
title={Paun's systems in modeling of human resource management},
booktitle={Proceedings of the Second Conference on Tools and Methods of Data Transformation},
year={2004},
organization={WSU Kielce}
}
@inproceedings{Bartosik:Heaps_of_pieces:CTMDT:2004,
author={J. Bartosik},
title={Heaps of pieces and Paun's systems},
booktitle={Proceedings of the Second Conference on Tools and Methods of Data Transformation},
year={2004},
organization={WSU Kielce}
}
@inproceedings{Cassanovas:WUMC:Counting_contents:2004,
author={J. Casasnovas and F. Rossello},
title={Counting the contents of fuzzy membranes... and related problem},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Cassanovas:WUMC:Fuzzi_app_copies:2004,
author={J. Casasnovas and M. Moya and J. Miro and F. Rossello},
title={A fuzzy approach to membrane computing with approximate copies},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Inouye:Fibonacci:IMCSCE:2004,
author={J. Inouye},
title={Fibonacci sequence generation using membrane computing},
booktitle={The 2004 Intern. Multiconference in Computer Science and Computer Engineering,
Las Vegas},
year={2004},
pages={384--389}
}
@inproceedings{Inouye:Quantumi:IMCSCE:2004,
author={J. Inouye},
title={Quantum simulation using membrane computing},
booktitle={The 2004 Intern. Multiconference in Computer Science and Computer Engineering,
Las Vegas},
year={2004},
pages={403--409}
}
@inproceedings{Wiedermann:Coupling_Computational:WMC5:2004,
author={Jiri Wiedermann},
title={Coupling Computational and Non-computational processes: Minimal Artificial
Life},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={432--445}
}
@inproceedings{Semp:BWMC2004:Covering_Rules_in_P_:04,
author={Jos{\'e} M. Sempere},
title={Covering Rules in {P} systems: Some Preliminary Ideas},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={449--456}
}
@inproceedings{Sempere:Covering_Reductions:WMC5:2004,
author={Jos{\'e} M. Sempere},
title={Covering Reductions and Degrees in {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={384--391}
}
@inproceedings{Kelemen:P_Colonies:ALIFE9:2004,
author={Jozef Kelemen and Alica Kelemenova and Gheorghe P{\u a}un},
title={{P} colonies},
booktitle={Workshop on Artificial Chemistry, ALIFE9},
year={2004},
month={September 12-15},
address={Boston, Massachusetts, USA}
}
@inproceedings{Ueda:LMNtal:WMC5:2004,
author={K. Ueda and N. Nato},
title={{LMNtal}: A Language Model with Links and Membranes},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={65--80}
}
@inproceedings{Bianco:WUMC:Metabolic_algorithms:2004,
author={L. Bianco and Vincenzo Manca},
title={Metabolic algorithms and signal transduction dynamical networks},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Pan.Alhazov.Ishdorj:Further_MemOps:BWMC2004,
author = {Linqiang Pan and Artiom Alhazov and {\relax Ts}eren-Onolt Ishdorj},
title = {Further Remarks on {P} systems with Active Membranes
Separation, Merging and Release Rules},
booktitle = {Second Brainstorming Week on Membrane Computing
Sevilla, Spain, February 2-7 2004},
year = {2004},
month = {February 2-7},
address = {Sevilla, Spain},
editor = {{\relax Gh}eorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
pages = {316--324},
abstract = {The P systems are a class of distributed parallel computing devices
of a biochemical type. In this note, we show that by using membrane separation
to obtain exponential workspace, SAT problem can be solved in linear time
in a uniform and confluent way by active P systems without polarizations.
This improves some results already obtained by A. Alhazov, Ts. Ishdorj. A
universality result related to membrane separation is also obtained.},
url = {http://www.gcn.us.es/2BWMC/Volumen.htm},
}
@inproceedings{Pan:BWMC2004:Solving_Multidimensi:04,
author={Linqiang Pan and Carlos Mart{\'i}n-Vide},
title={Solving Multidimensional 0-1 {Knapsack} Problem by {P} systems with Input
and Active Membranes},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={342--353}
}
@inproceedings{Pan:BWMC2004:P_Systems_with_Activ:04,
author={Linqiang Pan and Tseren-Onolt Ishdorj},
title={{P} systems with Active Membranes and Separation Rules},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={325--341}
}
@inproceedings{Ledesm:BWMC2004:A_Tissue_P_System_an:04,
author={Lucas Ledesma and Daniel Manrique and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s
Silva},
title={A Tissue {P} system and a {DNA} Microfluidic Device for Solving the Shortest
Common Superstring Problem},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={281--291}
}
@inproceedings{Cienciala:P_Automata_Priorities_Working:WMC5:2004,
author={Ludek Cienciala},
title={{P} Automata with Priorities Working in Sequential and Maximally Parallel
Mode},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={186--195}
}
@inproceedings{Gheorghe:FISCC:2004,
author={M. Gheorghe and N. Krasnogor and Gh. Paun and G. Rozenberg},
title={Membrane computing model for tiles self-assembly},
booktitle={First Intern. Symp. on Cellular Computing, Warwick},
year={2004},
month={December}
}
@inproceedings{Gheorghe:Modelling_Language:UPP04:2004,
author={Marian Gheorghe},
title={{P} systems: A modelling language},
booktitle={Pre-Proc. Unconventional Programming Paradigms, UPP04, Le Mont Saint-Michel},
year={2004},
month={September},
pages={23--27}
}
@inproceedings{PerezJ:WUMC:Comput_complexity:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez},
title={An Approach to Computational Complexity in Membrane Computing},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Perez-Jimenez:Complexity_Clsses:WMC5:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez},
title={Complexity Clsses in Membrane Computing},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={63--63}
}
@inproceedings{Pere:BWMC2004:A_CLIPS_Simulator_fo:04,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco-Jos{\'e} Romero-Campero},
title={A {CLIPS} Simulator for Recognizer {P} systems with Active Membranes},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={387--413}
}
@inproceedings{Perez-Jimenez:Trading_Polarizations:WMC5:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco-Jos{\'e} Romero-Campero},
title={Trading Polarizations for Bi-stable Catalysts in {P} systems with Active
Membranes},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={327--342}
}
@inproceedings{Pere:BWMC2004:Solving_the_BINPACKI:04,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco-Jos{\'e} Romero-Campero},
title={Solving the {BINPACKING} Problem by Recognizer {P} systems with Active Membranes},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={414--430}
}
@inproceedings{Cavaliere:WUMC:Handling_Imprecision:2004,
author={Matteo Cavaliere},
title={Modelling Biological Processes in {P} systems: Handling Imprecision and
Constructing New Models},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Cavaliere:Towards_Asynchronous_P:WMC5:2004,
author={Matteo Cavaliere},
title={Towards Asynchronous {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={161--173}
}
@inproceedings{Cavali:BWMC2004:P_Systems_with_Sympo:04,
author={Matteo Cavaliere and Daniela Genova},
title={{P} systems with Symport/Antiport of Rules},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={102--116}
}
@inproceedings{Cavaliere:Inhibiting/de-inhibiting_Rules:WMC5:2004,
author={Matteo Cavaliere and Mihai Ionescu and Tseren-Onolt Ishdorj},
title={Inhibiting/de-inhibiting Rules in {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={174--183}
}
@inproceedings{Margenstern:About_P_Systems_and_Lambda:WMC5:2004,
author={Maurice Margenstern with L. Colson and Natasha Jonoska and Gheorghe P{\u a}un},
title={About {P} systems and $\lambda$-{C}alculus},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={44--62}
}
@inproceedings{Margenstern:About_P_Systems_with_Minimal:WMC5:2004,
author={Maurice Margenstern and Vladimir Rogozhin and Yurii Rogozhin and Sergey
Verlan},
title={About {P} systems with Minimal Symport/Antiport Rules and Four Membranes},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={283--294}
}
@inproceedings{Guti:BWMC2004:An_Efficient_Cellula:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={An Efficient Cellular Solution for the {Partition} {Problem}},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={237--246}
}
@inproceedings{Guti:BWMC2004:Towards_a_Programmin:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Towards a Programming Language in Cellular Computing},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={247--257}
}
@inproceedings{Gutierrez:On_Descriptive_Complexity:WMC5:2004,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={On Descriptive Complexity of {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={245--255}
}
@inproceedings{Guti:BWMC2004:Deductive_Databases_:04,
author={Miguel A. Guti{\'e}rrez-Naranjo and Vladimir Rogozhin},
title={Deductive Databases and {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={258--263}
}
@inproceedings{Ionesc:BWMC2004:On_P_Systems_with_Pr:04,
author={Mihai Ionescu and Dragos Sburlan},
title={On {P} systems with Promoters/Inhibitors},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={264--280}
}
@inproceedings{Moya:WUMC:Plasma_membrane:2004,
author={O. Moya-Mesa},
title={Plasma membrane, compartmentation, transport, and imprecisions},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Andrei:Rewriting_P_Systems_in:WMC5:2004,
author={Oana Andrei and Gabriel Ciobanu and Dorel Lucanu},
title={Rewriting {P} systems in Maude},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={104--118}
}
@inproceedings{Michel:Analysis_of_the_Needham:WMC5:2004,
author={Olivier Michel and Florent Jacquemard},
title={Analysis of the {Needham}-{Schroeder} public-key protocol with {MGS}},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={295--315}
}
@inproceedings{Ibarra:Recent_Results:UPP04:2004,
author={Oscar H. Ibarra},
title={{P} systems: Some recent results and research problems},
booktitle={Pre-Proc. Unconventional Programming Paradigms, UPP04, Le Mont Saint-Michel},
year={2004},
month={September},
pages={47--54}
}
@inproceedings{Frisco:BWMC2004:About_P_Systems_with:04,
author={Pierluigi Frisco},
title={About {P} systems with Symport/Antiport},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={224--236}
}
@inproceedings{Ceterchi:Sim_Parallel_Architectures:WMC5:2004,
author={Rodica Ceterchi and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Simulating Parallel Architectures with {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={184--185}
}
@inproceedings{Ceterchi:ICCC2004:A_perfect_shuffle_algorithm:04,
author={Rodica Ceterchi and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={A perfect shuffle algorithm for reduction processes and its simulation with
{P} systems},
booktitle={International Conference on Computers and Communications-ICCC 2004, Baile
Felix Spa, Oradea, ROMANIA},
year={2004},
month={May 27-29},
address={Oradea, ROMANIA}
}
@inproceedings{Ceterc:BWMC2004:Simulating_Shuffle-E:04,
author={Rodica Ceterchi and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Simulating Shuffle-Exchange Networks with {P} systems},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={117--129}
}
@inproceedings{Freund:Asynchronous_P_Systems:WMC5:2004,
author={Rudolf Freund},
title={Asynchronous {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={12--28}
}
@inproceedings{Freund:P_sequentiellen,
author={Rudolf Freund},
title={P systeme im sequentiellen Modus},
booktitle={Workshop Formale Methoden der Linguistik, and 14 Theorietag Automaten und
Formale Sprachen},
year={2004},
address={Potsdam},
pages={57--61}
}
@inproceedings{Freund:BWMC2004:Sequential_P_Systems:04,
author={Rudolf Freund and Alberto Leporati and Marion Oswald and Claudio Zandron},
title={Sequential {P} systems with Unit Rules and Energy Assigned to Membranes},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={168--182}
}
@inproceedings{Freund:BWMC2004:P_Systems_with_Activ:04,
author={Rudolf Freund and Andrei P{\u a}un},
title={{P} systems with Active Membranes and without Polarizations},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={193--205}
}
@inproceedings{Freund:BWMC2004:Tissue-like_P_System:04,
author={Rudolf Freund and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Tissue-like {P} systems with Channel-States},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={206--223}
}
@inproceedings{Freund:BWMC2004:P_Systems_with_Antip:04,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Antiport Rules for Evolution Rules},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={183--192}
}
@inproceedings{Freund:Modelling_GS:MTA:2004,
author={Rudolf Freund and Marion Oswald},
title={Modelling grammar systems by tissue {P} systems},
booktitle={Pre-Proceedings of Workshop on Grammar Systems, Computer and Automation
Research Institute (SZTAKI) of the Hungarian Academy of Sciences (MTA)},
year={2004},
month={July 5-9},
address={Budapest},
pages={162--179}
}
@inproceedings{Freund:P_Systems_Generating_Trees:WMC5:2004,
author={Rudolf Freund and Marion Oswald and Andrei P{\u a}un},
title={{P} systems Generating Trees},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={221--232}
}
@inproceedings{Aguzzoli:WUMC:t_norm_approach:2004,
author={S. Aguzzoli and D. Besozzi and B. Gerla and C. Manara},
title={{P} systems with vague boundaries: the t-norm approach},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Aguzzoli:WUMC:tansmembrane_proteins:2004,
author={S. Aguzzoli and I.I. Ardelean and D. Besozzi and B. Gerla and C. Manara},
title={{P} systems under uncertainty: the case of transmembrane proteins},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Krishna:Universality_with_RBC-like:WMC5:2004,
author={Shankara-Narayanan Krishna},
title={Universality with {RBC}-like objects},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={256--267}
}
@inproceedings{Nishida:WUMC:Approximate_algorithm:2004,
author={Taishin Yasunobu Nishida},
title={An approximate algorithm for {NP}-complete optimization problems exploiting
{P} systems},
booktitle={First brainstorming Workshop on Uncertainty in Membrane Computing, Palma
de Mallorca, Spain, November 2004},
year={2004}
}
@inproceedings{Nishida:8_SCI_2004:New_Alg_NP_Complete_Opt:2004,
author={Taishin Yasunobu Nishida},
title={An application of {P} systems: {A} new algorithm for {NP}-complete optimization
problems},
booktitle={Proceedings of the 8th World Multi-Conference on Systems, Cybernetics and
Informatics, vol. V, 2004},
year={2004},
editor={N. Callaos, et. al.},
pages={109--112}
}
@inproceedings{Prakash:Simulating_Boolean:WMC5:2004,
author={V.J. Prakash and Kamala Krithivasan},
title={Simulating Boolean Circuits with Tissue {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={343--359}
}
@inproceedings{Manca:On_the_Dynamics_of_P:WMC5:2004,
author={Vincenzo Manca},
title={On the Dynamics of {P} systems},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={29--43}
}
@inproceedings{Rogozhin:ICCC2004:Simulation_of_mobile:2004,
author={Vladimir Rogozhin and Elena Boian},
title={Simulation of mobile ambients by tissue {P} systems with a dynamic network
of membranes},
booktitle={International Conference on Computers and Communications-ICCC 2004, Baile
Felix Spa, Oradea, ROMANIA},
year={2004},
month={May 27-29},
address={Oradea, ROMANIA}
}
@inproceedings{Rogozh:BWMC2004:Simulation_of_Mobile:04,
author={Vladimir Rogozhin and Elena Boian},
title={Simulation of Mobile Ambients by {P} systems. {P}art 2},
booktitle={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February
2-7 2004},
year={2004},
month={February 2-7},
address={Sevilla, Spain},
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez and
Fernando Sancho-Caparrini},
pages={431--442}
}
@inproceedings{Kowczynski:Economic_Systems:CTMDT:2004,
author={W. Kowczynski},
title={On a model of economic systems},
booktitle={Proceedings of the Second Conference on Tools and Methods of Data Transformation},
year={2004},
organization={WSU Kielce}
}
@inproceedings{Kowczynski:Reconstruction_Problem:CTMDT:2004,
author={Waldemar Korczynski and G. Wawrzola and S. Wawrzola},
title={On a reconstruction problem for membrane systems},
booktitle={Proceedings of the Second Conference on Tools and Methods of Data Transformation},
year={2004},
organization={WSU Kielce}
}
@inproceedings{Qi:SCC:2004,
author={Z. Qi and R. Rao and G. Xue and J. You},
title={A new formal model based on P systems for mobile transactions},
booktitle={Proc. IEEE Intern. Conf. on Services Computing, SCC2004},
year={2004},
pages={16--22}
}
@inproceedings{Dang:Sequential_parallel_models:DCFS:2004,
author={Zhe Dang and Oscar H. Ibarra},
title={On {P} systems operating in sequential and limited parallel modes},
booktitle={Workshop on Descriptional Complexity of Formal Systems},
year={2004},
address={London-Ontario}
}
@inproceedings{Qi:Specification_and_Execution:WMC5:2004,
author={Zhengwei Qi and Cheng Fu and Dongyu Shi and Jinyuan You},
title={Specification and Execution of {P} systems with Symport/Antiport Rules Using
Rewriting logic},
booktitle={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5), Milano,
Italy, June 2004},
year={2004},
month={June},
address={Milano, Italy},
pages={363--371}
}
@inproceedings{Qi:Membrane_Calculus:GCC:2004,
author={Zhengwei Qi and Cheng Fu and Dongyu Shi and Jinyuan You and M. Li},
title={Membrane calculus. {A} formal method for grid transactions},
booktitle={Proceedings of the 3rd International Conference on Grid and Cooperative
Computing, GCC 2004},
year={2004},
address={Wuhan, China}
}
@inproceedings{Alhazov:ProtonBicat:PreWMC6:2005,
author = {Artiom Alhazov},
title = {Number of Proton/Bi-stable Catalysts and Membrane in {P} Systems. {T}ime Freeness},
editor = {Rudolf Freund and Georg Lojka and Marion Oswald and {\relax Gh}eorghe P{\u a}un},
booktitle = {Pre-Proc. of the Sixth Workshop on Membrane Computing},
address = {Vienna, Austria},
year = {2005},
pages = {102--122},
abstract = {Proton pumping P systems are a variant of membrane systems with
both rewriting rules and symport/antiport rules, where a set of objects
called protons is distinguished, every cooperative symport or antiport
rule involves a proton, but no rewriting rule does. Time-freeness property
means the result of all computations does not depend on the rules
execution times.
This article's aim is to improve (showing that two membranes are
sufficient) the known universality results on proton pumping P systems
establishing at the same time an upper bound on the number of
protons, namely one, or four for time-free systems.
All results mentioned are valid for proton pumping P systems with
non-cooperative rewriting and either symport/antiport rules of weight
1 (classical variant) or symport rules of weight at most 2. As a corollary
we obtain the universality of P systems with one membrane and
one bi-stable catalyst, or the universality of time-free P systems with
one membrane and four bi-stable catalysts. All universality results are
stated as generating RE (except the time-free systems without targets
generate PsRE).},
url = {http://www.emcc.at/WMC6/WMC6PreProcFull.pdf},
}
@inproceedings{Alhazov.etal:PolarCreaOC:PreTAPS2005,
author = {Artiom Alhazov and Rudolf Freund
and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title = {One and Two Polarizations, Membrane Creation
and Objects Complexity in {P} Systems},
editor = {Gabriel Ciobanu and {\relax Gh}eorghe P{\u a}un},
booktitle = {Pre-Proc. of First International Workshop on Theory
and Application of P Systems},
address = {Timi{\c s}oara, Romania},
year = {2005},
pages = {9--18},
abstract = {We improve, by using register machines, some
existing universality results for specific models of P systems.
P systems with membrane creation are known to generate all
recursively enumerable sets of vectors of non-negative integers
even when no region (except the environment) contains more than
one object of the same kind. We here show that they generate
all recursively enumerable languages, and two membrane labels
are sufficient (the same result holds for accepting all recursively
enumerable vectors of non-negative integers). Moreover, at most
two objects are present inside the system at any time in the
generative case. Then we prove that 10+m symbols are enough
to generate any recursively enumerable language over m symbols.
P systems with active membranes and without polarizations
are known to generate all recursively enumerable sets of vectors
of non-negative integers. We show that they generate all
recursively enumerable languages, and four starting membranes
with three labels or seven starting membranes with two labels are
sufficient. P systems with active membranes and two polarizations
are known to generate/accept all recursively enumerable sets of
vectors of non-negative integers, only using rewriting-like rules
and rules of sending objects out. We show that accepting can be
done by even deterministic systems. Finally, a number of remarks
and open questions is presented.},
url = {http://psystems.disco.unimib.it/download/volTAPS.pdf},
}
@inproceedings{Alhazov.etal:PCarpet:PreWMC6:2005,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald},
title = {Symbol / Membrane Complexity of {P} Systems
with Symport / Antiport Rules},
editor = {Rudolf Freund and Georg Lojka and Marion Oswald
and {\relax Gh}eorghe P{\u a}un},
booktitle = {Pre-Proc. of the Sixth Workshop on Membrane Computing},
address = {Vienna, Austria},
year = {2005},
pages = {123--146},
abstract = {We consider P systems with symport / antiport rules and small
numbers of symbols and membranes and present several results for
P systems with symport / antiport rules simulating register machines
with the number of registers depending on the number s of symbols and
the number m of membranes. For instance, any recursively enumerable
set of natural numbers can be generated (accepted) by systems with s> = 2 symbols and m>=1 membranes such that m+s>=6. In particular
the result of the original paper [16] proving universality for three
symbols and four membranes is improved (e.g., three symbols and three
membranes are sufficient). The general results that P systems with
symport / antiport rules with s symbols and m membranes are able to
simulate register machines with max{m(s-2),(m-1)(s-1)} registers
also allows us to give upper bounds for the numbers s and
m needed to generate/accept any recursively enumerable set of k-
dimensional vectors of non-negative integers or to compute any partial
recursive function f:N^a->N^b. Finally, we also study the computational
power of P systems with symport / antiport rules and only
one symbol: with one membrane, we can exactly generate the family
of finite sets of non-negative integers; with one symbol and two
membranes, we can generate at least all semilinear sets. The most interesting
open question is whether P systems with symport / antiport
rules and only one symbol can gain computational completeness (even
with an arbitrary number of membranes) as it was shown for tissue P
systems in [1].},
url = {http://www.emcc.at/WMC6/WMC6PreProcFull.pdf},
}
@inproceedings{Gutierrez:1stWTAPSys:2005,
author = {M. A. Guti{\'e}rrez-Naranjo and M. J. Perez-Jimenez and A. Riscos-Nunez and F.
J. Romero-Campero},
title = {Characterizing Tractability with Membrane Creation},
booktitle = {in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year = {2005},
pages = {61-68},
}
@inproceedings{Leporati:Quantum:WMC6:2005,
author={A. Leporati and G. Mauri and C. Zandron},
title={Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={465-484}
}
@inproceedings{Obtulowicz:Relational:WMC6:2005,
author={A. Obtulowicz},
title={Relational Membrane Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={505-509}
}
@inproceedings{Profir:1stWTAPSys:2005,
author={A. Profir and E. Gutuleac and E. Boian},
title={Simulation of Continuous-time P Systems using Descriptive Rewriting Timed
Petri Nets},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={91-94}
}
@inproceedings{Obtulowicz:Gandy's_principles:EFS_EWCC:2005,
author={Adam Obtulowicz},
title={Gandy's principles for mechanisms and membrane computing},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={267--276}
}
@inproceedings{Obtulowicz:Gandy's_principle_for_MC:3BWMC:2005,
author={Adam Obtulowicz},
title={Gandy's principle for mechanisms and membrane computing},
booktitle={Third Brainstorming Week on Membrane Computing, Sevilla, 2005},
year={2005},
address={Sevilla}
}
@inproceedings{Leporati:solve_3-SAT:EFS_EWCC:2005,
author={Alberto Leporati and Claudio Zandron},
title={A family of {P} systems which solve 3-{SAT}},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={247--256}
}
@inproceedings{Ortega:Christiansen_grammar:3BWMC:2005,
author={Alfonso Ortega de la Puente and Rafael N{\'u}{\~n}ez-Herv{\'a}s and Marina de la Cruz-Echeandia
and Manuel Alfonseca},
title={Christiansen grammar for some {P} systems},
booktitle={Third Brainstorming Week on Membrane Computing, Sevilla, 2005},
year={2005},
address={Sevilla}
}
@inproceedings{Alhazov:MPMRSbrowser:BWMC2005,
author = {Artiom Alhazov},
title = {Maximally Parallel Multiset-Rewriting Systems: Browsing the Configurations},
editor = {Miguel-Angel Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco-Jos{\'e} Romero-Campero and Drago{\c s} Sburlan},
booktitle = {Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {1--10},
abstract = {The aim of this research is to produce an algorithm
for the software that would let a researcher to observe the evolution
of maximally parallel multiset-rewriting systems
with permitting and forbidding contexts, browsing
the configuration space by following transitions
like following hyperlinks in the World-Wide Web.
The relationships of maximally parallel multiset-rewriting systems
with other rewriting systems are investigated, such as Petri nets
different kinds of P systems, Lindenmayer systems
grammar systems, regulated grammars.},
url = {http://www.gcn.us.es/3BWMC/Volumen.htm},
}
@inproceedings{Alhazov:SAT_SAdiv:ESF2005,
author = {Artiom Alhazov},
title = {Solving {SAT} by Symport/Antiport {P} Systems with Membrane Division},
booktitle = {Proceedings of the {ESF} {E}xploratory {W}orkshop
on {C}ellular {C}omputing ({C}omplexity {A}spects)},
editor = {Miguel-Angel Guti{\'e}rrez-Naranjo and {\relax Gh}eorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {1--6},
abstract = {We present an O(n)+O(log m)-time solution of SAT with n variables
and m clauses by a uniform family of deterministic P systems with
communication rules (antiport-2/1 and antiport-1/2) and
membrane division rules (without polarization) and
unstructured environment. Nothing is sent to the environment
except yes or no, in one copy. We can even start
with the empty environment if we also use symport-1 rules.},
eprint = {http://aartiom.50webs.com/articles/28fenix-1_ESF.pdf},
}
@inproceedings{Alhazov.Cavaliere:ECTimeFree:BWMC2005,
author = {Artiom Alhazov and Matteo Cavaliere},
title = {Evolution-Communication {P} Systems: Time-Freeness},
booktitle = {Proceedings of the {T}hird {B}rainstorming {W}eek
on {M}embrane {C}omputing},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {11--18},
abstract = {Membrane computing is a (biologically motivated) theoretical
framework of distributed parallel computing. If symbol-objects are considered
then membrane systems (also called P systems) are distributed multiset processing systems. In evolution-communication (EC) P systems the computation
is carried out with the use of non-cooperative rewriting rules and with
(usually the minimally cooperative) transport rules.
The goal of this article is to improve the existing results
on evolution-communication P systems. It is known that EC P systems
with 2 membranes are universal, and so are time-free EC P systems
with targets with 3 membranes. We prove that any recursively
enumerable set of vectors of nonnegative integers can be generated
by time-free EC P systems (without targets) with 2 membranes
thus improving both results.},
url = {http://www.gcn.us.es/3BWMC/Volumen.htm},
}
@inproceedings{Alhazov.Freund:SA1m5s:BWMC2005,
author = {Artiom Alhazov and Rudolf Freund},
title = {P Systems with One Membrane and Symport/Antiport Rules
of Five Symbols are Computationally Complete},
booktitle = {Proceedings of the {T}hird {B}rainstorming {W}eek
on {M}embrane {C}omputing},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {19--28},
abstract = {We consider P systems with only one membrane
using symport/antiport rules and prove that any recursively enumerable
set of k-dimensional vectors of natural numbers can be
generated (accepted) by using at most k+4 symbols; hence
any recursively enumerable set of natural numbers can be
generated (accepted) by using at most five symbols.},
url = {http://www.gcn.us.es/3BWMC/Volumen.htm},
}
@inproceedings{Alhazov.etal:tCarpet:ESF2005,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald},
title = {Tissue {P} Systems with Antiport Rules and Small Numbers
of Symbols and Cells},
booktitle = {Proceedings of the {ESF} {E}xploratory {W}orkshop
on {C}ellular {C}omputing
({C}omplexity {A}spects)},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {7--22},
abstract = {We consider tissue P systems with antiport rules
and investigate their computational power when using only
a (very) small number of symbols and cells. Even when
using only one symbol, any recursively enumerable set
of natural numbers can be generated with at most seven cells.
On the other hand, with only one cell we can only generate
regular sets when using one channel with the environment
whereas one cell with two channels between the cell
and the environment obtains computational completeness with
at most five symbols. Between these extreme cases
of one symbol and one cell, respectively, there is a trade-off
between the number of cells and the number of symbols, e.g.
for the case of tissue P systems with two channels between
a cell and the environment we show that computational completeness
can be obtained with two cells and three symbols
as well as with three cells and two symbols, respectively.},
eprint = {http://aartiom.50webs.com/articles/29fenix-7_ESF.pdf},
}
@inproceedings{Alhazov.etal:OptMincoo2m:ESF2005,
author = {Artiom Alhazov and Rudolf Freund and {\relax Yu}rii Rogozhin},
title = {Some Optimal Results on Symport/Antiport {P} Systems
with Minimal Cooperation},
booktitle = {Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects)},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {23--36},
abstract = {We prove that two classes of symport/antiport P systems
with two membranes and with minimal cooperation, namely P systems
with symport/antiport rules of size one and P systems
with symport rules of size two, are computationally complete:
(modulo the terminal alphabet) they generate all
recursively enumerable sets of vectors of nonnegative integers.
On the other hand, it is known that these systems with one
membrane cannot be universal.
Hence, the results we prove are optimal.},
eprint = {http://aartiom.50webs.com/articles/30fenix-23_ESF.pdf},
}
@inproceedings{Alhazov.Verlan:SCarpetsDncoo:ESF2005,
author = {Artiom Alhazov and Sergey Verlan},
title = {Sevilla Carpets of Deterministic Non-Cooperative {P} Systems},
booktitle = {Proceedings of the {ESF} {E}xploratory {W}orkshop
on {C}ellular {C}omputing ({C}omplexity {A}spects)},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {53--60},
abstract = {A Sevilla carpet is a graphical representation
of the sequence of multisets of rules applied at every step
of the evolution of a P system. This paper is devoted to
the research of the shape of Sevilla carpets.
The case of deterministic non-cooperative systems is considered
and a characterization of Sevilla carpets is given.},
eprint = {http://aartiom.50webs.com/articles/32fenix-53_ESF.pdf},
}
@inproceedings{Alhazov.Rogozhin:Mincoo1m:BWMC2005,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Minimal Cooperation in Symport/Antiport {P} Systems with One Membrane},
booktitle = {Proceedings of the {T}hird {B}rainstorming {W}eek
on {M}embrane {C}omputing},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {29--34},
abstract = {In this paper we consider symport/antiport P systems
with one membrane and rules having at most two objects.
Although it has been proved that only finite number
sets can be generated by both OP_1(sym_2) (one-membrane systems
with symport rules of weight at most 2) and OP_1(sym_1,anti_1)
(one-membrane systems with symport/antiport rules of weight 1)
the exact characterization is still an open question. We give some lower
bounds, consider a few extensions, and state some open questions.},
url = {http://www.gcn.us.es/3BWMC/Volumen.htm},
}
@inproceedings{Alhazov.etal:tSAmincoo:ESF2005,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin and Sergey Verlan},
title = {Symport/Antiport Tissue {P} Systems with Minimal Cooperation},
booktitle = {Proceedings of the {ESF} {E}xploratory {W}orkshop
on {C}ellular {C}omputing ({C}omplexity {A}spects)},
address = {Sevilla, Spain},
publisher = {F{\'e}nix Editora},
year = {2005},
pages = {37--52},
abstract = {We investigate tissue P systems with symport/antiport
with minimal cooperation, i.e., when only two objects may interact.
We show that 2 cells are enough in order to generate all
recursively enumerable sets of numbers. Moreover, the constructed
systems simulate register machines and have a purely deterministic behavior.
We also investigate systems with one cell and we show that
they may generate only finite sets of numbers.},
eprint = {http://aartiom.50webs.com/articles/31fenix-37_ESF.pdf},
}
@inproceedings{Csuhaj:Editing_configurations:3BWMC:2005,
author={C. Csuhaj-Varj{\'u} and Antonio Di Nola and Gheorghe P{\u a}un and Mario Jes{\'u}s
P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil},
title={Editing configurations of {P} systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={131--154}
}
@inproceedings{Graciani:Numerical_decision_problems:CiE2005:2005,
author={C. Graciani and Agust{\'i}n Riscos-Nunez},
title={Looking for simple common schemes to design recognizer P systems with active
membranes that solve numerical decision problems},
booktitle={CiE2005: New Computational Paradigms},
year={2005},
address={Amsterdam}
}
@inproceedings{Li:ICALP05:2005,
author={C. Li and Z. Dang and O. Ibarra and H.C. Yen},
title={Signaling P Systems and Verification Problems},
booktitle={ICALP'05},
year={2005},
month={, July 11-15}
}
@inproceedings{Li:LNCS3586:2005,
author={C. Li and Z. Dang and O.H. Ibarra and H.-C. Yen},
title={Signaling P Systems and Verification Problems},
booktitle={Proceedings of ICALP 2005},
year={2005},
publisher={Springer},
pages={1462--1473},
series={LNCS 3586}
}
@inproceedings{Graciani:Looking_for_Simple:4thUC:2005,
author={Carmen Graciani-D{\'i}az and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={Looking for Simple Common Schemes to Design Recognizer {P} Systems with
Active Membranes That Solve Numerical Decision Problems},
booktitle={Unconventional Computation 4th International Conference, UC 2005, Sevilla,
Spain, October 3-�7, 2005. Proceedings},
year={2005},
publisher={Springer Berlin / Heidelberg},
abstract={Earlier solutions to decision problems by means of P systems used many counter
objects to control the synchronization of different stages in a computation
(usually as many counters as the stage must last in the worst case). In
this paper we propose a way to replace those counters with some spacial
objects for each stage. Furthermore, following the ideas presented in [1],
in order to have a common scheme to attack numerical problems, all instances
of a problem with the same size are solved by the same P system (which
depends on the size) given an input which describes the corresponding instance
of the problem. We illustrate these ideas with a cellular solution to the
Subset-Sum problem.},
series={Lecture Notes in Computer Science},
volume={3699}
}
@inproceedings{Bonchis:WebPS:3BWMC:2005,
author={Cosmin Bonchis and Cornel Isbasa and Dana Petcu and Gabriel Ciobanu},
title={{WebPS}: A web-based {P} system simulator with query facilities},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={63--72}
}
@inproceedings{Bonchis:A_Web-Based:4thUC:2005,
author={Cosmin Bonchis and Gabriel Ciobanu and Cornel Izbasa and Dana Petcu},
title={A Web-Based {P} Systems Simulator and Its Parallelization},
booktitle={Unconventional Computation 4th International Conference, UC 2005, Sevilla,
Spain, October 3-�7, 2005. Proceedings},
year={2005},
publisher={Springer Berlin / Heidelberg},
abstract={In this paper we present WebPS, an open-source web-enabled simulator for
P systems, and a P accelerator for parallelization of the existing sequential
simulators. The simulator is based on CLIPS, and it is already available
as a web application. The P accelerator is used to parallelize the existing
sequential simulators of the P systems. We exemplify this tool by using
a simple CLIPS simulator. The speedup and the efficiency of the resulting
parallel implementation are surprisingly close to the ideal ones. Combining
these two ingredients, we get a complex and ready-to-use parallel simulator
for P systems; no installation are required, no previous knowledge of operating
systems, parallel programming or specific software.},
series={Lecture Notes in Computer Science},
volume={3699}
}
@inproceedings{Lopez:Editing:WMC6:2005,
author={D. Lopez and J.M. Sempere},
title={Editing Distances between Membrane Structures},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={485-504}
}
@inproceedings{Pescini:1stWTAPSys:2005,
author={D. Pescini and D. Besozzi and G. Mauri},
title={Investigating Local Evolutions in Dynamical Probabilistic P Systems},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={83-90}
}
@inproceedings{Sburlan:Modeling:WMC6:2005,
author={D. Sburlan},
title={Modeling the Dynamical Parallelism of Bio-Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {{WMC6}}, Vienna,
Austria},
year={2005},
pages={517-529}
}
@inproceedings{Sburlan:NonCooperative:WMC6:2005,
author={D. Sburlan},
title={Non-cooperative P Systems with Priorities Characterize PsET0L},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={530-539}
}
@inproceedings{Pescini:Dynamical_probabilistic:3BWMC:2005,
author={Dario Pescini and Daniela Besozzi and Claudio Zandron and Giancarlo Mauri},
title={Dynamical probabilistic {P} systems: Definitions and applications},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={275--288}
}
@inproceedings{Sburlan:Further_results:3BWMC:2005,
author={Dragos Sburlan},
title={Further results on {P} systems with promoters/inhibitors},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={289--304}
}
@inproceedings{Csuhaj:EP-colonies:3BWMC:2005,
author={Erzs{\'e}bet Csuhaj-Varj{\'u}},
title={{EP}-colonies: Micro-organisms in a cell-like environment},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={123--130}
}
@inproceedings{Arroyo:Software:WMC6:2005,
author={F. Arroyo and J. Castellanos and L. Fernandez and V.J. Martinez and L.F.
Mingo},
title={Software Tools/ P System Simulators Interoperability},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={147-161}
}
@inproceedings{Bernardini:1stWTAPSys:2005,
author={F. Bernardini and F. J. Romero-Campero and M. Gheorghe and M. J. Perez-Jimenez
and M. Margenstern and S. Verlan and N. Krasnogor},
title={On P Systems with Bounded Parallelism},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={31-36}
}
@inproceedings{Bernardini:LNCS3536:2005,
author={F. Bernardini and M. Gheorghe and N. Krasnogor and G. Terrazas},
title={Membrane computing. Current results and future problems, New Computational
Paradigms},
booktitle={First Conf. on Computability in Europe, CiE2005, Amsterdam},
year={2005},
publisher={Springer},
editor={S. Barry Cooper, B. Lowe and L. Torenvliet},
pages={49--53},
series={LNCS 3536}
}
@inproceedings{Bernardini:OnPSystems:WMC6:2005,
author={F. Bernardini and M. Gheorghe and N. Krasnogor and R.C. Muniyandi and M.J
Perez Jimenez and F.J. Romero Campero},
title={On P Systems as a Modelling Tool for Biological Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={193-213}
}
@inproceedings{Bernardini:On_Self-assembly:4thUC:2005,
author={Francesco Bernardini and Marian Gheorghe and Natalio Krasnogor and Jean-Louis
Giavitto},
title={On Self-assembly in Population {P} Systems},
booktitle={Unconventional Computation 4th International Conference, UC 2005, Sevilla,
Spain, October 3-�7, 2005. Proceedings},
year={2005},
publisher={Springer Berlin / Heidelberg},
abstract={We introduce a model of self-assembly P systems as devices that use some
of the features of population P systems to progressively grow a graph structure
by forming new bonds between the existing cells and some new cells which
are brought into the system step by step. The new cells are then able to
self-assemble locally either at the level of cells or at the level of neighbourhoods
of cells by using bond-making rules according to a specific self-assembly
model. We describe two self-assembly models, called respectively parallel
single-point self-assembly and parallel multi-point self-assembly. Then,
we precisely state the problem of programmable self-assembly for P systems
as the problem of uniquely generating a given graph by means of self-assembly
P systems. In this respect, we show how to define a self-assembly P systems
that uniquely generates a complete binary tree by using a "minimal" set
of resources.},
series={Lecture Notes in Computer Science},
volume={3699}
}
@inproceedings{Bernardini:Turing_machines:EFS_EWCC:2005,
author={Francesco Bernardini and Marion Gheorghe and N. Krasnogor and Gheorghe P{\u a}un},
title={Turing machines with cells on the tape},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={61--74}
}
@inproceedings{BelEnguix:1stWTAPSys:2005,
author={G. Bel Enguix and D. Jimenez Lopez},
title={Modelling Parallel Phenomena in Conversations with {P} Systems},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={27-30}
}
@inproceedings{Bel_Enguix:LPColonies:WMC6:2005,
author={G. Bel Enguix and M.D. Jimenez Lopez},
title={LP Colonies for Language Evolution. A Preview},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={179-192}
}
@inproceedings{BelEnguix:LCMAS:2005,
author={G. Bel Enguix and M.D. Jimenez-Lopez},
title={Computing dialogues with membranes},
booktitle={Logic and Communication in Multi-Agent Systems},
year={2005},
series={LCMAS}
}
@inproceedings{Ciobanu:Structural:WMC6:2005,
author={G. Ciobanu and O. Andrei and D. Lucanu},
title={Structural Operational Semantics of P Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={1-23}
}
@inproceedings{Ciobanu:Algebraic:WMC6:2005,
author={G. Ciobanu and V.M. Gontineac},
title={Algebraic and Coalgebraic Aspects of Membrane Computing},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={289-311}
}
@inproceedings{Franco:Modeling:WMC6:2005,
author={G. Franco and N. Jonoska and B. Osborn and A. Plaas},
title={Modeling Knee Injuries by Membrane Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005}
}
@inproceedings{Terrazas:LNCS3536:2005,
author={G. Terrazas and N. Krasnogor and M. Gheorghe and F. Bernardini and S. Diggle
and M. Camara},
title={An environment aware P system model of quorum sensing, New Computational
Paradigms.},
booktitle={First Conf. on Computability in Europe, CiE2005, Amsterdam},
year={2005},
publisher={Springer},
editor={S. Barry Cooper, B. Lowe and L. Torenvliet},
pages={479--485},
series={LNCS 3536}
}
@inproceedings{Ciobanu:P_accelerators:EFS_EWCC:2005,
author={Gabriel Ciobanu and Dana Petcu},
title={P accelerators: Parallelization of sequential simulators},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={177--186}
}
@inproceedings{Ciobanu:branching_complexity:EFS_EWCC:2005,
author={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={On the branching complexity of {P} systems},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={165--176}
}
@inproceedings{Ciobanu:Mealy_membrane_automata:EFS_EWCC:2005,
author={Gabriel Ciobanu and M. Gontineac},
title={Mealy membrane automata and {P} systems complexity},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={149--164}
}
@inproceedings{Paun:1stWTAPSys:2005,
author={Gh. Paun},
title={Membrane computing. Basic ideas, results, applications},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={1-8}
}
@inproceedings{Paun:LNCS3536:2005,
author={Gh. Paun},
title={Membrane computing: power, efficiency, applications, New Computational Paradigms.},
booktitle={First Conf. on Computability in Europe, CiE2005, Amsterdam},
year={2005},
publisher={Springer},
editor={S. Barry Cooper, B. Lowe and L. Torenvliet},
pages={396--407},
series={LNCS 3536}
}
@inproceedings{Paun:Further_twenty_six_open_problems:3BWMC:2005,
author={Gheorghe P{\u a}un},
title={Further twenty six open problems in membrane computing},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={249--262}
}
@inproceedings{Paun:twenty_six_open_problems:3BWMC:2005,
author={Gheorghe P{\u a}un},
title={Further twenty-six open problems in membrane computing},
booktitle={Third Brainstorming Week on Membrane Computing, Sevilla, 2005},
year={2005},
address={Sevilla}
}
@inproceedings{Paun:One_more_universality_result:3BWMC:2005,
author={Gheorghe P{\u a}un},
title={One more universality result for {P} systems with objects on membranes},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={263--274}
}
@inproceedings{Casiraghi:Amembrane:WMC6:2005,
author={Giovanni Casiraghi and Claudio Ferretti and A. Gallini and Giancarlo Mauri},
title={A Membrane Computing System Mapped on an Asynchronous Distributed Computational
Environment},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={253-260}
}
@inproceedings{Vaszil:On_a_class_of_P_automata:3BWMC:2005,
author={Gy{\"o}rgy Vaszil},
title={On a class of {P} automata as a machine model for languages over infinite
alphabets},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={317--326}
}
@inproceedings{Ardelean:1stWTAPSys:2005,
author={I. Ardelean},
title={Could P Systems Model Energy-Sensing Behavior in Bacteria?},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={19-26}
}
@inproceedings{Ardelean:On_modelling_ion_fluxes:3BWMC:2005,
author={Ioan I. Ardelean and Daniela Besozzi},
title={On modelling ion fluxes across biological membranes with {P} systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={35--42}
}
@inproceedings{Nepomuceno:A_tool_for_using_the_SBML:3BWMC:2005,
author={Isabel Nepomuceno and J.A. Nepomuceno and Francisco Jos{\'e} Romero-Campero},
title={A tool for using the {SBML} format to represent {P} systems which model
biological reaction networks},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={219--228}
}
@inproceedings{Kleijn:TowardsaPetriNet:WMC6:2005,
author={J. Kleijn and M. Koutny and G. Rozenberg},
title={Towards a Petri Net Semantics for Membrane Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={439-460}
}
@inproceedings{Sempere:Recognizing_membrane_structures:3BWMC:2005,
author={Jos{\'e} M. Sempere and D. L{\'o}pez},
title={Recognizing membrane structures with tree automata},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={305--316}
}
@inproceedings{Bianco:Psystems:WMC6:2005,
author={L. Bianco and F. Fontana and V. Manca},
title={{P} Systems and the Modeling of Biochemical Oscillations},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={214-225}
}
@inproceedings{Bianco:ICNC05:2005,
author={L. Bianco and F. Fontana and V. Manca},
title={Reaction-driven membrane systems},
booktitle={ICNC'05, Changsha, China},
year={2005},
month={August}
}
@inproceedings{Bianco:Encoding:WMC6:2005,
author={L. Bianco and V. Manca},
title={Encoding-Decoding Classes of P Systems for the Methabolic Algorithm},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={226-234}
}
@inproceedings{Bianco:1stWTAPSys:2005,
author={L. Bianco and V. Manca and S. Zorzan},
title={Symbolic Representations of Biological Oscillations},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={37-44}
}
@inproceedings{Cardelli:Abstract_machines_of:3BWMC:2005,
author={L. Cardelli},
title={Abstract machines of systems biology (extended abstract)},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={73--86}
}
@inproceedings{Cardelli:An_universality_result:EFS_EWCC:2005,
author={L. Cardelli and Gheorghe P{\u a}un},
title={An universality result for a (mem)brane calculus based on mate/drip operations},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={75--94}
}
@inproceedings{Fernandez:1stWTAPSys:2005,
author={L. Fernandez and V.J. Martinez and F. Arroyo and L.F. Mingo},
title={A Hardware Circuit for Selecting Active Rules in Transition P Systems},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={45-48}
}
@inproceedings{Bianco:Metabolic_algorithm:3BWMC:2005,
author={Luca Bianco and Federico Fontana and Vincenzo Manca},
title={Metabolic algorithm with time-varying reaction maps},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={43--62}
}
@inproceedings{Alfonseca:Multithread:WMC6:2005,
author={M. Alfonseca and C. Castaneda Marroquin and M. De La Cruz Echeandia and
R. Nunez-Hervas and A. Ortega de la Puente},
title={Multithread Java {P} Systems Running on a Cluster of Computers},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={94-101}
}
@inproceedings{Ionescu:BooleanCircuits:WMC6:2005,
author={M. Ionescu and T.O. Ishdorjþ},
title={Boolean Circuits and a DNA Algorithm in Membrane Computing},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={410-438}
}
@inproceedings{Muskulus:Sevilla_complexity:EFS_EWCC:2005,
author={M. Muskulus},
title={An observation on the Sevilla complexity},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={257--266}
}
@inproceedings{Muskulus:First_steps_towards_a_geometry:3BWMC:2005,
author={M. Muskulus and R. Brijder},
title={First steps towards a geometry of computation},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={197--218}
}
@inproceedings{Gutierrez:OnThePower:WMC6:2005,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez Jimenez and A. Riscos Nunez and F.J.
Romero Campero},
title = {On the Power of Dissolution in P Systems with Active Membranes},
booktitle = {Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year = {2005},
pages = {373-394},
}
@inproceedings{Gutierrez:ALinearSolution:WMC6:2005,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez Jimenez and F.J. Romero Campero},
title = {A Linear Solution for QSAT with Membrane Creation},
booktitle = {Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year = {2005},
pages = {395-409},
}
@inproceedings{Guttierez-Naranjo:LNCS3561:2005,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez and F.J. Romero-Campero},
title = {A linear solution of subset sum problem by using membrane creation},
booktitle = {IWINAC 2005, Las Palmas de Gran Canaria},
year = {2005},
publisher = {Springer},
editor = {J. Mira and J.R. Alvarez},
pages = {258--267},
series = {LNCS 3561},
}
@inproceedings{Perez-Jimenez:IWINAC:2005,
author={M.J. Perez-Jimenez and F.J. Romero-Campero},
title={A study of the robustness of the EGFR signalling cascade using continuos
membrane systems},
booktitle={First Intern. Work-Conference on the Interplay between Natural and Artificial
Computation, IWINAC 2005},
year={2005},
address={Las Palmas de Gran Canaria}
}
@inproceedings{Pérez-Jiménez:complexity_aspects:EFS_EWCC:2005,
author={Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Computational complexity aspects of membrane computing: Ideas, results,
open problems},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={277--292}
}
@inproceedings{Cavaliere:Inhibiting:EFS_EWCC:2005,
author={Matteo Cavaliere and Mihai Ionescu and Tseren-Onolt Ishdorj},
title={Inhibiting/de-inhibiting {P} systems with active membranes},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={117--130}
}
@inproceedings{Cavaliere:Event-related_outputs:3BWMC:2005,
author={Matteo Cavaliere and Rudolf Freund and A. Leitsch and Gheorghe P{\u a}un},
title={Event-related outputs of computations in {P} systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={107--122}
}
@inproceedings{Cavaliere:Specifying_dynamic_software:3BWMC:2005,
author={Matteo Cavaliere and Vincenzo Deufemia},
title={Specifying dynamic software architectures by using membrane systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={87--106}
}
@inproceedings{Cavaliere:Further_results:EFS_EWCC:2005,
author={Matteo Cavaliere and Vincenzo Deufemia},
title={Further results on time-free {P} systems},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={95--116}
}
@inproceedings{GutierrezNaranjo:P_Systems_with:4thUC:2005,
author={Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco J. Romero-Campero},
title={{P} Systems with Active Membranes, Without Polarizations and Without Dissolution:
A Characterization of {P}},
booktitle={Unconventional Computation 4th International Conference, UC 2005, Sevilla,
Spain, October 3-�7, 2005. Proceedings},
year={2005},
publisher={Springer Berlin / Heidelberg},
abstract={We study the computational efficiency of recognizer P systems with active
membranes without polarizations and without dissolution. The main result
of the paper is the following: the polynomial computational complexity
class associated with the class of recognizer P systems is equal to the
standard complexity class P.},
series={Lecture Notes in Computer Science},
volume={3699}
}
@inproceedings{Gutiérrez:Converting_integer:EFS_EWCC:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Alberto Leporati and Claudio Zandron},
title={Converting integer numbers from binary to unary notation with {P} systems},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={201--208}
}
@inproceedings{Gutierrez:SolvingSAT_mem_Creation:CiE2005:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Francisco
Jos{\'e} Romero-Campero},
title={Solving {SAT} with membrane creation},
booktitle={CiE2005: New Computational Paradigms},
year={2005},
address={Amsterdam}
}
@inproceedings{Gutiérrez:and_rule_input:EFS_EWCC:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={P systems with membrane creation and rule input},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={209--224}
}
@inproceedings{Gutiérrez:A_simulator_for_confluent:3BWMC:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title={A simulator for confluent {P} systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={169--184}
}
@inproceedings{Gutiérrez:Multidimensional_Sev_C:EFS_EWCC:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Agust{\'i}n
Riscos-N{\'u}{\~n}ez},
title={Multidimensional Sevilla carpets associated with {P} systems},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={225--236}
}
@inproceedings{Gutiérrez:Simulating_avascular_tumors:3BWMC:2005,
author={Miguel Angel Guti{\'e}rrez-Naranjo and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Francisco
Jos{\'e} Romero-Campero},
title={Simulating avascular tumors with membrane systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={185--196}
}
@inproceedings{Barbacari:Gene:WMC6:2005,
author={N. Barbacari and A. Profir and C. Zelinschi},
title={Gene Regulatory Network Modelling by Means of Membrane Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={162-178}
}
@inproceedings{Busi:OnTheComputational:WMC6:2005,
author={N. Busi},
title={On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving
vs. Maximal Parallelism},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={235-252}
}
@inproceedings{Andrei:SOS:2005,
author={O. Andrei and G. Ciobanu and D. Lucanu},
title={Operational semantics and rewriting logic in membrane computing},
booktitle={Proceedings SOS Workshop (to appear in ENTCS)},
year={2005}
}
@inproceedings{Ibarra:1stWTAPSys:2005,
author={O. Ibarra and S. Woodworth},
title={On Symport/Antiport P Systems with One or Two Symbols},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={75-82}
}
@inproceedings{Ibarra:Some_Recent:WMC6:2005,
author={O.H. Ibarra},
title={Some Recent Results Concerning Deterministic P Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={24-25}
}
@inproceedings{Ibarra:DNA11:2005,
author={O.H. Ibarra and A. Paun},
title={Counting time in computing with cells},
booktitle={DNA11, London, Ontario, Canada},
year={2005}
}
@inproceedings{Ibarra1:DNA11:2005,
author={O.H. Ibarra and S. Woodworth},
title={On bounded symport/antiport P systems},
booktitle={DNA11, London, Ontario, Canada},
year={2005}
}
@inproceedings{Cazzaniga:Psystems:WMC6:2005,
author={P. Cazzaniga and A. Leporati and G. Mauri and C. Zandron},
title={P Systems with Memory},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={261-281}
}
@inproceedings{Frisco:PetriNets:WMC6:2005,
author={P. Frisco and P Systems},
title={Petri Nets and Program Machine},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={336-354}
}
@inproceedings{Frisco:1stWTAPSys:2005,
author={P. Frisco and Ranulf T. Gibson},
title={A Simulator and an Evolution Program for Conformon-{P} Systems},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={57-60}
}
@inproceedings{Sosik:Evolutionary:WMC6:2005,
author={P. Sosik},
title={On Evolutionary Lineages of Membrane Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={79-93}
}
@inproceedings{Chandra:OnPicture:WMC6:2005,
author={P.H. Chandra and K.G. Subramanian},
title={On Picture Arrays Generated by P Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={282-288}
}
@inproceedings{Frisco:Asimulator:WMC6:2005,
author={Pierluigi Frisco and Ranulf T. Gibson},
title={A Simulator for Conformon {P} Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={355-372}
}
@inproceedings{Freund:1stWTAPSys:2005,
author={R. Freund and M. Oswald},
title={P Colonies Working in the Maximally Parallel and in the Sequential Mode},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={49-56}
}
@inproceedings{Rama:1stWTAPSys:2005,
author={R. Rama and H. Ramesh},
title={On Generating Trees by P Systems with Active Membranes},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={95-98}
}
@inproceedings{Ceterchi:Simulating_a_class_of:EFS_EWCC:2005,
author={Rodica Ceterchi and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Simulating a class of parallel architectures: A broader perspective},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={131--148}
}
@inproceedings{Freund:Tissue_P_systems:EFS_EWCC:2005,
author={Rudolf Freund and Marion Oswald},
title={Tissue {P} systems with symport/antiport rules of one symbol are computationally
universal},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={187--200}
}
@inproceedings{Freund:Matrix_languages:3BWMC:2005,
author={Rudolf Freund and Oscar H. Ibarra and Gheorghe P{\u a}un and H.-C. Yen},
title={Matrix languages, register machines, vector addition systems},
booktitle={Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing,
{S}evilla ({S}pain), {J}anuary 31st - {F}ebruary 4th},
year={2005},
pages={155--168}
}
@inproceedings{Hemalatha:1stWTAPSys:2005,
author={S.Hemalatha and K.S.Dersanambika and K.G.Subramanian and C. Sri Hari Nagore},
title={P Systems Generating 3D Rectangular Picture Languages},
booktitle={in G. Ciobanu, Gh. Paun, Pre-Proc. of First International Workshop on Theory
and Application of P Systems, Timisoara, Romania, September 26-27},
year={2005},
pages={69-74}
}
@inproceedings{Krishna:mobile_membranes:EFS_EWCC:2005,
author={Shankara Narayanan Krishna},
title={On the efficiency of a variant of {P} systems with mobile membranes},
booktitle={Proceedings of the {ESF} {E}xploratory {W}orkshop on {C}ellular {C}omputing
({C}omplexity {A}spects), {S}evilla ({S}pain), {J}anuary 31st - {F}ebruary
2nd},
year={2005},
pages={237--246}
}
@inproceedings{Krishna:Mobility_four_Menbranes:CiE2005:2005,
author={Shankara Narayanan Krishna},
title={The power of mobility: four membranes suffice},
booktitle={CiE2005: New Computational Paradigms},
year={2005},
address={Amsterdam}
}
@inproceedings{Nishida:Membrane:WMC6:2005,
author={T.Y. Nishida},
title={Membrane Algorithm: An Approximate Algorithm for NP-Complete Optimization
Problems Eploiting P Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={26-43}
}
@inproceedings{Korczynski:Paun:2005,
author={W. Korczynski},
title={Paun's Systems and Accounting},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={461-464}
}
@inproceedings{Rogozhin.Alhazov.Freund:SASurvey:PreWMC6:2005,
author = {{\relax Yu}rii Rogozhin and Artiom Alhazov and Rudolf Freund},
title = {Computational Power of Symport/Antiport:
History, Advances and Open Problems},
editor = {Rudolf Freund and Georg Lojka and Marion Oswald and {\relax Gh}eorghe P{\u a}un},
booktitle = {Pre-Proc. of the Sixth Workshop on Membrane Computing
{WMC6}, Vienna, Austria},
year = {2005},
pages = {44-78},
abstract = {We first give a historical overview
of the most important results obtained in the area of P systems
and tissue P systems with symport / antiport rules
especially with respect to the development of
computational completeness results improving
descriptional complexity parameters as the number of membranes
and cells, respectively, and the weight of the rules as well
as the number of objects. Then we establish our newest results:
P systems with only one membrane and symport rules
of weight three can generate any recursively enumerable
language with only seven additional objects remaining
in the skin membrane at the end of a halting computation;
P systems with minimal cooperation, i.e., P systems
with symport / antiport rules of size one and P systems
with symport rules of weight two, are computationally complete
with only two membranes with only three and six, respectively
superfluous objects remaining in the output membrane at
the end of a halting computation.},
url = {http://www.emcc.at/WMC6/WMC6PreProcFull.pdf},
}
@inproceedings{Rogozhin:OnTheRule:WMC6:2005,
author={Y. Rogozhin and S. Verlan},
title={On the Rule Complexity of Universal Tissue P Systems},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={510-516}
}
@inproceedings{Dang:OnSymportAntiport:WMC6:2005,
author={Z. Dang and O.H. Ibarra and S. Woodworth and H.C. Yen},
title={On Symport/Antiport Systems and Semilinear Sets},
booktitle={Pre-Proc. of the sixth Workshop on Membrane Computing, {WMC6}, Vienna, Austria},
year={2005},
pages={312-335}
}
@inproceedings{Dang:On_Model-Checking:4thUC:2005,
author={Zhe Dang and Oscar H. Ibarra and Cheng Li and Gaoyan Xie},
title={On Model-Checking of {P} Systems},
booktitle={Unconventional Computation 4th International Conference, UC 2005, Sevilla,
Spain, October 3-�7, 2005. Proceedings},
year={2005},
publisher={Springer Berlin / Heidelberg},
abstract={Membrane computing is a branch of molecular computing that aims to develop
models and paradigms that are biologically motivated. It identifies an
unconventional computing model, namely a P system, from natural phenomena
of cell evolutions and chemical reactions. Because of the nature of maximal
parallelism inherent in the model, P systems have a great potential for
implementing massively concurrent systems in an efficient way that would
allow us to solve currently intractable problems. In this paper, we look
at various models of P systems and investigate their model-checking problems.
We identify what is decidable (or undecidable) about model-checking these
systems under extended logic formalisms of CTL. We also report on some
experiments on whether existing conservative (symbolic) model-checking
techniques can be practically applied to handle P systems with a reasonable
size. The work by Zhe Dang, Cheng Li and Gaoyan Xie was supported in part
by NSF Grant CCF-0430531. The work by Oscar H. Ibarra was supported in
part by NSF Grant CCF-0430945.},
series={Lecture Notes in Computer Science},
volume={3699}
}
@inproceedings{Alhazov:PolarMinpar:PreWMC7:2006,
author = {Artiom Alhazov},
title = {Minimal Parallelism and Number of Membrane Polarizations},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year = {2006},
address = {Leiden, The Netherlands},
editor = {Hendrik-Jan Hoogeboom and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg},
pages = {74-87},
abstract = {It is known that the satisfiability problem (SAT) can be
efficiently solved by a uniform family of P systems with active membranes
with two polarizations working in a maximally parallel way. We study
P systems with active membranes without non-elementary membrane division
working in minimally parallel way. The main question we address is
what number of polarizations is sufficient for an efficient computation
depending on the types of rules used.
In particular, we show that it is enough to have four polarizations
sequential evolution rules changing polarizations, polarizationless
nonelementary membrane division rules and polarizationless rules
of sending an object out. The same problem is solved with the standard
evolution rules, rules of sending an object out and polarizationless
non-elementary membrane division rules, with six polarizations.
It is an open question whether these numbers are optimal.},
url = {http://wmc7.liacs.nl/proceedings/listpapers.html},
}
@inproceedings{Alhazov.etal:Extended_Spiking:PreWMC7:2006,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Marija Slavkovik},
title = {Extended Spiking Neural P Systems Generating Strings
and Vectors of Non-Negative Integers},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year = {2006},
address = {Leiden, The Netherlands},
editor = {Hendrik-Jan Hoogeboom and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg},
pages = {88-101},
abstract = {We consider extended variants of spiking neural P systems
and show how these extensions of the original model allow for easy proofs
of the computational completeness of extended spiking neural P systems
and for the characterization of semilinear sets and regular languages by
finite extended spiking neural P systems (defined by having only finite
sets of rules assigned to the cells) with only a bounded number of neurons.},
url = {http://wmc7.liacs.nl/proceedings/listpapers.html},
}
@inproceedings{Alhazov.Rogozhin:MinSA2mToChar:PreWMC7:2006,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Towards a Characterization of {P} Systems with
Minimal Symport/Antiport and Two Membranes},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year = {2006},
address = {Leiden, The Netherlands},
editor = {Hendrik-Jan Hoogeboom and {\relax Gh}eorghe P{\u a}un and Grzegorz Rozenberg},
pages = {102-118},
abstract = {We prove that any set of numbers containing zero generated
by symport/antiport P systems with two membranes and minimal cooperation
is finite (for both symport/antiport P systems and for purely
symport P systems). On the other hand, one additional object in the output
membrane allows symport/antiport P systems with two membranes
and minimal cooperation generate any recursively enumerable sets of natural
numbers without zero. The same question for symport P systems
with two membranes and minimal cooperation (is only one additional
object in the output membrane sufficient in order to get universality?)
is still open.},
url = {http://wmc7.liacs.nl/proceedings/listpapers.html},
}
@inproceedings{Binder:Applications_of:BIC-TA:2006,
author={A. Binder and R. Freund and G. Lojka and M. Oswald},
title={Applications of membrane systems in distributed systems},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Binder:Applications,
author={A. Binder and R. Freund and G. Lojka and M. Oswald},
title={Applications of membrane systems in distributed systems},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={37--50}
}
@inproceedings{Leporati:Solving,
author={A. Leporati and C. Zandron and G. Mauri},
title={Solving the factorization problem with P systems},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={144--153}
}
@inproceedings{Leporati:Solving_the_factorization:BIC-TA:2006,
author={A. Leporati and C. Zandron and G. Mauri},
title={Solving the factorization problem with P systems},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Obtulowicz:Mathematical_(Denotational)_Semantics:W,
author={A. Obtulowicz},
title={Mathematical (Denotational) Semantics of Some Reducts of Ambient Calculus
and Brane Calculi},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={443-454}
}
@inproceedings{Obtulowicz:Mathematical_(Denotational)_Semantics:WMC7:2006,
author={A. Obtulowicz},
title={Mathematical (Denotational) Semantics of Some Reducts of Ambient Calculus
and Brane Calculi},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={443-454}
}
@inproceedings{Paun:P_systems_with_proteins:DTL10:2006,
author={A. Paun and B. Popa},
title={P systems with proteins on membranes and membrane division},
booktitle={Proceedings 10th DLT Conf. (invited talk), Santa Barbara, USA, 2006},
year={2006},
publisher={Springer},
pages={292--303},
series={Lecture Notes in Computer Science},
volume={4036}
}
@inproceedings{Romero-Jimenez:Graphical_Modelling_of:WMC7:2006,
author = {A. Romero-Jimenez and M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez},
title = {Graphical Modelling of Higher Plants Using P Systems},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year = {2006},
address = {Leiden, The Netherlands},
editor = {H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages = {474-484},
}
@inproceedings{Vitale:Communication,
author={A. Vitale and G. Mauri},
title={Communication via mobile vesicles in brane calculi},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Obtulowicz:On_an_Idea:4BWMC:2006,
author={Adam Obtulowicz},
title={On an Idea of a (Possibly) Uniform Data Base for Life Sciences from Molecular
Biology to Cognitive Psychology},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={209--212}
}
@inproceedings{Leporati:Three_Quantum:4BWMC:2006,
author={Alberto Leporati and Sara Felloni},
title={Three Quantum Algorithms to Solve {3-SAT}},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={137--160},
abstract={We propose three quantum algorithms to solve the 3-SAT NP-complete decision
problem. The first algorithm builds, for any instance o of 3-SAT, a quantum
Fredkin circuit that computes a superposition of all classical evaluations
of o in a given output line. Similarly, the second and third algorithms
compute the same superposition on a given register of a quantum register
machine, and as the energy of a given membrane in a quantum P system, respectively.
Assuming that a specific non-unitary operator, built using the well known
creation and annihilation operators, can be realized as a quantum gate,
as an instruction of the quantum register machine, and as a rule of the
quantum P system, respectively, we show how to decide whether {\'A} is a positive
instance of 3-SAT. The construction relies also upon the assumption that
an external observer is able to distinguish, as the result of a measurement,
between a null and a non-null vector.}
}
@inproceedings{Romero_Jimenez:The_Growth:4BWMC:2006,
author={Alvaro Romero-Jim{\'e}nez and Miguel Angel Guti{\'e}rrez-Naranjo and Mario-Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={The Growth of Branching Structures with {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={253--266},
abstract={L-systems have been widely used to model and graphically represent the growth
of plants [18]. In [4], the use of membrane computing for such tasks has
been proposed. In this paper we present a different approach, which makes
use of the topology of membrane structures to model the morphology of branching
structures. We also keep closer to reality by simulating their growth from
buds, instead of rewriting existing structures, as L-systems do.}
}
@inproceedings{APaun:Small_Universal:4BWMC:2006,
author={Andrei Paun and Gheorghe Paun},
title={Small Universal Spiking Neural {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={213--234},
abstract={In search for small universal computing devices of various types, we consider
here the case of spiking neural P systems (SN P systems), in two versions:
as devices computing functions and as devices generating sets of numbers.
We start with the first case and we produce a universal spiking neural
P system with 84 neurons. If a slight generalization of the used rules
is adopted, namely, we allow rules for producing simultaneously several
spikes, then a considerable improvement, to 49 neurons, is obtained. For
SN P systems used as generators of sets of numbers, we find a universal
system with restricted rules having 76 neurons, and one with extended rules
having 50 neurons.}
}
@inproceedings{Alhazov:Encodings:BWMC2006,
author = {Artiom Alhazov and Cosmin Bonchi{\c s} and Gabriel Ciobanu and Cornel Izba{\c s}a},
title = {Encodings and Arithmetic Operations in {P}~Systems},
booktitle = {Fourth Brainstorming Week on Membrane Computing, Sevilla
January 30 - February 3, 2006. Volume I},
year = {2006},
publisher = {F{\'e}nix Editora},
editor = {Miguel Angel Guti{\'e}rrez-Naranjo and {\relax Gh}eorghe P{\u a}un and
Agust{\'i}n Riscos-N{\'u}{\~n}ez and Francisco-Jos{\'e} Romero-Campero},
pages = {1--28},
abstract = {Following [2], we present in this paper various number encodings
and operations over multisets. We obtain the most compact encoding
and several other interesting encodings and study their properties
using elements of combinatorics over multisets. We also construct P systems
that implement their associated operations. We quantify the effect of adding
order to multiset thus obtaining a string, as going from encoding lengths
of the number n in base b and time complexities of operations of the order
n^(1/b) to lengths and complexities of order log_b(n).},
url = {http://www.gcn.us.es/4BWMC/4BWMC_proceedings.htm},
}
@inproceedings{Alhazov.Perez:UniformQSAT:BWMC2006,
author = {Artiom Alhazov and Mario de Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title = {Uniform Solution to {QSAT} Using Polarizationless Active Membranes},
booktitle = {Fourth Brainstorming Week on Membrane Computing, Sevilla
January 30 - February 3, 2006. Volume I},
year = {2006},
publisher = {F{\'e}nix Editora},
editor = {Miguel Angel Guti{\'e}rrez-Naranjo and {\relax Gh}eorghe P{\u a}un and
Agust{\'i}n Riscos-N{\'u}{\~n}ez and Francisco-Jos{\'e} Romero-Campero},
pages = {29--40},
abstract = {It is known that the satisfiability problem (SAT) can be solved
a semi-uniform family of deterministic polarizationless P systems
with active membranes with non elementary membrane division.
We present a double improvement of this result by showing that
the satisfiability of a quantified boolean formula (QSAT) can be solved
by a uniform family of P systems of the same kind.},
url = {http://www.gcn.us.es/4BWMC/4BWMC_proceedings.htm},
}
@inproceedings{Aman:Translating,
author={B. Aman and G. Ciobanu},
title={Translating mobile ambients into P systems},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Bonchis:Compositional,
author={C. Bonchis and C. Isbasa and G. Ciobanu},
title={Compositional asynchronous membrane systems},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={51--59}
}
@inproceedings{Bonchis:Compositional_asynchronous:BIC-TA:2006,
author={C. Bonchis and C. Isbasa and G. Ciobanu},
title={Compositional asynchronous membrane systems},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Versari:Encoding,
author={C. Versari},
title={Encoding catalytic P systems in $\pi$@},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Besozzi:Extended_P_Systems:WMC7:2006,
author={D. Besozzi and G. Rozenberg},
title={Extended P Systems for the Analysis of (Trans)Membrane Proteins},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={8-9}
}
@inproceedings{Besozzi:Seasonal_variance:BIC-TA:2006,
author={D. Besozzi and P. Cazzaniga and D. Pescini and G. Mauri},
title={Seasonal variance in P systems models for metapopulations},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Besozzi:Seasonal,
author={D. Besozzi and P. Cazzaniga and D. Pescini and G. Mauri},
title={Seasonal variance in P system models for metapopulations},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={27--36}
}
@inproceedings{Diaz-Pernil:solution,
author = {D. Diaz-Pernil and M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez and A. Riscos-N{\'u}{\~n}ez},
title = {An efficient solution to 3-COL with tissue P systems},
booktitle = {Proceedings MeCBIC 2006},
year = {2006},
address = {Venice},
editor = {N. Busi and C. Zandron},
}
@inproceedings{Zaharie:Distributed_Evolutionary_Algorithms:WMC7:2,
author={D. Zaharie and G. Ciobanu},
title={Distributed Evolutionary Algorithms Inspired by Membranes in Solving Continuous
Optimization Problems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={522- 537}
}
@inproceedings{Zaharie:Distributed_Evolutionary_Algorithms:WMC7:2006,
author={D. Zaharie and G. Ciobanu},
title={Distributed Evolutionary Algorithms Inspired by Membranes in Solving Continuous
Optimization Problems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={522- 537}
}
@inproceedings{Das:A_Simulator_Model:IEEECETN:2006,
author={D.K. Das and T. Renz},
title={A simulator model for P systems with active membranes},
booktitle={Proceedings 2006 IEEE Conference on Emerging Technologies - Nanoelectronics},
year={2006},
month={January},
address={Singapore},
pages={338--340}
}
@inproceedings{Diaz_Pernil:Solving_3_COL:4BWMC:2006,
author={Daniel D{\'i}az-Pernil and Miguel-Angel Guti{\'e}rrez-Naranjo and Mario-Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Solving 3-COL with Tissue {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={17--30},
abstract={In the literature, several examples of the efficiency of cell-like P systems
in order to solve NP-complete problems in polynomial time can be found.
Recently, various new models of tissue-like P systems have received important
attention from the scientific community. In this paper we present a linear-time
solution to an NP-complete problem, the 3-COL problem, and discuss the
possibilities of tissue-like P systems to solve hard problems.}
}
@inproceedings{Besozzi:Two_Universality:4BWMC:2006,
author={Daniela Besozzi and Nadia Busi and Giuditta Franco and Rudolf Freund and
Gheorghe Paun},
title={Two Universality Results for (Mem)Brane Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={49--62},
abstract={We prove that P systems with mate and drip operations and using at most
five membranes during any step of a computation are universal. This improves
a recent similar result from [5], where eleven membranes are used. The
proof of this result has the "drawback" that the output of a computation
is obtained on an inner membrane of the system. A universality proof is
then given for the case when the result of a computation is found on the
skin membrane (on its external side, hence "visible" from the environment),
but in this case we use one more membrane, as well as another basic brane
operation exo; moreover, the operations are now of the projective type,
as introduced in [1].}
}
@inproceedings{Csuhaj-Varju:P_Colonies_with:WMC7:2006,
author={E. Csuhaj-Varju and M. Margenstern and G. Vaszil},
title={P Colonies with a Bounded Number of Cells and Programs},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={311-322}
}
@inproceedings{Csuhaj-Varju:Modeling_the_Dynamical_Parallelism:WMC7:2006,
author={E. Csuhaj-Varju and R. Freund and D. Sburlan},
title={Modeling the Dynamical Parallelism of Bio-Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={290-310}
}
@inproceedings{Csuhaj-Varju:Modeling_the_Dynamical_Parallelism:WM,
author={E. Csuhaj-Varju and R. Freund and D. Sburlan},
title={Modeling the Dynamical Parallelism of Bio-Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={290-310}
}
@inproceedings{Martegani:Identification_of:ISSY25:2006,
author={E. Martegani and R. Tisi and F. Belotti and S. Colombo and C. Paiardi and
J. Winderickx and P. Cazzaniga and D. Besozzi and G. Mauri},
title={Identification of an intracellular signalling complex for ras/camp pathway
in yeast: experimental evidences and modelling},
booktitle={ISSY 25 Conf., Hanassari, Espo, Finland, 2006},
year={2006}
}
@inproceedings{CsuhagVarju:Small_Computationaly:4BWMC:2006,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Maurice Margenstern and Gy{\"o}rgy Vaszil and Sergei
Verlan},
title={Small Computationally Complete Symport/Antiport {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={267--282},
abstract={It is known that P systems with symport/antiport rules simulate the register
machines, i.e., they are computationally complete. Hence, due to the existence
of universal register machines, there exist computationally complete subclasses
of symport/antiport P systems with a number of rules limited by a constant.
However, there was no estimation of this number in the literature. In this
article, we first give a simple estimation of this constant, and then we
show that the number can be reduced by grouping together several instructions
of the simulated variant of the register machines. Finally, a universal
P system with symport/antiport having only 44 rules is obtained.}
}
@inproceedings{Bernardini:Tissue_P_Systems_with:WMC7:2006,
author={F. Bernardini and R. Freund},
title={Tissue P Systems with Communication Modes},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={132-144}
}
@inproceedings{Romero-Campero:Towards_Probabilistic_Model:WMC7:2006,
author={F.J. Romero-Campero and M. Gheorghe and L. Bianco and D. Pescini and M.J.
Perez-Jimenez and R. Ceterchi},
title={Towards Probabilistic Model Checking on P Systems Using PRISM},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={455-473}
}
@inproceedings{Romero-Campero:Towards_Probabilistic_Model:WMC7:20,
author={F.J. Romero-Campero and M. Gheorghe and L. Bianco and D. Pescini and M.J.
Perez-Jimenez and R. Ceterchi},
title={Towards Probabilistic Model Checking on P Systems Using PRISM},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={455-473}
}
@inproceedings{Fontana:Discrete_Solution:4BWMC:2006,
author={Federico Fontana and Vicenzo Manca},
title={Discrete Solution of Differential Equations by {P} Metabolic Algorithm},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={31--40},
abstract={The relationships existing between MP graphs, metabolic P systems, and ODE
systems are investigated. Formal results show that every MP system, once
derived by its MP graph, results in an ODE system whose solution equals,
in the limit, the solution obtained by a non-cooperative MP system that
is ODE equivalent to the original one. The freedom of choice of the ODE
equivalent from the original MP system resembles the same freedom which
is left in the choice and optimization of a numerical scheme while computing
the solution of an ODE system.}
}
@inproceedings{Ciobanu:Probabilistic_transitions:BIC-TA:2006,
author = {G. Ciobanu and L. Corn{\u a}cel},
title = {Probabilistic transitions for P systems},
booktitle = {Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006
Wuhan, China, September 2006, Membrane Computing Section.},
year = {2006},
}
@inproceedings{Ciobanu:Probabilistic,
author = {G. Ciobanu and L. Corn{\u a}cel},
title = {Probabilistic transitions for P systems},
booktitle = {Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year = {2006},
month = {September},
address = {Wuhan, China},
pages = {82--92},
}
@inproceedings{Ciobanu:P_Machines:WMC7:2006,
author={G. Ciobanu and M. Gontineac},
title={P Machines: An Automata Approach to Membrane Computing},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={274-289}
}
@inproceedings{Franco:Computing,
author={G. Franco and M. Margenstern},
title={Computing by floating strings},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Franco:Mitotic_Oscillators:WMC7:2006,
author={G. Franco and P.H. Guzzi and V. Manca and T. Mazza},
title={Mitotic Oscillators as MP Graphs},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={344-356}
}
@inproceedings{Liu:Further_Remarks_on:WMC7:2006,
author={G. Liu and M. Ionescu},
title={Further Remarks on Trace Languages in P Systems with Symport/Antiport},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={417-428}
}
@inproceedings{Paun:Tissue,
author={Gh. Paun},
title={Membrane computing and brane calculi (some personal notes)},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Paun:Languages,
author={Gh. Paun},
title={Languages in membrane computing. Some details for spiking neural P systems},
booktitle={Proceedings 10th DLT Conf. (invited talk), Santa Barbara, USA, 2006},
year={2006},
publisher={Springer},
pages={20--35},
series={Lecture Notes in Computer Science},
volume={4036}
}
@inproceedings{Paun:2006_Research_Topics:4BWMC:2006,
author = {Gheorghe P{\u a}un},
title = {2006 Research Topics in Membrane Computing},
booktitle = {Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year = {2006},
publisher = {F{\'e}nix Editora},
editor = {Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages = {235--252},
abstract = {This is a list of research topics prepared on the occasion of the Fourth
Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006 (hence the title). The selection is subjective, the presentation
is informal (in most cases, the precise formulation of the question to
investigate is already part of the research task), the bibliographical
information is partial (giving only a starting point for searching the
literature; as usual, for a complete bibliography the reader should refer
to [36]).},
}
@inproceedings{Liu:Further_Remarks:4BWMC:2006,
author={Guangwu Liu and Mihai Ionescu},
title={Further Remarks on Trace Languages in {P} Systems with Symport/Antiport},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={161--172},
abstract={P systems are parallel molecular computing models which process multisets
of objects in cell-like membrane structures. In this paper we consider
the trace languages of a special symbol, the traveler, in symport/antiport
P systems where, instead of multisets of objects, sets of objects were
considered. Two different ways to define the trace language are proposed.
One of the families of languages obtained in this way is proved to be equal
to the family of regular languages and the other one to be strictly smaller.
Some ideas for further research are also considered.}
}
@inproceedings{Vaszil:A_Class_of_P_Automata:4BWMC:2006,
author={Gy{\"o}rgy Vaszil},
title={A Class of {P} Automata for Characterizing Context-free Languages},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={267--276},
abstract={We present a characterization of context-free languages in terms of a restricted
class of P automata (P systems accepting strings of symbols using symport/antiport
communication rules). The characterization is based on the form of the
rules used by the system.}
}
@inproceedings{Chen:Computing,
author={H. Chen and T.-O. Ishdorj and Gh. Paun},
title={Computing along the axon},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={60--70}
}
@inproceedings{Long:Building,
author={H. Long and Y. Fu},
title={Building combinational P automata with rewriting and active membrane rules},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={154--159}
}
@inproceedings{Long:Building_combinational:BIC-TA:2006,
author={H. Long and Y. Fu},
title={Building combinational P automata with rewriting and active membrane rules},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Nagda:Symport/Antiport_and_Time:WMC7:2006,
author={H. Nagda and A. Paun and A. Rodriguez-Paton},
title={P Systems with Symport/Antiport and Time},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={429-442}
}
@inproceedings{Chen:On_Trace_Languages:4BWMC:2006,
author={Haiming Chen and Mihai Ionescu and Andrei Paun and Gheorghe Paun and Bianca
Popa},
title={On Trace Languages Generated by Spiking Neural {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={207--224},
abstract={We extend to spiking neural P systems a notion investigated in the �standard�
membrane systems: the language of the traces of a distinguished object.
In our case, we distinguish a spike by �marking� it and we follow its path
through the neurons of the system, thus obtaining a language. Several examples
are discussed and some preliminary results about this way of associating
a language with a spiking neural P system are given, together with a series
of topics for further research. For instance, we show that each regular
language is the morphic image of a trace language intersected with a very
particular regular language, while each recursively enumerable language
over the one-letter alphabet is the projection of a trace language.}
}
@inproceedings{Chen:On_The_Efficiency:4BWMC:2006,
author={Haiming Chen and Mihai Ionescu and Tseren-Onolt Ishdorj},
title={On the Efficiency of Spiking Neural {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={195--206},
abstract={Spiking neural P systems were recently introduced in [4] and proved to be
Turing complete as number computing devices. In this paper we show that
these systems are also computationally efficient. Specifically, we present
a variant of spiking neural P systems which have, in their initial configuration,
an arbitrarily large number of inactive neurons which can be activated
(in an exponential number) in polynomial time. Using this model of P systems
we can deterministically solve the satisfiability problem (SAT) in constant
time.}
}
@inproceedings{Chen:On_String_Languages:4BWMC:2006,
author={Haiming Chen and Rudolf Freund and Mihai Ionescu and Gheorghe Paun and Mario-Jes{\'u}s
P{\'e}rez-Jim{\'e}nez},
title={On String Languages Generated by Spiking Neural {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={169--194},
abstract={We continue the study of spiking neural P systems by considering these computing
devices as binary string generators: the set of spike trains of halting
computations of a given system constitutes the language generated by that
system. Although the work of spiking neural P systems is rather restricted
(and this is illustrated by the fact that very simple languages cannot
be generated in this framework), regular languages are inverse-morphic
images of languages of finite spiking neural P systems, and recursively
enumerable languages are projections of inverse-morphic images of languages
generated by spiking neural P systems.}
}
@inproceedings{Chen:Computing_Along_Axon:4BWMC:2006,
author={Haiming Chen and Tseren-Onolt Ishdorj and Gheorghe Paun},
title={Computing Along the Axon},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={225--240},
abstract={We consider a special form of spiking neural P systems, called axon P systems,
corresponding to the activity of Ranvier nodes of neuron axon, and we brieffy
investigate the language generative power of these devices.}
}
@inproceedings{Chen:Spiking_Neural:4BWMC:2006,
author={Haiming Chen and Tseren-Onolt Ishdorj and Gheorghe Paun and Mario-Jes{\'u}s
P{\'e}rez-Jim{\'e}nez},
title={Spiking Neural {P} Systems with Extended Rules},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={241--266},
abstract={We consider spiking neural P systems with spiking rules allowed to introduce
zero, one, or more spikes at the same time. The computing power of the
obtained systems is investigated, when considering them as number generating
and as language generating devices. In the first case, a simpler proof
of universality is obtained (universality is already known for the restricted
rules), while in the latter case we find characterizations of finite and
recursively enumerable languages (without using any squeezing mechanism,
as it was necessary in the case of restricted rules). The relationships
with regular languages are also investigated. In the end of the paper,
a tool-kit for computing (some) operations with languages is provided.}
}
@inproceedings{Ardelean:Biological_Roots:WMC7:2006,
author={I. Ardelean},
title={Biological Roots and Applications of P Systems. Further Suggestions},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={1-7}
}
@inproceedings{Ardelean:Some_Notes:4BWMC:2006,
author={I. Ioan Ardelean and Daniela Besozzi},
title={Some Notes on the Interplay Between {P} Systems and Chemotaxis in Bacteria},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={41--48},
abstract={We describe some chemotactic behaviors of bacteria, that is, their movement
response to changes in the environment, and the underlying molecular mechanisms.
We outline how such processes could be linked to membrane computing, by
taking inspiration from them for new type of rules or new features to be
introduced in P systems, as well as by considering how the application
of recent P system-based models can produce relevant results for the description
and the analysis of chemotaxis processes.}
}
@inproceedings{Auld:Study_of_Colonies:WMC7:2006,
author={J. Auld and L. Bianco and G. Ciobanu and M. Gheorghe and D. Pescini and
F.J. Remero-Campero},
title={The Use of P Systems for the Study of Colonies},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={15-20}
}
@inproceedings{Bartosik:Membrany_dynamicsne:CBOiS:2006,
author={J. Bartosik},
title={Membrany dynamicsne w modelowaniu systemow ekonomicznych},
booktitle={Conf. Bad. Oper. i Syst.},
year={2006}
}
@inproceedings{Dassow:complexity_Darwinian:BWMC4:2006,
author={J. Dassow and E. Csuhaj-Varju},
title={On the syntactic complexity of Darwinian membrane systems},
booktitle={BWMC4},
year={2006},
address={Sevilla}
}
@inproceedings{Dassow:P,
author={J. Dassow and G. Vaszil},
title={P Finite Automata and Regular Languages Over Countably Infinite Alphabets},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={323-336}
}
@inproceedings{Kleijn:Synchrony_and_Asynchrony:WMC7:2006,
author={J. Kleijn and M. Koutny},
title={Synchrony and Asynchrony in Membrane Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={21-39}
}
@inproceedings{Sempere:Identifying_P_Rules:WMC7:2006,
author={J.M. Sempere and D. Lopez},
title={Identifying P Rules from Membrane Structures with an Error-Correcting Approach},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={485-500}
}
@inproceedings{Dassow:On_the_Syntactic:4BWMC:2006,
author={J{\"u}rgen Dassow and Erzs{\'e}bet Csuhaj-Varj{\'u}},
title={On the Syntactic Complexity of Darwinian Membrane Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={1--16},
abstract={Membrane or P systems form a distributed parallel model of computing which
is obtained as an abstraction from the structure and functioning of living
cells. In this paper we consider a very basic membrane system and add to
it checkers which are special finite automata to check whether or not a
configuration of the membrane system is "good" or "bad". The computation
is only continued if the configuration is good, otherwise it stops without
a result. Such membrane systems are called Darwinian P systems. There are
three parameters characterizing the size of a system, the number of membranes,
the number of checkers, and the size of the checkers measured by the number
of states. We prove that we can generate all sets of Parikh vectors of
recursively enumerable languages if we restrict the number and size of
checkers to one checker with six states or to five checkers with two states.
Moreover, we prove that Darwinian systems with one membrane and checkers
with at most two states are also sufficient to generate all Parikh sets
of recursively enumerable languages. The latter result is optimal since
Darwinian systems with checkers with only one state generate only sets
of Parikh vectors of ET0L languages. All results are valid for length sets
instead of sets of Parikh vectors, too.}
}
@inproceedings{Subramanian:Array,
author={K.G. Subramanian and M. Geethalakshmi and P. Helen Chandra},
title={Array rewriting P systems generating rectangular arrays},
booktitle={National Conference in Intelligent Optimization Modeling Gandhigram Rural
Institute-Deemed University, India},
year={2006},
month={March},
address={India}
}
@inproceedings{Subramanian:Array_P_systems:2006,
author={K.G. Subramanian and R. Saravanan and K. Rangarajan},
title={Array P systems and basic puzzle grammars},
booktitle={National Conference in Intelligent Optimization Modeling Gandhigram Rural
Institute-Deemed University, India},
year={2006},
month={March},
address={India}
}
@inproceedings{Subramanian:P,
author={K.G. Subramanian and R. Saravanan and M. Geethalakshmi and P. Helen Chandra
and M. Margenstern},
title={P systems with array objects and array rewriting rules},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={160--167}
}
@inproceedings{Subramanian:P_systems_with:BIC-TA:2006,
author={K.G. Subramanian and R. Saravanan and M. Geethalakshmi and P. Helen Chandra
and M. Margenstern},
title={P systems with array objects and array rewriting rules},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Bianco:Towards_a_P_Systems:WMC7:2006,
author={L. Bianco and D. Pescini and P. Siepmann and N. Krasnogor and F.J. Romero-Campero
and M. Gheorghe},
title={Towards a P Systems Pseudomonas Quorum Sensing Model},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={159-176}
}
@inproceedings{Bianco:Towards_an_Hybrid:WMC7:2006,
author={L. Bianco and F. Fontana},
title={Towards an Hybrid Metablic Algorithm},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={145-158}
}
@inproceedings{Fernandez:Massively_Parallel_Algorithm:WMC7:2006,
author={L. Fernandez and F. Arroyo and J.A. Tejedor and J. Castellanos},
title={Massively Parallel Algorithm for Evolution Rules Application in Transition
P Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={337-343}
}
@inproceedings{Huang:P_systems_based:BIC-TA:2006,
author={L. Huang and N. Wang},
title={P systems based multi-objective optimization algorithm},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Huang:Simulation,
author={L. Huang and N. Wang},
title={An optimization algorithms inspired by membrane computing},
booktitle={Proceedings ICNC},
year={2006},
publisher={Springer},
editor={L. Jiao},
pages={49--55},
series={Lecture Notes In Computer Science},
volume={4222}
}
@inproceedings{Huang:P,
author={L. Huang and X.-X. He and N. Wang and Y. Xie},
title={P systems based multi-objective optimization algorithm},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={113--123}
}
@inproceedings{Leporati:A_Membrane_Algorithm:WMC7:2006,
author={Leporati and D. Pagani},
title={A Membrane Algorithm for the Min Storage Problem},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={397-416}
}
@inproceedings{Camara:A_Cell_Cell_Signaling:WMC7:2006,
author={M. Camara and Quorum Sensing},
title={A Cell-Cell Signaling Mechanism Used to Coordinate Behavioural Changes in
Bacterial Populations},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={10-14}
}
@inproceedings{Cardona:Classifying_States_of:WMC7:2006,
author={M. Cardona and M.A. Colomer and M.J. Perez-Jimenez and A. Zaragoza},
title={Classifying States of a Finite Markov Chain with Membrane Computing},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={229-241}
}
@inproceedings{Cavaliere:Membrane,
author={M. Cavaliere and A. Riscos-Nunez and R. Brijder and G. Rozenberg},
title={Membrane systems with marked membranes},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Cavaliere:Playing_with_Partial:WMC7:2006,
author={M. Cavaliere and R. Mardare},
title={Playing with Partial Knowledge in Membrane Systems: A Logical Approach},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={242-260}
}
@inproceedings{Cavaliere:with,
author={M. Cavaliere and S. Sedwards},
title={Membrane systems with peripheral proteins: transport and evolution},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Gheorghe:P,
author={M. Gheorghe},
title={P systems - A new computational approach in systems biology},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={7--14}
}
@inproceedings{Ionescu:Computing_with_spiking:DNA12:2006,
author={M. Ionescu and A. Paun and Gh. Paun and M.J. Perez-Jimenez},
title={Computing with spiking neural P systems: Traces and small universal systems},
booktitle={Proceedings DNA12},
year={2006},
month={June},
address={Seul},
editor={C. Mao and Y. Yokomori and B.-T. Zhang},
pages={32--42}
}
@inproceedings{Gutierrez-Naranjo:A_membrane:BIC-TA:2006,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez and A. Riscos-Nunez and F.J.
Romero-Campero},
title = {A membrane computing view on tumours},
booktitle = {Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006
Wuhan, China, September 2006, Membrane Computing Section.},
year = {2006},
}
@inproceedings{Gutierrez-Naranjo:A,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez and A. Riscos-Nunez and F.J.
Romero-Campero},
title = {A membrane computing view on tumours},
booktitle = {Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year = {2006},
month = {September},
address = {Wuhan, China},
pages = {103--112},
}
@inproceedings{Gutierrez-Naranjo:On,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. Perez-Jimenez and A. Riscos-Nunez and F.J.
Romero-Campero},
title = {On the efficiency of cell-like and tissue-like recognizer membrane systems},
booktitle = {Proceedings of NICSO},
year = {2006},
}
@inproceedings{Perez-Jimenez:Modelling_of_Cellular_Signalling:WMC7:2006,
author={M.J. Perez-Jimenez},
title={P systems-based Modelling of Cellular Signalling Pathways},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={54-73}
}
@inproceedings{Perez-Jimenez:Modelling_Cellular_Signalling:WMC7:2006,
author={M.J. Perez-Jimenez},
title={P systems-based Modelling of Cellular Signalling Pathways},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={54-73}
}
@inproceedings{Perez-Jimenez:Modelling_of_Cellular_Signalling:WMC,
author={M.J. Perez-Jimenez},
title={P systems-based Modelling of Cellular Signalling Pathways},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={54-73}
}
@inproceedings{Oswald:Independent_agents:CALR:2006,
author={Marion Oswald},
title={Independent agents in a globalized world modelled by tissue P systems},
booktitle={Conf. Artificial Life and Robotics},
year={2006}
}
@inproceedings{Cavaliere:Time_Driven:4BWMC:2006,
author={Matteo Cavaliere and Claudio Zandron},
title={Time-Driven Computations in {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={133--144},
abstract={It is a well-known fact that the time of execution of a (biochemical) reaction
depends on many factors, and, in particular, on the current situation of
the whole system. With this motivation in mind, we propose a model of computation
based on membrane systems where the various rewriting rules have different
times of execution and, moreover, the time of execution of each rule can
vary during the computation, depending on the configuration of the whole
system (in this sense, the computation is "time-driven"). We show that
such systems are universal in a very simple framework: a regular time-mapping
succes to obtain universality for systems with minimal cooperation (one
catalyst).}
}
@inproceedings{Cavaliere:Multiset_Random:4BWMC:2006,
author={Matteo Cavaliere and Rudolf Freund and Marion Oswald and Dragos Sburlan},
title={Multiset Random Context Grammars, Checkers, and Transducers},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={113--132},
abstract={We introduce a general model of random context multiset grammars as well
as the concept of multiset random context checkers and transducers. Our
main results show how recursively enumerable sets of finite multisets can
be generated using these models of computing; corresponding results for
antiport P systems are established, too.}
}
@inproceedings{Muskulus:Reaction_Cycles:4BWMC:2006,
author={Michael Muskulus and Sanne Houweling and Grzegorz Rozenberg and Daniela Besozzi and,
Paolo Cazzaniga and Dario Pescini and Robert Brijder},
title={Reaction Cycles in Membrane Systems and Molecular Dynamics},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={185--208},
abstract={We are considering molecular dynamics and (sequential) membrane systems
from the viewpoint of Markov chain theory. The first step is to understand
the structure of the configuration space, with respect to communicating
classes. Instead of a reachability analysis by traditional methods, we
use the explicit monoidal structure of this space with respect to rule
applications. This leads to the notion of precycle, which is an element
of the integer kernel of the stoichiometric matrix. The generators of the
set of precycles can be effectively computed by an incremental algorithm
due to Contejean and Devie. To arrive at a characterization of cycles,
we introduce the notion of defect, which is a set of geometric constraints
on a configuration to allow a precycle to be enabled, that is, be a cycle.
An important open problem is the efficient calculation of the defects.
We also discuss aspects of asymptotic behavior and connectivity, as well
as give a biological example, showing the usefulness of the method for
model checking.}
}
@inproceedings{Gutierrez_Naranjo:Fractals:4BWMC:2006,
author={Miguel-Angel Guti{\'e}rrez-Naranjo and Mario-Jes{\'u}s P{\'e}rez-Jim{\'e}nez},
title={Fractals and {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={65--86},
abstract={In this paper we show that the massive parallelism, the synchronous application
of the rules, and the discrete nature of their computation, among other
features, lead us to consider P systems as natural tools for dealing with
fractals. Several examples of fractals encoded by P systems are presented
and we wonder about using P systems as a new tool for representing and
simulating the fractal nature of tumors.}
}
@inproceedings{Gutierrez_Naranjo:An_Approach:4BWMC:2006,
author={Miguel-Angel Guti{\'e}rrez-Naranjo and Mario-Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-N{\'u}{\~n}ez},
title={An Approach to the Degree of Parallelism in {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={87--104},
abstract={In the literature, several designs of P systems were used for performing
the same task. The use of different techniques or even different P system
models makes it very dificult to compare these designs. In this paper,
we introduce a new criterion for such a comparison: the degree of parallelism
of a P system. To this aim, we define the labeled 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 along the
computation of a P system.}
}
@inproceedings{Cardona:Handling_Markov_Chains:4BWMC:2006,
author={M{\'o}nica Cardona and M.Angels Colomer and Mario-Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Alba
Zaragoza},
title={Handling Markov Chains with Membrane Computing},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={99--112},
abstract={In this paper we approach the problem of computing the n�th power of the
transition matrix of an arbitrary Markov chain through membrane computing.
The proposed solution is described in a semi�uniform way in the framework
of P systems with external output. The amount of resources required in
the construction is polynomial in the number of states of the Markov chain
and in the power. The time of execution is linear in the power and is independent
of the number of states involved in the Markov chain.}
}
@inproceedings{Busi:Computing_with_Genetic_Gates:WMC7:2006,
author={N. Busi and C. Zandron},
title={Computing with Genetic Gates, Proteins and Membranes},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={213-228}
}
@inproceedings{Busi:Modeling:WSC:2006,
author={N. Busi and C. Zandron},
title={Modeling and Analysis of Biological Processes by Mem(Brane) Calculi and
Systems},
booktitle={Proc. of the 2006 Winter Simulation Conference, Monterey, CA, Usa},
year={2006}
}
@inproceedings{Busi:A_Case_Study:WMC7:2006,
author = {N. Busi and M.A. Guti{\'e}rrez-Naranjo},
title = {A Case Study in (Mem)Brane Computation: Generating $\{ n^2 \mid n\geq 1 \}$ },
booktitle = {Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year = {2006},
address = {Leiden, The Netherlands},
editor = {H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages = {196-212},
}
@inproceedings{Busi:Decidability:4BWMC:2006,
author={Nadia Busi},
title={Decidability of Divergence for Catalytic {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={63--80},
abstract={P systems are a biologically inspired model introduced by Gheorghe Paun
with the aim of representing the structure and the functioning of the cell.
Since their introduction, several variants of P systems have been proposed
and explored. We concentrate on the class of catalytic P systems without
priorities associated to the rules. We show that the divergence problem
(i.e., checking for the existence of an infinite computation) is decidable
in such a class of P systems. As a corollary, we obtain an alternative
proof of the nonuniversality of deterministic catalytic P systems, an open
problem recently solved by Ibarra and Yen.}
}
@inproceedings{Busi:A_Case_Study:4BWMC:2006,
author={Nadia Busi and Miguel-Aangel Guti{\'e}rrez-Naranjo},
title={A Case Study in (Mem)Brane Computation: Generating $\{ n^2 \mid n \geq 1 \}$ },
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={81--98},
abstract={The aim of this paper is to start an investigation and a comparison of the
expressiveness of the two most relevant formalisms inspired by membranes
interactions, namely, P systems and Brane Calculi. We compare the two formalisms
w.r.t. their ability to act as language generators. In particular, we show
different ways of generating the set L = {n2 | n >= 1} in P systems and
in Brane Calculi.}
}
@inproceedings{Andrei:Strategies:BWMC4:2006,
author={O. Andrei and G. Ciobanu and D. Lucanu},
title={Strategies in membrane computing},
booktitle={BWMC4},
year={2006},
address={Sevilla}
}
@inproceedings{Andrei:Expressing_Control_Mechanisms:WMC7:2006,
author={O. Andrei and G. Ciobanu and D. Lucanu},
title={Expressing Control Mechanisms in P Systems by Rewriting Strategies},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={119-131}
}
@inproceedings{Ibarra:Characterizations_of_Some_Restricted:WMC7:2,
author={O.H. Ibarra and S. Woodworth},
title={Characterizations of Some Restricted Spiking Neural P Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={387-396}
}
@inproceedings{Ibarra:Characterizations_of_Some_Restricted:WMC7:2006,
author={O.H. Ibarra and S. Woodworth},
title={Characterizations of Some Restricted Spiking Neural P Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={387-396}
}
@inproceedings{Ibarra:Normal_Forms:4BWMC:2006,
author={Oscar-H. Ibarra and Andrei Paun and Gheorghe Paun and Alfonso Rodr{\'i}guez-Pat{\'o}n and Petr Sosik and Sara Woodworth},
title={Normal Forms for Spiking Neural {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={105--136},
abstract={The spiking neural P systems are a class of computing devices recently introduced
as a bridge between spiking neural nets and membrane computing. In this
paper we prove a series of normal forms for spiking neural P systems, concerning
the regular expressions used in the firing rules, the delay between firing
and spiking, the forgetting rules used, and the outdegree of the graph
of synapses. In all cases, surprising simplifications are found, without
losing the computational universality � sometimes at the price of (slightly)
increasing other parameters which describe the complexity of these systems.}
}
@inproceedings{Cazzaniga:Tau_Leaping_Stochastic:WMC7:2006,
author={P. Cazzaniga and D. Pescini and D. Besozzi and G. Mauri},
title={Tau Leaping Stochastic Simulation Method in P Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={261-273}
}
@inproceedings{Frisco:Infinite_Hierarchies:WMC7:2006,
author={P. Frisco},
title={Infinite Hierarchies of Conformon-P Systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={357-371}
}
@inproceedings{Frisco:Dynamics,
author={P. Frisco and D. W. Corne},
title={Dynamics of HIV infection studied with Conformon-P systems},
booktitle={The Seventh International Conference on Systems Biology, October 9-13, 2006,
Yokohama, Japan},
year={2006},
month={october 9--13},
address={Yokohama, Japan}
}
@inproceedings{Cazzaniga:Stochastic:4BWMC:2006,
author={Paolo Cazzaniga and Dario Pescini and Francisco-Jos{\'e} Romero-Campero and
Daniela Besozzi and Giancarlo Mauri},
title={Stochastic Approaches in {P} Systems for Simulating Biological Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={145--164},
abstract={Different stochastic strategies for modeling biological systems with P systems
are reviewed in this paper, such as the multi-compartmental approach and
dynamical probabilistic P systems. The respective results obtained from
the simulations of a test case study (the quorum sensing phenomena in Vibrio
Fischeri colonies) are shown, compared and discussed.}
}
@inproceedings{Brijder:Systems:with_External_Control:WMC7:2006,
author={R. Brijder and M. Cavaliere and A. Riscos-Nunez and G. Rozenberg and D.
Sburlan},
title={Membrane Systems with External Control},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={177-195}
}
@book{Freund:LNCS3850:2006,
author = {R. Freund and Gh. Paun and G. Rozenberg and A. Salomaa},
title = {Membrane Computing},
booktitle = {International Workshop, WMC6, Vienna, Austria, 2005, Selected and Invited
Papers},
year = {2006},
publisher = {Springer-Verlag},
series = {LNCS 3850},
}
@inproceedings{Freund:Tissue,
author={R. Freund and M. Oswald},
title={Tissue P systems with mate and drip operations},
booktitle={Proceedings MeCBIC 2006},
year={2006},
address={Venice},
editor={N. Busi and C. Zandron}
}
@inproceedings{Freund:How_a_membrane:BIC-TA:2006,
author={R. Freund and M. Oswald and T. Schirk},
title={How a membrane agent buys goods in a membrane store},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Freund:How,
author={R. Freund and M. Oswald and T. Schirk},
title={How a membrane agent buys goods in a membrane store},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={93--102}
}
@inproceedings{Ceterchi:Rewriting:4BWMC:2006,
author={Rodica Ceterchi},
title={Rewriting in {P} Systems: An Algebreic Approach},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume I},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={165--168},
abstract={We reformulate in algebraic terms the maximal parallel rewriting of symbols
which occur inside membranes of a P system.}
}
@inproceedings{Freund:Particular_Results:4BWMC:2006,
author={Rudolf Freund},
title={Particular Results for Variants of {P} Systems with One Catalyst in One
Membrane},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={41--50},
abstract={Purely catalytic P systems can generate all recursively enumerable sets
of natural numbers with only three catalysts in one membrane, whereas we
know that one catalyst in one membrane is not enough. On the other hand,
P systems also allowing (non-catalytic) non-cooperative evolution rules
with only two catalysts in one membrane are already computationally complete,
too. We here investigate special variants of P systems with only one catalyst
in one membrane that are not computationally complete, i.e., variants of
P systems with only one catalyst in one membrane that cannot generate all
recursively enumerable sets of natural numbers.}
}
@inproceedings{Freund:Small_Universal:4BWMC:2006,
author={Rudolf Freund and Marion Oswald},
title={Small Universal Antiport {P} Systems and Universal Multiset Grammars},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={51--64},
abstract={Based on the construction of a universal register machine (see [7]) we construct
a universal antiport P system working with 31 rules in the maximally parallel
mode in one membrane, and a universal antiport P system with forbidden
context working with 16 rules in the sequential derivation mode in one
membrane for computing any partial recursive function on the set of natural
numbers. For accepting/generating any arbitrary recursively enumerable
set of natural numbers we need 31/33 and 16/18 rules, respectively. As
a consequence of the result for antiport P systems with forbidden context
we immediately infer similar results for forbidden random context multiset
grammars with arbitrary rules.}
}
@inproceedings{Cheruku:Simulating,
author={S. Cheruku and A. Paun and F.J. Romero-Campero and M.J. Perez-Jimenez and
O.H. Ibarra},
title={Simulating FAS-induced apoptosis by using P systems},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={71--81}
}
@inproceedings{Cheruku:Simulating_FAS-induced:BIC-TA:2006,
author={S. Cheruku and A. Paun and F.J. Romero-Campero and M.J. Perez-Jimenez and
O.H. Ibarra},
title={Simulating FAS-induced apoptosis by using P systems},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Verlan:On,
author={S. Verlan and F. Bernardini and M. Gheorghe and M. Margenstern},
title={On Communication in Tissue P Systems: Conditional Uniport},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={507-521}
}
@inproceedings{Krishna:Combining,
author={S.N. Krishna},
title={Combining brane calculus and membrane computing},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={131--143}
}
@inproceedings{Krishna:Combining_brane:BIC-TA:2006,
author={S.N. Krishna},
title={Combining brane calculus and membrane computing},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Hinze:A_Protein_Substructure:WMC7:2006,
author={T. Hinze and T. Lenser and P. Dittrich},
title={A Protein Substructure Based P System for Description and Analysis of Cell
Signalling Networks},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={372-286}
}
@inproceedings{Manca:Metabolic,
author={V. Manca},
title={Metabolic P systems for biomolecular dynamics},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={15--26}
}
@inproceedings{Manca:MP_Systems:WMC7:2006,
author={V. Manca},
title={MP Systems Approaches to Biochemical Dynamics: Biological Rhythms and Oscillations},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={40-53}
}
@inproceedings{Manca:Topics_and_Problems:4BWMC:2006,
author={Vicenzo Manca},
title={Topics and Problems in Metabolic {P} Systems},
booktitle={Fourth Brainstorming Week on Membrane Computing, Sevilla, January 30 - February
3, 2006. Volume II},
year={2006},
publisher={F{\'e}nix Editora},
editor={Miguel Angel Guti{\'e}rrez-Naranjo and Gheorghe Paun and Agust{\'i}n Riscos-N{\'u}{\~n}ez
and Francisco Jos{\'e} Romero-Campero},
pages={173--184},
abstract={P metabolic systems are a special class of P systems which seem to be adequate
for expressing biological phenomena related to metabolism and signaling
transduction in biological systems. We give the basic motivation for their
introduction and some ideas about their applicability and development.}
}
@inproceedings{Korczynski:Paun_systems:BIC-TA:2006,
author={W. Korczynski},
title={Paun's systems as models of economic systems},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Korczynski:Paun:2006,
author={W. Korczynski},
title={Paun's systems as models of economic systems},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={124--130}
}
@inproceedings{Xu:Tissue,
author={Xian Xu},
title={Tissue P systems with parallel rules on channels},
booktitle={Pre-proceedings of International Conference on Bio-Inspired Computing -
Theory and Applications, BIC-TA 2006, Membrane Computing Section},
year={2006},
month={September},
address={Wuhan, China},
pages={168--177}
}
@inproceedings{Xu:Tissue_P_systems:BIC-TA:2006,
author={Xian Xu},
title={Tissue P systems with parallel rules on channels},
booktitle={Proc. Bio-Inspired Computing -- Theory and Applications Conf., BIC-TA 2006,
Wuhan, China, September 2006, Membrane Computing Section.},
year={2006}
}
@inproceedings{Pu:Simulation_of_biomolecular:WHPCLF:2006,
author={Y. Pu and Y. Yu and X. Dong},
title={Simulation of biomolecular processes by using stochastic P systems},
booktitle={Workshop on High Performance Computing in the Life Sciences},
year={2006},
month={October},
address={Ouro Preto, Brasil}
}
@inproceedings{Suzuki:An,
author={Y. Suzuki},
title={An Attempt to Analyze the Dynamics of Abstract Rewriting Systems on Multisets},
booktitle={Pre-proceedings of Membrane Computing, International Workshop, WMC7},
year={2006},
address={Leiden, The Netherlands},
editor={H.J. Hoogeboom and Gh. Paun and G. Rozenberg},
pages={501-506}
}
@inproceedings{Alhazov.etal:Partial:BWMC2007,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald and Sergey Verlan},
title = {Partial Versus Total Halting in {P} Systems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
publisher = {F{\'e}nix Editora},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {Miguel-Angel Guti{\'e}rrez-Naranjo and {\relax Gh}eorghe P{\u a}un and Alvaro Romero-Jim{\'e}nez
and Agust{\'\i}n Riscos-N{\'u}{\~n}ez},
pages = {1--20},
abstract = {We consider a new variant of the halting condition in P systems
i.e., a computation in a P system is already called halting if
not for all membranes a rule is applicable anymore at the same time
whereas usually a computation is called halting if no rule is applicable
anymore in the whole system. This new variant of partial halting
is especially investigated for several variants of P systems
working in different derivation modes.},
url = {http://www.gcn.us.es/5BWMC/5BWMC_proceedings.htm},
}
@inproceedings{Alhazov.Rogozhin:OutskinMinSA2m:PreWMC8:2007,
author = {Artiom Alhazov and {\relax Yu}rii Rogozhin},
title = {Skin Output in {P} Systems with Minimal Symport/Antiport
and Two Membranes},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year = {2007},
address = {Thessaloniki, Greece},
editor = {George Eleftherakis and Petros Kefalas and {\relax Gh}eorghe P{\u a}un},
pages = {99--110},
abstract = {It is known that symport/antiport P systems with two membranes
and minimal cooperation can generate any recursively enumerable sets
of natural numbers using exactly one superfluous object in the output membrane
where the output membrane is an elementary membrane. In this paper we consider
symport/antiport P systems where the output membrane is the skin membrane.
In this case we prove an unexpected characterization: symport/antiport P systems
with two membranes and minimal cooperation generate exactly the recursively
enumerable sets of natural numbers. The question about power of purely symport
P systems with two membranes and minimal cooperation where the output membrane
is the skin membrane is still open.},
url = {http://www.seerc.org/wmc8/procedings_web/PaperIndex.htm},
}
@inproceedings{Binder:Extended:5BWMC:2007,
author = {A. Binder and R. Freund and M. Oswald and L. Vock},
title = {Extended Spiking Neural P systems with Excitatory and Inhibitory Astrocytes},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}aun and A. Romero-Jimenez and A. Riscos-Nunez},
pages = {63--72},
}
@inproceedings{Gutierrez:Optimizing_membrane_system:PreWMC8:2007,
author = {A. Guti{\'e}rrez and L. Fernandez and F. Arroyo and G. Bravo},
title = {Optimizing membrane system implementation with multisets and evolution rules
compression},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year = {2007},
address = {Thessaloniki, Greece},
editor = {G. Eleftherakis and P. Kefalas, Gh. P{\u a}un},
pages = {345--362},
}
@inproceedings{Leporati:UREM:PreWMC8:2007,
author={A. Leporati},
title={Quantum ({UREM}) {P} systems: Background, definition and computational power},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={33--56}
}
@inproceedings{Leporati:Computational_Power:5BWMC:2007,
author = {A. Leporati and C. Zandron and C. Ferretti and G. Mauri},
title = {On the Computational Power of Spiking Neural P Systems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. Riscos-Nunez},
pages = {227--246},
}
@inproceedings{Leporati:Solving_numerical_NP:PreWMC8:2007,
author={A. Leporati and C. Zandron and C. Ferretti and G. Mauri},
title={Solving numerical {NP}-complete problems with spiking neural {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={405--424}
}
@inproceedings{Obtulowicz:Mathematical_Methods:5BWMC:2007,
author = {A. Obtulowicz},
title = {Some Mathematical Methods and Tools for an Analysis of Harmony-Seeking Computations},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. Riscos-N{\'u}{\~n}ez},
pages = {246--262},
}
@inproceedings{Obtulowicz:Multigraphical_membrane:PreWMC8:2007,
author={A. Obtulowicz},
title={Multigraphical membrane systems: a visual formalism for modeling complex
systems in biology and evolving neural networks},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={509--512}
}
@inproceedings{Paun:On_flip_flop:PreWMC8:2007,
author={A. Paun and A. Rodriguez-Paton},
title={On flip-flop membrane systems with proteins},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={513--526}
}
@inproceedings{Tejedor:An_architecture_for:SALR:2007,
author={A. Tejedor and L. Fernandez and F. Arroyo and G. Bravo},
title={An architecture for attacking the bottleneck communication in {P} systems},
booktitle={Proceedings of the 12th Int. Symposium on Artificial Life and Robotics},
year={2007},
month={Jan 25-27},
address={Beppu, Oita, Japan},
editor={M. Sugisaka and H. Tanaka},
pages={500-505}
}
@inproceedings{Aman:reachability,
author={B. Aman and G. Ciobanu},
title={On the reachability problem in {P} systems with mobile membranes},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={111--123}
}
@inproceedings{Bonchis:Information:5BWMC:2007,
author = {C. Bonchis and C. Izbasa and G. Ciobanu},
title = {Information Theory over Multisets},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. Riscos-N{\'u}{\~n}ez},
pages = {73--86},
}
@inproceedings{Bonchis:Information,
author={C. Bonchis and C. Izbasa and G. Ciobanu},
title={Information theory over multisets},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={165--172}
}
@inproceedings{Graciani-Diaz:Model_for_Ballistic:5BWMC:2007,
author = {C. Graciani-Diaz and M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez},
title = {A Membrane Computing Model for Ballistic Depositions},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. Riscos-N{\'u}{\~n}ez},
pages = {179--198},
}
@inproceedings{Diaz-Pernil:cellular_solution:PreWMC8:2007,
author = {D. Diaz-Pernil and M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez and A. N{\'u}{\~n}ez},
title = {A cellular solution to subset sum using division of non-elementary membranes and dissolution, with time and initial resources bounded by log $k$},
booktitle = {Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year = {2007},
address = {Thessaloniki, Greece},
editor = {G. Eleftherakis and P. Kefalas, Gh. P{\u a}un},
pages = {301--316},
}
@inproceedings{Diaz-Pernil:Subset_Sum:5BWMC:2007,
author = {D. Diaz-Pernil and M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez and A. N{\'u}{\~n}ez},
title = {Subset Sum with Tissue P Systems with Cell Division},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {113--130},
}
@inproceedings{Molteni:Frequency_MS:PreWMC8:2007,
author={D. Molteni and C. Ferretti and G. Mauri},
title={Frequency membrane systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={445--454}
}
@inproceedings{Ramirez:Software_Tool:5BWMC:2007,
author = {D. Ramirez-Martinez and M.A. Guti{\'e}rrez-Naranjo},
title = {A Software Tool for Dealing with Spiking Neural P Systems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {299--314},
}
@inproceedings{Csuhaj:P_systems_with_string_objects:PreWMC8:2007,
author={E. Csuhaj-Varju and G. Vaszil},
title={{P} systems with string objects and with communication by request},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={267--278}
}
@inproceedings{Bernardini:A,
author={F. Bernardini and M. Gheorghe and F.J. Romero-Campero and N. Walkinshaw},
title={A hybrid approach to modelling biological systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={139--164}
}
@inproceedings{Bernardini:Networks:5BWMC:2007,
author = {F. Bernardini and M. Gheorghe and M. Margenstern and S. Verlan},
title = {Networks of Cells and Petri Nets},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {33--62},
}
@inproceedings{Ciobanu:What_is_an_event:PreWMC8:2007,
author={G. Ciobanu and D. Lucanu},
title={What is an event for membrane systems?},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={255--266}
}
@inproceedings{Ciobanu:Networks_of_Mealy:PreWMC8:2007,
author={G. Ciobanu and M. Gontineac},
title={Networks of Mealy multiset automata},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={243-- 254}
}
@inproceedings{Delzanno:dynamics_of_PB:PreWMC8:2007,
author={G. Delzanno and L. Van Begin},
title={On the dynamics of {PB} systems with volatile membranes},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={279--300}
}
@inproceedings{Paun:Twenty_Six:5BWMC:2007,
author = {Gh. Paun},
title = {Twenty Six Research Topics About Spiking Neural P Systems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {363--280},
}
@inproceedings{Stefan:MC_in_Connex:PreWMC8:2007,
author={Gh. Stefan},
title={Membrane computing in Connex environment},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={81--98}
}
@inproceedings{Ramesh:Rewriting_P_systems:PreWMC8:2007,
author={H. Ramesh and R. Rama},
title={Rewriting {P} systems with conditional communication: improved hierarchies},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={527--538}
}
@inproceedings{Stamatopoulou:OPERAS:PreWMC8:2007,
author={I. Stamatopoulou and P. Kefalas and M. Gheorghe},
title={OPERAS$_{CC}$: An instance of a formal framework for {MAS} modelling based
on population {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={551--566}
}
@inproceedings{Ardelean:Magnetotactic:5BWMC:2007,
author = {I.I. Ardelean and M. Ignat and C. Moisescu},
title = {Magnetotactic Bacteria and Their Significance for P Systems and Nanoactuators},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {21--32},
}
@inproceedings{Kelemen:Plain_talk_about:PreWMC8:2007,
author={J. Kelemen},
title={Plain talk about language-theoretic models of multi-agent systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={395--404}
}
@inproceedings{Tejedor:Algorithm_of_rules:PreWMC8:2007,
author={J.A. Tejedor and L. Fernandez and F. Arroyo and S. Gomez},
title={Algorithm of rules applications based on competitiveness of evolution rules},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={567--580}
}
@inproceedings{Sempere:Characterizing_membrane:PreWMC8:2007,
author={J.M. Sempere and D. Lopez},
title={Characterizing membrane structures through multiset tree automata},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={539--550}
}
@inproceedings{Sempere:Tree_Automata:5BWMC:2007,
author = {J.M. Sempere and D. Lopez},
title = {On Two Families of Multiset Tree Automata},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {315--325},
}
@inproceedings{Subramanian:image_generation:ICSP:2007,
author={K.G. Subramanian and S. Hemalatha and C. Sri Hari Nagore},
title={On image generation by sequential/parallel rewriting P systems},
booktitle={Proc. Intern. Conf. on Signal Processing, Communications and Networking,
Anna University, Chennai, IEEE - IETE},
year={2007},
pages={70--73}
}
@inproceedings{Bernardinello:Modeling,
author={L. Bernardinello and N. Bonzanni and M. Mascheroni and L. Pomello},
title={Modeling symport/antiport {P} systems with a class of hierarchical Petri
nets},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={123--138}
}
@inproceedings{Bianco:Psim:PreWMC8:2007,
author={L. Bianco},
title={Psim: A computational platform for metabolic {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={1--20}
}
@inproceedings{Cienciala:number_of_agents:PreWMC8:2007,
author={L. Cienciala and L. Ciencialova and A. Kelemenova},
title={On the number of agents in {P} colonies},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={227--242}
}
@inproceedings{Ciencialova:Variations_on:WFM06:2007,
author={L. Ciencialova and L. Cienciala},
title={Variations on the theme: {P} colonies},
booktitle={Proc. First Intern. Workshop WFM06},
year={2007},
address={Ostrava},
editor={D. Kol and A. Meduna},
pages={27--34}
}
@inproceedings{Fernandez:Parallel_software:SALR:2007,
author={L. Fernandez and F. Arroyo and I. Garcia and A. Gutierrez},
title={Parallel software architectures analysis for implementing {P} systems},
booktitle={Proceedings of the 12th Int. Symposium on Artificial Life and Robotics},
year={2007},
month={Jan 25-27},
address={Beppu, Oita, Japan},
editor={M. Sugisaka and H. Tanaka},
pages={494-499}
}
@inproceedings{Cardona:Hierarchical,
author={M. Cardona and M.A. Colomer and M.J. Perez-Jimenez and A. Zaragoza},
title={Hierarchical clustering with membrane computing},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={185--204}
}
@inproceedings{Garcia-Arnau:Spiking:5BWMC:2007,
author = {M. Garcia-Arnau and D. Perez and A. Rodriguez-Paton and P. Sosik},
title = {Spiking Neural P Systems: Stronger Normal Forms},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {157--178},
}
@inproceedings{Ionescu:Adjoining_Controlled:5BWMC:2007,
author = {M. Ionescu and D. Sburlan},
title = {P Systems with Adjoining Controlled Communication Rules},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {199--212},
}
@inproceedings{Ionescu:Some_applications_of:PreWMC8:2007,
author={M. Ionescu and D. Sburlan},
title={Some applications of spiking neural {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={383--394}
}
@inproceedings{Ionescu:Applications_of:5BWMC:2007,
author = {M. Ionescu and D. Sburlan},
title = {Several Applications of Spiking Neural P Systems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {213--226},
}
@inproceedings{Umeki:Direct_simulation_of:PreWMC8:2007,
author={M. Umeki and Y. Suzuki},
title={Direct simulation of the Oregonator model by using a class of {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={581--588}
}
@inproceedings{Perez-Jimenez:Schema_Based_on:5BWMC:2007,
author = {M.J. P{\'e}rez-Jim{\'e}nez and T. Yokomori},
title = {Membrane Computing Schema Based on String Insertions},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {281-- 298},
}
@inproceedings{Busi:Causality,
author={N. Busi},
title={Causality in membrane systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={173--184}
}
@inproceedings{Busi:Causal,
author = {N. Busi},
title = {Towards a Causal Semantics for Brane Calculi},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {97--112},
}
@inproceedings{Murphy:Active_membrane:PreWMC8:2007,
author={N. Murphy and D. Woods},
title={Active membrane systems without charges and using only symmetric elementary
division characterize {P}},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={455--470}
}
@inproceedings{Frisco:Conformon-P_systems:PreWMC8:2007,
author={P. Frisco},
title={Conformon-P systems with negative values},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis, P. Kefalas, Gh. Paun},
pages={331-344}
}
@inproceedings{Frisco:Advances,
author={P. Frisco and D.W. Corne},
title={Advances in modeling the dynamics of HIV infection with conformon-{P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={21--32}
}
@inproceedings{Barbuti:The,
author={R. Barbuti and A. Maggiolo-Schettini and P. Milazzo and A. Troina},
title={The calculus of looping sequences for modeling biological membranes},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={57--80}
}
@inproceedings{Borrego:VisualTissue:5BWMC:2007,
author = {R. Borrego-Ropero and D. Diaz-Pernil and J.A. Nepomuceno},
title = {VisualTissue: A Friendly Tool to Study Tissue P Systems Solutions for Graph
Problems},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {87--96},
}
@inproceedings{Ceterchi:Simulating,
author={R. Ceterchi and M.J. Perez-Jimenez and A.I. Tomescu},
title={Simulating the bitonic sort on a {2D}-mesh with {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={205--226}
}
@inproceedings{Freund:Polarizationless:5BWMC:2007,
author = {R. Freund and Gh. P{\u a}un and M.J. P{\'e}rez-Jim{\'e}nez },
title = {Polarizationless P Systems with Active Membranes Working in the Minimally
Parallel Manner},
booktitle = {Proceedings of the Fifth Brainstorming Week on Membrane Computing},
year = {2007},
month = {January 29th - February 2},
address = {Sevilla (Spain)},
editor = {M.A. Guti{\'e}rrez-Naranjo and Gh. P{\u a}un and A. Romero-Jim{\'e}nez and A. N{\'u}{\~n}ez},
pages = {131--156},
}
@inproceedings{Freund:Spiking_neural:SALR:2007,
author={R. Freund and M. Oswald},
title={Spiking neural P systems with inhibitory axons},
booktitle={Proceedings of the 12th Int. Symposium on Artificial Life and Robotics},
year={2007},
month={Jan 25-27},
address={Beppu, Oita, Japan},
editor={M. Sugisaka and H. Tanaka},
pages={509-512}
}
@inproceedings{Freund:formal_framework:PreWMC8:2007,
author={R. Freund and S. Verlan},
title={A formal framework for {P} systems},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={317--330}
}
@inproceedings{Hinze:Hill_kinetics_meets_P_systems:PreWMC8:2007,
author={T. Hinze and S. Hayat and T. Lenser and N. Matsumaru and P. Dittrich},
title={Hill kinetics meets {P} systems: A case study on gene regulatory networks
as computing agents in silico and in vivo},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={363--382}
}
@inproceedings{Mazza:SBML_functionalities:PreWMC8:2007,
author={T. Mazza},
title={Towards a complete covering of {SBML} functionalities},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={425--444}
}
@inproceedings{Nguyen:Balancing_performance:PreWMC8:2007,
author={V. Nguyen and D. Kearney and G. Gioiosa},
title={Balancing performance, flexibility and scalability in a parallel computing
platform for membrane computing applications},
booktitle={Pre-proceedings of Membrane Computing, International Workshop - WMC8},
year={2007},
address={Thessaloniki, Greece},
editor={G. Eleftherakis and P. Kefalas, Gh. Paun},
pages={471--508}
}
@inproceedings{Suzuki:Dynamics_of:SALR:2007,
author={Y. Suzuki},
title={Dynamics of an abstract chemical system with few molecules},
booktitle={Proceedings of the 12th Int. Symposium on Artificial Life and Robotics},
year={2007},
month={Jan 25-27},
address={Beppu, Oita, Japan},
editor={M. Sugisaka and H. Tanaka},
pages={506-508}
}
@inbook{Dersanambika:Hexagonal_contextual:2006,
author={K.S. Dersanambika and K. Krithivasan and H.K. Agarwal and J. Gupta},
title={Hexagonal contextual array {P} systems},
publisher={World Scientific},
address={Singapore},
booktitle={Formal Models, Languages and Applications},
editor={K.G. Subramanian, K. Rangarajan, M. Mukund }
}
@inbook{Gutierrez-Naranjo:Characterizing_tractability:2006,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez and A. Riscos-Nunez and F.J. Romero-Campero and A. Romero-Jim{\'e}nez},
title = {Characterizing tractability by cell-like membrane systems},
publisher = {World Scientific},
address = {Singapore},
booktitle = {Formal Models, Languages and Applications},
editor = {K.G. Subramanian, K. Rangarajan, M. Mukund },
}
@inbook{Paun:Where_Mathematics:On_Membrane:2000,
author={Andrei P{\u a}un and Mihaela P{\u a}un},
title={On Membrane Computing Based on Splicing},
chapter={36},
year={2000},
month={November},
publisher={Kluwer Academic Publishers, Dordrecht Hardbound},
pages={409--422},
address={Dordrecht},
booktitle={Where Mathematics, Computer Science, Linguistics, and Biology Meet},
editor={Carlos Mart{\'i}n-Vide and Victor Mitrana }
}
@inbook{Calude:Computing_with:Computing_with:2000,
author={Cristian S. Calude and Gheorghe P{\u a}un},
title={Computing with Membranes},
chapter={3},
year={2000},
publisher={Taylor and Francis},
address={London},
booktitle={Computing with Cells and Atoms}
}
@inbook{Suzuki:Recent_Topics_in:Investigation_of_an:2000,
author={Yasuhiro Suzuki and Junji Takabayashi and Hiroshi Tanaka},
title={Investigation of an Ecological System by Using an Abstract Rewriting System
on Multisets},
year={2000},
month={August},
publisher={Editura Academiei Romane},
pages={300--309},
address={Bucharest},
booktitle={Recent Topics in Mathematical & Computational Linguistics. Papers in Honor
of Solomon Marcus on the Occasion of his 75th Birthday},
editor={Carlos Martin-Vide and Gheorghe P{\u a}un }
}
@inbook{Ito:Words_Semigroups_and:A_characterization_of:01,
author={Masami Ito and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={A characterization of {Parikh} sets of {ET0L} languages in terms of {P}
systems},
year={2001},
publisher={World Scientific},
pages={239--254},
address={Singapore},
booktitle={Words, Semigroups, and Transductions: Essays in Honour of Gabriel Thierrin,
on the Occasion of His 80th Birthday},
editor={Masami Ito and Gheorghe P{\u a}un and Sheng Yu }
}
@inbook{Mauri:Membrane_Systems_for:Emergence_in_Complex:02,
author={Giancarlo Mauri and Claudio Zandron},
title={Membrane Systems for Computing},
year={2002},
month={July},
publisher={Kluwer Academic/Plenum Publishers Hardbound},
pages={213--232},
address={New York},
booktitle={Emergence in Complex, Cognitive, Social, and Biological Systems},
editor={G. Minati and E. Pessa }
}
@inbook{Cienciala:Kognice_a_umely:Zivot_ve_svete:2002,
author={Ludek Cienciala and Alica Kelemenova},
title={Zivot ve svete symbolu: pocitani pomoci membran},
year={2002},
publisher={Slezska Univ.},
address={Opava},
note={in vol "Kognice a umely zivot II"},
booktitle={Kognice a umely zivot II},
editor={Jozef Kelemen and V. Kvasnicka }
}
@inbook{Sosik:Kognice_a:Membranove_vypocty:2002,
author={Petr Sosik and Jiri Matysek},
title={Membranove vypocty: komunikace versus reakce},
year={2002},
publisher={Slezska Univ.},
pages={233--244},
address={Opava},
note={in vol "Kognice a umely zivot II"},
booktitle={Kognice a umely zivot II},
editor={Jozef Kelemen and V. Kvasnicka }
}
@inbook{Ramos-Espina:Recursos_precomputados:2004,
author={Antonio Jesus Ramos-Espina},
title={Uso de recursos precomputados en sistemas celulares},
chapter={3},
year={2004},
publisher={Fenix Editorial},
pages={159--241},
address={Sevilla},
booktitle={Modelos de Computacion Molecular, Celular y Cuantica},
editor={Mario Jes{\'u}s Perez-Jimenez and Agust{\'i}n Riscos-Nunez }
}
@inbook{Martin:MC_Results_problems:2004,
author={Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un},
title={Membrane Computing: New Results, New Problems},
year={2004},
publisher={World Scientific Publishing Co. Pte. Ltd},
pages={613--623},
booktitle={Current Trends in Theoretical Computer Science. The challenge of the new
century. Vol 2. Formal Models and Semantics},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa }
}
@inbook{Martin-Vide:MMB:Symport_Antiport_Syrvey:2004,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={{P} systems with Symport/Antiport Rules. A Survey},
year={2004},
publisher={Springer},
pages={175--192},
series={Natural Computing Series},
booktitle={Modelling in Molecular Biology},
editor={Gabriel Ciobanu and Grzegorz Rozenberg }
}
@inbook{Martin:Language_generating:2004,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Language generating by means of Membrene Systems},
year={2004},
publisher={World Scientific Publishing Co. Pte. Ltd},
pages={599--611},
booktitle={Current Trends in Theoretical Computer Science. The challenge of the new
century. Vol 2. Formal Models and Semantics},
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa }
}
@inbook{Besozzi:A_survey_of_latest:2004,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={A survey of latest results on {P} systems with deadlock},
year={2004},
publisher={Kronos Editorial},
pages={17--46},
address={Sevilla},
note={To appear},
booktitle={Recent Results in Natural Computing},
editor={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jimenez and Fernando Sancho-Caparrini
}
@inbook{Bernardini:Aspects_of_MC:Eilenberg:2004,
author={Francesco Bernardini and Marian Gheorghe and Mike Holcombe},
title={Eilenberg {P} systems with Symbol-Objects},
year={2004},
publisher={Springer},
pages={49--60},
volume={2950},
series={Lecture Notes in Computer Science},
booktitle={Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion
of his 70th birthday},
editor={Nata{\u s}a Jonoska and Gheorghe P{\u a}un and Grzegorz Rozenberg }
}
@inbook{Freund:Aspects_of_MC:Splicing:2004,
author={Franziska Freund and Rudolf Freund and Marion Oswald},
title={Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems},
year={2004},
publisher={Springer},
pages={139--151},
volume={2950},
series={Lecture Notes in Computer Science},
booktitle={Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion
of his 70th birthday},
editor={Nata{\u s}a Jonoska and Gheorghe P{\u a}un and Grzegorz Rozenberg }
}
@inbook{Paun:Membrane_computing_Main_ideas:2004,
author={Gheorghe P{\u a}un},
title={Membrane computing: Main ideas, basic results, applications},
year={2004},
publisher={Idea Group Publ.},
address={London},
booktitle={Molecular Computational Models: Unconventional Approaches},
editor={Marian Gheorghe }
}
@inbook{Paun:Aspects_of_MC:Non_standard:2004,
author={Gheorghe P{\u a}un},
title={Membrane Computing: Some Non-standard Ideas},
year={2004},
publisher={Springer},
pages={322--337},
volume={2950},
series={Lecture Notes in Computer Science},
booktitle={Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion
of his 70th birthday},
editor={Nata{\u s}a Jonoska and Gheorghe P{\u a}un and Grzegorz Rozenberg }
}
@inbook{Paun:Membrane_Computing_Some_Recent:2004,
author={Gheorghe P{\u a}un},
title={Membrane computing. {S}ome recent results and current research topics},
year={2004},
publisher={Kronos Editorial},
address={Sevilla},
booktitle={Recent Results in Natural Computing},
editor={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini
}
@inbook{Sempere:Complexity_applications:2004,
author={Jos{\'e} M. Sempere},
title={Complexity applications of covering rules in {P} systems},
year={2004},
publisher={Kronos Editorial},
pages={277--291},
address={Sevilla},
note={To appear},
booktitle={Recent Results in Natural Computing},
editor={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jimenez and Fernando Sancho-Caparrini
}
@inbook{Kari:Aspects_of_MC:minimal_symport:2004,
author={Lila Kari and Carlos Mart{\'i}n-Vide and Andrei P{\u a}un},
title={On the Universality of {P} systems with Minimal Symport/Antiport Rules},
year={2004},
publisher={Springer},
pages={254--265},
volume={2950},
series={Lecture Notes in Computer Science},
booktitle={Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion
of his 70th birthday},
editor={Nata{\u s}a Jonoska and Gheorghe P{\u a}un and Grzegorz Rozenberg }
}
@inbook{PerezJ:Aspects_of_MC:P_versus_MP:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={The {P} versus {NP} problem through cellular computing with membranes},
year={2004},
publisher={Springer},
pages={338--352},
volume={2950},
series={Lecture Notes in Computer Science},
booktitle={Aspects of Molecular Computing - Essays dedicated to Tom Head on the occasion
of his 70th birthday},
editor={Nata{\u s}a Jonoska and Gheorghe P{\u a}un and Grzegorz Rozenberg }
}
@inbook{Perez-Jimenez:MC_as_production_systems:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco Jos{\'e} Romero-Campero},
title={Membrane computing as production systems},
year={2004},
publisher={Kronos Editorial},
pages={167--204},
address={Sevilla},
note={To appear},
booktitle={Recent Results in Natural Computing},
editor={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jimenez and Fernando Sancho-Caparrini
}
@inbook{Georgiu:MBDinCom_Graphics:App_of_MC:2005,
author={Alexandros Georgiou and Marian Gheorghe and Francesco Bernardini},
title={Membrane Based Devices Used in Computer Graphics},
year={2005},
publisher={Springer-Verlag},
pages={253--280},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Alhazov.Sburlan:PSort:VAPS2005,
author = {Artiom Alhazov and Drago{\c s} Sburlan},
title = {Static Sorting {P}~Systems},
year = {2005},
publisher = {Springer-Verlag},
pages = {215--252},
booktitle = {Applications of Membrane Computing},
editor = {Gabriel Ciobanu and {\relax Gh}eorghe P{\u a}un
and Mario J. P{\'e}rez-Jim{\'e}nez},
abstract = {This chapter deals with the application of P systems
to sorting problems. Traditional studies of sorting assume
constant time for comparing two numbers and compute
the time complexity with respect to the number of components
of a vector to be sorted. Here, we assume the number of components
to be a fixed number k, and study various algorithms
based on different models of P systems and their time complexities
with respect to the maximal number or to the sum of the numbers.
Massively parallel computations that can be realized
within the framework of P systems may lead to major improvements
in solving the classical integer sorting problems.
Despite this important characteristic, we will see that
depending on the model used, the massive parallelism feature
cannot be always used, and so some results will have complexities
``comparable'' with the classical integer sorting algorithms.
Still, computing a word (ordered) from a multiset (unordered)
can be a goal not only for computer science, but also, e.g.
for biosynthesis (separating mixed objects according
to some characteristics). Here, we will move from
ranking algorithms that, starting with numbers
represented as multisets, produce symbols in an order
to effective sorting algorithms.},
url = {http://dx.doi.org/10.1007/3-540-29937-8_8},
}
@inbook{Ciobanu:Cell_Mediating_immunity:App_of_MC:2005,
author={Gabriel Ciobanu},
title={Modeling Cell--Mediated Immunity by Means of {P} Systems},
year={2005},
publisher={Springer-Verlag},
pages={157--178},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Ardelean:PS_Mechanosensitive_Channels:2005,
author={Ioan I. Ardelean and Daniela Besozzi and M.H. Garzon and Giancarlo Mauri
and S. Roy},
title={P System Models for Mechanosensitive Channels},
year={2005},
publisher={Springer-Verlag},
pages={43--80},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Gutierrez:MC_Software:App_of_MC:2005,
author={Miguel Angel Gutierrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'i}n Riscos-Nu{\~n}ez},
title={Available Membrane Computing Software},
year={2005},
publisher={Springer-Verlag},
pages={411--438},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Michel:Analysis_Public_Key_Protocol:App_of_MC:2005,
author={Olivier Michel and Florent Jacquemard},
title={An Analysis of a Public--Key Protocol with Membranes},
year={2005},
publisher={Springer-Verlag},
pages={281--300},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Gramatovici:Parsing_with_P_Automata:App_of_MC:2005,
author={Radu Gramatovici and Gemma Bel-Enguix},
title={Parsing with {P} Automata},
year={2005},
publisher={Springer-Verlag},
pages={389--412},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Nishida:MCModelPhotosynthesis:App_of_MC:2005,
author={Taishin Yasunobu Nishida},
title={A Membrane Computing Model of Photosynthesis},
year={2005},
publisher={Springer-Verlag},
pages={179--200},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Yasunobu:NP_Complete_Opt:App_of_MC:2005,
author={Taishin Yasunobu Nishida},
title={Membrane Algorithms: Approximate Algorithms for NP-Complete Optimization
Problems},
year={2005},
publisher={Springer-Verlag},
pages={301--312},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Suzuki:p53Signaing:App_of_MC:2005,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Modeling p53 Signaling Pathways by Using Multiset Processing},
year={2005},
publisher={Springer-Verlag},
pages={201--214},
booktitle={Applications of Membrane Computing},
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez }
}
@inbook{Lakshmanan:computational_efficiency:2006,
author={K. Lakshmanan and R. Rama},
title={The computational efficiency of insertion deletion tissue {P} systems},
year={2006},
publisher={World Scientific},
address={Singapore},
booktitle={Formal Models, Languages and Applications},
editor={K.G. Subramanian, K. Rangarajan, M. Mukund }
}
@inbook{Krishna:Towards_reducing_parallelism:2006,
author={S.N. Krishna and R. Rama},
title={Towards reducing parallelism in {P} systems},
year={2006},
publisher={World Scientific},
address={Singapore},
booktitle={Formal Models, Languages and Applications},
editor={K.G. Subramanian, K. Rangarajan, M. Mukund }
}
@proceedings{PPWMP:CdeA:2000,
editor={Cristian Calude and Michael J. Dinneen and Gheorghe P{\u a}un},
title={Pre-Proceedings of Workshop on Multiset Processing, Curtea de Arges, Romania,
August 2000},
year={2000},
month={August}
}
@proceedings{CDMTCS_TR140_CDMTCS_2000,
editor={Cristian Calude and Michael J. Dinneen and Gheorghe P{\u a}un},
title={Technical Report 140, CDMTCS, Univ. Auckland, New Zealand, 2000},
year={2000},
note={320 pages}
}
@proceedings{RJIST:4:1-2:2001,
title = {Romanian Journal of Information Science and Technology},
year = {2001},
editor = {Dan Dascalu},
volume = {4},
number = {1-2},
url = {http://www.imt.ro/Romjist/Volum4/Number4_1/cuprins4_1.htm#},
}
@proceedings{PPWMC:CdeA_R:2001,
editor={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Pre-Proceedings of Workshop on Membrane Computing, Curtea de Arges, Romania,
August 2001},
year={2001},
month={August}
}
@proceedings{TR_16/01:URiV:2001,
editor={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Technical Report 16/01, University Rovira i Virgili, Tarragona, Spain, 2001},
year={2001},
note={266 pages}
}
@proceedings{Multiset_Processing:2001,
editor={Cristian Calude and Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
title={Multiset Processing. Mathematical, Computer Science, Molecular Computing
Points of View},
publisher={Springer-Verlag},
year={2001},
address={Berlin},
note={360 + viii pages},
volume={2235},
series={Lecture Notes in Computer Science}
}
@proceedings{DBLP:conf/umc/2000,
editor={Ioannis Antoniou and Cristian Calude and Michael J. Dinneen},
title={Unconventional Models of Computation, UMC'2K, Proceedings of the Second
International Conference, Brussel, Belgium, 13-16 December 2000},
publisher={Springer},
year={2001},
isbn={1-85233-415-0}
}
@proceedings{Fundamenta_Informaticae:49:1-3:2002,
title = {Fundamenta Informaticae},
year = {2002},
editor = {Andrzej Skowron},
volume = {49},
number = {1-3},
url = {http://fi.mimuw.edu.pl/#},
}
@proceedings{PPWMC:CdeA_R:2002,
editor={Gheorghe P{\u a}un and Claudio Zandron},
title={Pre-Proceedings of Workshop on Membrane Computing, Curtea de Arges, Romania,
August 2002},
year={2002},
month={August},
note={and MolCoNet Publucation Nº 1, 2002 (394 pages)}
}
@proceedings{PreWMC:Tarragona:2004,
editor = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and {\relax Gh}eorghe P{\u a}un},
title = {Preproceedings of the Workshop on Membrane Computing
Tarragona, July 17-22 2003},
year = {2003},
eprint = {http://psystems.disco.unimib.it/download/WMC03.zip},
url = {http://grlmc-dfilrom.urv.cat/grlmc/reports/WMC03.html},
}
@proceedings{WMC_CdeA:2002,
editor={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa and Claudio Zandron},
title={Membrane Computing. International Workshop, WMC-CdeA 2002, Curtea de Arges,
Romania, August 19-23, 2002, Revised Papers},
publisher={Springer-Verlag},
year={2003},
address={Berlin},
note={423 + viii pages},
volume={2597},
url={http://link.springer.de/link/service/series/0558/tocs/t2597.htm#},
series={Lecture Notes in Computer Science},
isbn={3-540-00611-7}
}
@proceedings{BioSystems_CellComputing:2003,
editor={Marian Gheorghe and Mike Holcombe},
title={BioSystems-Cell Computing},
publisher={Elsevier Ireland Ltd.},
year={2003},
month={July},
note={Pages 83--186},
volume={70},
number={2}
}
@proceedings{BWMC:2003,
editor={Matteo Cavaliere and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Brainstorming Week on Membrane Computing, Tarragona, February 5-11 2003},
year={2003}
}
@proceedings{DBLP:conf/membrane/2003,
editor={Carlos Mart{\'i}n-Vide and Giancarlo Mauri and Gheorghe P{\u a}un and Grzegorz
Rozenberg and Arto Salomaa},
title={Membrane Computing, International Workshop, WMC 2003, Tarragona, Spain,
July 17-22, 2003, Revised Papers},
publisher={Springer-Verlag},
year={2004},
volume={2933},
series={Lecture Notes in Computer Science},
isbn={3-540-20895-X}
}
@proceedings{BWMC:SVQ:2004,
editor={Gheorghe P{\u a}un and Agust{\'i}n Riscos-N{\'u}{\~n}ez and Alvaro Romero-Jim{\'e}nez
and Fernando Sancho-Caparrini},
title={Second Brainstorming Week on Membrane Computing, Sevilla, Spain, Feb 2-7,
2004},
year={2004}
}
@proceedings{WMC5:Milano:2004,
editor={Giancarlo Mauri and Gheorghe P{\u a}un and Claudio Zandron},
title={Pre-proceedings of the Fifth Workshop on Membrane Computing (WMC5)},
year={2004},
month={June},
address={Milano. Italy},
note={446 pages}
}
@proceedings{Jonoska:NewGenerationComputing:MC:2004,
editor={K. Furukawa and T. Sato and T. Chikayama},
title={New Generation Computing. Special Feature. Membrane Computing},
publisher={Ohmsha, Ltd. and Springer},
year={2004},
month={August},
volume={22},
number={4}
}
@proceedings{Ciobanu:Applications_of_MC:2005,
editor={Gabriel Ciobanu and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Applications of Membrane Computing},
publisher={Springer-Verlag},
year={2005},
note={(442 + viii pages) - in press}
}
@proceedings{Mauri:WMC5:2005,
editor={Giancarlo Mauri and Gheorghe P{\u a}un and Mario J. Perez-Jimenez and Grzegorz
Rozenberg and Arto Salomaa},
title={Membrane Computing, International Workshop, WMC5, Milano, Italy, 2004, Selected
Papers},
publisher={Springer-Verlag},
year={2005},
note={(417 + viii pages)},
volume={3365},
series={Lecture Notes in Computer Science}
}
@book{Paun:Membrane_computing:Springer:2002,
author = {Gheorghe P{\u a}un},
title = {Membrane Computing. {A}n Introduction},
publisher = {Springer-Verlag},
year = {2002},
address = {Berlin},
isbn = {3-540-43601-4},
url = {http://ppage.psystems.eu/uploads/9/9d/VolumeContents_PaunBook.pdf},
}
@book{Perez_Jimenez:Teoria_de_la_complejidad_en:Kronos:2002,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Teor{\'i}a de la complejidad en modelos de computaci{\'o}n celular con membranas},
publisher={Kronos Editorial},
year={2002},
address={Sevilla},
isbn={84-86273-57-9}
}
@book{Perez_Jimenez:Computacion,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Computaci{\'o}n celular con membranas: {U}n modelo no convencional},
publisher={Kronos Editorial},
year={2002},
address={Sevilla},
isbn={84-86273-52-8}
}
@article{RomPer:AModel:2008,
author = {F.J. Romero-Campero and M.J. Perez-Jimenez},
title = {A model of the quorum sensing system in Vibrio fischeri},
journal = {Artificial Life},
volume = {14},
number = {1},
year = {2008},
pages = {95-109},
bibdate = {03/03/08},
}
@article{Paun:Tracing:2007,
author = {Gh. Paun},
title = {Tracing some open problems in membrane computing},
journal = {ROMJIST},
volume = {10},
number = {4},
year = {2007},
pages = {303-314},
bibdate = {02/22/08},
}
@article{PauPer:SpikRecent:2008,
author = {Gh. Paun and M.J. Perez-Jimenez},
title = {Spiking neural P systems. Recent results, research topics},
journal = {submitted},
year = {2008},
bibdate = {02/22/08},
}
@inproceedings{paun:spiking:2008,
author = {Gh. Paun},
title = {Spiking neural P systems with astrocyte-like control},
booktitle = {JUCS, 13, 11 (2007), 1707--1721.},
address = { },
}
@inproceedings{Ibarra:Paun:Memb:2008,
author = {O.H. Ibarra and Gh. P{\u a}un},
title = {Membrane computing: A general view},
booktitle = {Annals of European Academy of Sciences},
year = {to appear, 2008.},
address = { },
}
@inproceedings{Paun:Perez:SpikOverview:2008,
author = {Gh. Paun and M.J. Perez-Jimenez },
title = {Spiking neural P systems. An overview},
booktitle = {Advancing Artificial Intelligence through Biological Process
Applications (A.B. Porto, A. Pazos, W. Buno, eds.), Idea Group Publ., London, 2008.},
address = { },
}
@inproceedings{Paun:SpikingNeural:2008,
author = {Gh. Paun},
title = {Spiking neural P systems used as acceptors and transducers},
booktitle = {CIAA 2007, 12th Conf., Prague, July 2007, LNCS 4783 (J. Holub, J. Zdarek, eds.), Springer, Berlin, 2007, 1--4. },
address = { },
}
@article{Cavaliere:Experiments:2008,
author = {M. Cavaliere and I. Mura},
title = {Experiments on the reliability of stochastic spiking neural P systems},
journal = {Natural Computing},
volume = {to appear},
year = {2008},
bibdate = {02/13/08},
}
@article{Krishna:Onthecomp:2008,
author = {S.N. and G. Ciobanu},
title = {On the computational power of enhanced mobile membranes},
journal = {submitted},
year = {2008},
bibdate = {02/13/08},
}
@article{Metta:Spiking:2008,
author = {V.P. Metta and K. Krithivasan},
title = {Spiking Neural P systems and Petri nets},
journal = {submitted},
year = {2008},
bibdate = {02/13/08},
}
@article{GarciaArnau:Onthepower:2008,
author = {M. Garcia-Arnau and D. Perez and A. Rodriguez-Paton and P. Sosik},
title = {On the power of elementary operations in spiking neural P systems},
journal = {Natural Computing},
volume = {to appear},
year = {2008},
bibdate = {02/13/08},
}
@article{M.Garcia-Arnau:2007,
author = {M. Garcia-Arnau and D. Manrique and A. Rodriguez-Paton and P. Sosik},
title = {A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem},
journal = {BioSystems},
volume = {90},
number = {3},
year = {2007},
pages = {687-697},
bibdate = {02/13/08},
}
@article{Huang:2008b,
author = {L. Huang and N. Wang},
title = {A variant of P systems for optimization},
journal = {Neurocomputing},
volume = {to appear},
bibdate = {02/13/08},
}
@article{Teuscher:BioSystems:ToAppear,
author = {C. Teuscher},
title = {From membranes to systems: self-configuration and self-replication in membrane
systems},
journal = {BioSystems},
note = {To appear (IPCAT 2005)},
}
@article{Franco:Knee_joint_injury:,
author={G. Franco and N. Jonoska and B. Osborn and A. Plaas},
title={Knee joint injury and repair modeled by membrane systems},
journal={Biosystems},
note={To appear}
}
@article{Paun:MembraneComputingQuick,
author = {Gh. Paun},
title = {A quick overview of membrane computing with some details about spiking neural
{P} systems},
journal = {Frontiers of Computer Science in China},
note = {To appear},
}
@article{PaunPaun:MembraneEconomics,
author={Gh. Paun and R. Paun},
title={Membrane computing models for economics. {A}n invitation-survey},
journal={Studii \c si Cercet\u ari de Calcul Economic si Cibernetica Economica},
note={To appear}
}
@article{Muskulus:Cycles_and:,
author={M. Muskulus and D. Besozzi and R. Brijder and P. Cazzaniga and S. Houweling
and D. Pescini and G. Rozenberg},
title={Cycles and communicating classes in membrane systems and molecular dynamics},
journal={Theoretical Computer Science},
note={To appear}
}
@article{Muskulus:IJFCS:ToAppear,
author={M. Muskulus and R. Brijder},
title={Complexity of biocomputation: symbolic dynamics in membrane systems},
journal={Intern. J. Found. Computer Sci.},
note={To Appear}
}
@article{Paun:BEATCS:Computing_with_Correction:99,
author={Gheorghe P{\u a}un},
title={Computing with Membranes. {A} Correction. {T}wo Problems and Some Bibliographical
Remarks},
journal={Bulletin of the EATCS},
year={1999},
month={October},
number={69},
pages={141--144}
}
@article{Paun:BEATCS:Computing_with_M_Intro:99,
author={Gheorghe P{\u a}un},
title={Computing with Membranes. {A}n Introduction},
journal={Bulletin of the EATCS},
year={1999},
month={February},
number={67},
pages={139--152}
}
@article{Paun:FUND_INFORM:On_Synchronizat:99,
author={Gheorghe P{\u a}un and Sheng Yu},
title={On Synchronization in {P} systems},
journal={Fundamenta Informaticae},
year={1999},
month={June},
volume={38},
number={4},
pages={397--410}
}
@article{Petre:BEATCS:A_Normal_Form_f:99,
author={Ion Petre},
title={A Normal Form for {P} systems},
journal={Bulletin of the EATCS},
year={1999},
month={February},
number={67},
pages={165--172}
}
@article{Petre:J_UNIVERS_COMPUT_SCI:Mobile_Ambients:99,
author={Ion Petre and Luigia Petre},
title={Mobile Ambients and {P} systems},
journal={Journal of Universal Computer Science},
year={1999},
volume={5},
number={9},
pages={588--598},
abstract={The ambient calculus and the P-systems are models developed in different
areas of computer science. Still, they are based on similar concepts and
structures and are inspired from the same natural model of computation
[BeBo92]. On this basis, we point out how to transfer ideas and results
from one framework to the other. We prove that any P-system can be simulated
in ambient calculus. We also introduce the notion of mobile P-systems,
suitable to model and motivate security features for membrane computing.}
}
@article{Dassow:J_UNIVERS_COMPUT_SCI:On_the_Power_of:99,
author={J{\"u}rgen Dassow and Gheorghe P{\u a}un},
title={On the Power of Membrane Computing},
journal={Journal of Universal Computer Science},
year={1999},
volume={5},
number={2},
pages={33--49},
abstract={We continue the investigation of the power of the computability models introduced
in [12] under the name of transition super-cell systems. We compare these
systems with classic mechanisms in formal language theory, context-free
and matrix grammars, E0L and ET0L systems, interpreted as generating mechanisms
of number relations (we take the Parikh image of the usual language generated
by these mecha- nisms rather than the language). Several open problems
are also formulated.}
}
@article{Freund:Grammars:Generalized_P_S:99,
author={Rudolf Freund},
title={Generalized {P} systems with Splicing and Cutting/Recombination},
journal={Grammars},
year={1999},
month={December},
volume={2},
number={3},
pages={189--199},
abstract={P-systems recently were introduced by Gheorghe Paun as a new model for computations
based on membrane structures. Using the membranes as a kind of filter for
specific objects when transferring them into an inner compartment turned
out to be a very powerful mechanism in combination with suitable rules
to be applied within the membranes in the model of generalized P-systems,
GP-systems for short. In general, GP-systems allow for the simulation of
graph controlled grammars of arbitrary type based on productions working
on single objects. In this paper we consider GP-systems as computing devices
using splicing or cutting and recombination of strings. Various variants
of such systems are proved to have universal computational power, e.g.,
we show how test tube systems based on splicing or cutting and recombination
of strings can be simulated by the corresponding GP-systems.}
}
@article{Krishna:ROMJIST:A_Variant_of_P_:99,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={A Variant of {P} systems with Active Membranes: Solving {NP-Complete} Problems},
journal={Romanian Journal of Information Science and Technology},
year={1999},
volume={2},
number={4},
pages={357--367},
abstract={A new class of distributed computing models inspired from biology, that
of P systems, was recently introduced by Gh. Paun. Several variants of
P systems were already shown to be computationally universal, equal in
power to Turing Machines. In this paper, we propose a class of P systems
with active membranes where a membrane can be divided into an arbitrary
(but finite) number of membranes. We prove that this variant is able to
solve NP-complete problems in polynomial (in fact, linear) time. We exemplify
this assertion with the well known Hamiltonian Path Problem and the Node
Cover Decision Problem for undirected graphs.}
}
@article{Martin-Vide:BEATCS:collapsing_hierarchy:2000,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Computing with Membranes. {O}ne More Collapsing Hierarchy},
journal={Bulletin of the EATCS},
year={2000},
month={October},
number={72},
pages={183--187}
}
@article{Calude:Complexity:Computing_with_:00,
author={Cristian S. Calude and Gheorghe P{\u a}un},
title={Computing with Cells and Atoms in a Nutshell},
journal={Complexity},
year={2000},
volume={6},
number={1},
pages={38--48}
}
@article{Paun:J_COMPUT_SYST_SCI:Computing_with_:00,
author={Gheorghe P{\u a}un},
title={Computing with Membranes},
journal={Journal of Computer and System Sciences},
year={2000},
volume={61},
number={1},
pages={108--143},
note={and Turku Center for Computer Science-TUCS Report No 208}
}
@article{Paun:IJFCS:Computing_with_:00,
author={Gheorghe P{\u a}un},
title={Computing with Membranes ({P} systems): {A} variant},
journal={International Journal of Foundations of Computer Science},
year={2000},
month={March},
volume={11},
number={1},
pages={167--182},
note={and CDMTCS TR 098, Univ. of Auckland, 1999 (www.cs.auckland.ac.nz/CDMTCS).},
abstract={Membrane Computing is a recently introduced area of Molecular Computing,
where a computation takes place in a membrane structure where multisets
of objects evolve according to given rules (they can also pass through
membranes). The obtained computing models were called P systems. In basic
variants of P systems, the use of objects evolution rules is regulated
by a given priority relation; moreover, each membrane has a label and one
can send objects to precise membranes, identified by their labels. We propose
here a variant where we get rid of both there rather artificial (non-biochemical)
features. Instead, we add to membranes and to objects an 'electrical charge'
and the objects are passed through membranes according to their charge.
We prove that such systems are able to characterize the one-letter recursively
enumerable languages (equivalently, the recursively enumerable sets of
natural numbers), providing that an extra feature is considered: the membranes
can be made thicker or thinner (also dissolved) and the communication through
a membrane is possible only when its thickness is equal to 1. Several open
problems are formulated.}
}
@article{Paun:FUND_INFORM:Membrane_Comput:00,
author={Gheorghe P{\u a}un and Grzegorz Rozenberg and Arto Salomaa},
title={Membrane Computing with External Output},
journal={Fundamenta Informaticae},
year={2000},
month={February},
volume={41},
number={3},
pages={313--340},
keywords={decidability, formal language, membrane computing, natural computing}
}
@article{Paun:J_UNIVERS_COMPUT_SCI:Simulating_H_Sy:00,
author={Gheorghe P{\u a}un and Takashi Yokomori},
title={Simulating {H Systems} by {P} systems},
journal={Journal of Universal Computer Science},
year={2000},
volume={6},
number={1},
pages={178--193},
note={(www.iicm.edu/jucs). \url{http://www.jucs.org/jucs_6_1/simulating_h_systems_by}},
abstract={H systems are DNA computing models, based on the operation of splicing.
P systems are membrane computing models, where objects can evolve in parallel
in a hierarchical membrane structure. In particular, the objects can be
strings and the evolution rules can be based on splicing. Both H systems
with certain controls on the use of splicing rules and P systems of various
types are known to be computationally universal, that is, they characterize
the recursively enumerable languages. So, they are equivalent as the generative
power. The present paper presents a direct simulation of some controlled
H systems by splicing P systems. We achieve this goal for three basic regulation
mechanisms: H systems with permitting contexts, H systems with forbidding
contexts, and communicating distributed H systems. We can say that in this
way we get a uniform 'implementation' of the three types of H systems in
the form of a 'computing cell'.}
}
@article{Madhu_:ROMJIST:Inter-Membrane_:00,
author={Mutyam Madhu and Kamala Krithivasan},
title={Inter-Membrane Communication in {P} systems},
journal={Romanian Journal of Information Science and Technology},
year={2000},
volume={3},
number={4},
pages={335--352},
abstract={In this paper, we propose a method for communication between any two non-adjacent
membranes in a membrane system. In order to get this we propose a new variant
of P systems, P systems with message carriers, in which, whenever a source
membrane wants to send some message to a destination membrane, it will
create a message carrier with that message and send it to the destination.
Here we define various communication modes for inter-membrane communication.
This new variant of a P system is able to solve Traveling Salesperson Problem
for weighted complete graphs in a time linear in the number of nodes in
the graph and can simulate CD grammar systems with an external control.
By �external control� we mean controlling the sequence of components in
action by a graph. We also prove that our new variant is computationally
complete.}
}
@article{Krishna:IJCM:Sequential_parallel:2000,
author = {Shankara Narayanan Krishna and Raghavan Rama},
title = {On the Power of {P} systems Based on Sequential/Parallel Rewriting},
journal = {International Journal of Computer Mathematics},
year = {2000},
volume = {77},
number = {1-2},
pages = {1--14},
}
@article{Suzuki:ARTIF_LIFE:Chemical_Evolut:00,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={Chemical Evolution Among Artificial Proto-cells},
journal={Artificial Life},
year={2000},
volume={7},
pages={54--63}
}
@article{Suzuki:ROMJIST:On_a_LISP_Imple:00,
author={Yasuhiro Suzuki and Hiroshi Tanaka},
title={On a {LISP} Implementation of a Class of {P} systems},
journal={Romanian Journal of Information Science and Technology},
year={2000},
volume={3},
number={2},
pages={173--186},
abstract={We consider a class of P systems, which we call Artificial Cell Systems
(ACS), consisting of a membrane structure, multisets of symbols placed
in its regions, and a set of rewriting rules acting in all the regions.
Dissolving and creating membranes depends on the size of multisets. We
have implemented such a system by using LISP, in the particular variant
when the size of each multiset is bounded. Results of simulations of ACS
evolution are reported.}
}
@article{Obtulo:IJFCS:Membrane_Comput:01,
author={Adam Obtulowicz},
title={Membrane Computing and One-Way Functions},
journal={International Journal of Foundations of Computer Science},
year={2001},
month={August},
volume={12},
number={4},
abstract={There are presented certain membrane systems for computing the inverse of
one-way functions in a polynomial time. The membrane systems are derived
from some mathematical models of natural processes investigated in biochemistry
and they have been introduced by Gh. Paun.}
}
@article{Obtulo:ROMJIST:Deterministic_P:01,
author={Adam Obtulowicz},
title={Deterministic {P} systems for solving {SAT} Problem},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={195--202},
abstract={There are presented certain deterministic P-systems for solving SAT-problem
in linear time. The P-systems and the processes generated by them have
been introduced in the papers by Gheorghe Paun (P-Systems with Active Membranes:
Attacking NP Complete Problems, Journal of Automata, Languages and Combinatorics,
6, pp. 75-90, 2000 and Computing with membranes, Journal of Computer and
System Science, 61, 108-143, 2000).}
}
@article{Atanasiu:ROMJIST:Arithmetic_with:01,
author={Adrian Atanasiu and Carlos Mart{\'i}n-Vide},
title={Arithmetic with Membranes},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={5--20},
abstract={P systems are computing models where certain objects can evolve in parallel
into an hierarchical membrane structure. Recent results show that this
model is a promising framework for solving NP-complete problems in polynomial
time. The present paper considers the possibility to perform operations
with integer numbers in a P system. All four arithmetical operations are
implemented in a way which seems to have a lower complexity than when implementing
them on usual computer chips.}
}
@article{Rodrig:BEATCS:On_the_Universa:01,
author={Alfonso Rodriguez-Pat{\'o}n},
title={On the Universality of {P} systems with Membrane Creation},
journal={Bulletin of the EATCS},
year={2001},
month={June},
number={74},
pages={229--234}
}
@article{Paun:ROMJIST:On_P_Systems_wi:01,
author={Andrei P{\u a}un},
title={On {P} systems with Partial Parallel Rewriting},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={203--210},
abstract={We settle here an open problem recently formulated by Krishna and Rama about
P systems with partially parallel rewriting: we prove that such systems
having only six membranes generate all the recursively enumerable languages.}
}
@article{Paun:Math.-Informatics_Series:Further_symport:2001,
author={Andrei P{\u a}un and Gheorghe P{\u a}un and Alfonso Rodriguez-Pat{\'o}n},
title={Further remarks on {P} systems with symport rules},
journal={Ann. Univ. Al.I. Cuza Iasi, Math.-Informatics Series},
year={2001},
volume={10},
pages={3--18}
}
@article{Baranda:ROMJIST:Data_Structures:01,
author={Angel V. Baranda and Juan Castellanos and Rafael Gonzalo and Fernando Arroyo
and Luis-F. Mingo},
title={Data Structures for Implementing Transition {P} systems in Silico},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={21--32},
abstract={P systems are a new parallel and distributed computational model, based
onn the membrane structure notion. In the regions defined by membranes,
objects evolve according to given rules. In this way, we get transitions
among system configurations, hence computations. Where and how P systems
can be implemented is an open problem of the domain. One can look for implementations
on a biochemical support (in vivo, or in vitro), on traditional computers.
The implementation on digital computers can be a difficult task, at least
because of the high degree of parallelism and non-determinism specific
to P systems. However, this is an interesting challenge for computer researchers,
and some attempts have already been done to simulate some variant of P
Systems on a digital computer. This paper explores different data structures
meant to facilitate the implementation of transition P systems on a digital
computer. The presentation is structured in a such a manner to facilitate
the understanding of the final representation of transition P systems into
the proposed data structures. Firstly, we give a theoretical representation
of P systems, including the necessary notation to understand their operational
mode. Secondly, we study different data structures in which it is possible
to represent P systems Finally, we propose a computational paradigm in
order to determine the feasibility of simulating transition P systems by
a program running on a digital computer.}
}
@article{Martin:BEATCS:Language_genera:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={Language generating by means of membrane systems},
journal={Bulletin of the EATCS},
year={2001},
month={October},
number={75},
pages={199--218}
}
@article{Martin:CSJM:On_P_Systems_wi:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Alfonso Rodriguez-Pat{\'o}n},
title={On {P} systems with Membrane Creation},
journal={Computer Science Journal of Moldova},
year={2001},
volume={9},
number={2},
pages={134--145}
}
@article{Martin:ROMJIST:P_Systems_with_:01,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Alfonso Rodriguez-Pat{\'o}n},
title={{P} systems with Immediate Communication},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={171--182},
abstract={In the attempt to define P systems with the communication of objects through
membranes controlled in an as simple as possible manner, we consider the
case of string-objects (processed by rewriting or by splicing) with immediate
communication: the string obtained by applying an evolution rule is immediately
moved from the region where it is obtained to one of the neighboring regions,
nondeterministically chosen. Rewriting P systems of this type (and without
other controls on the communication or the rule application) are shown
to generate only matrix languages, while for splicing P systems we obtain
again the usual result from membrane system area: computational universality
(that is, a characterization of recursively enumerable languages).}
}
@article{Zandron:ROMJIST:Using_Membrane_:01,
author={Claudio Zandron and Claudio Ferretti and Giancarlo Mauri},
title={Using Membrane Features in {P} Systems},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={241--257},
abstract={In the basic variant of P systems, membranes are used as separators and
as channels of communication. Other variants, introduced to obtain more
'realistic' models, consider membranes with different features: membranes
of variable thickness, electrically charged membranes and active membranes
(membranes can be divided to create new membranes). These features are
not only useful to obtain 'realistic'models: we show how we can use them
to get simpler and faster models. This work has been supported by the Italian
Ministry of University (MURST), under project 'Unconventional Computational
Models: Syntactic and Combinatorial Methods'.}
}
@article{Calude:JMVL:Glimpse:2001,
author={Cristian S. Calude and Gheorghe P{\u a}un and Monica Tatar{\^a}m},
title={A Glimpse into Natural Computing},
journal={Journal of Multi-Valuate Logic},
year={2001},
volume={7},
pages={1--28}
}
@article{Paun:JALC:P_Systems_with_:01,
author={Gheorghe P{\u a}un},
title={{P} systems with Active Membranes: Attacking {NP-Complete} Problems},
journal={Journal of Automata, Languages and Combinatorics},
year={2001},
volume={6},
number={1},
pages={75--90},
note={and CDMTCS TR 102, Univ. of Auckland, 1999 (www.cs. auckland.ac.nz/CDMTCS).}
}
@article{Paun:BioSystems:From_Cells_to_C:01,
author={Gheorghe P{\u a}un},
title={From Cells to Computers: Computing with Membranes ({P} systems)},
journal={BioSystems},
year={2001},
month={March},
volume={59},
number={3},
pages={139--158},
abstract={The aim of this paper is to introduce to the reader the main ideas of computing
with membranes, a recent branch of (theoretical) molecular computing. In
short, in a cell-like system, multisets of objects evolve according to
given rules in the compartments defined by a membrane structure and compute
natural numbers as the result of halting sequences of transitions. The
model is parallel, nondeterministic. Many variants have already been considered
and many problems about them were investigated. We present here some of
these variants, focusing on two central classes of results: (1) characterizations
of the recursively enumerable sets of numbers and (2) possibilities to
solve NP-complete problems in polynomial �� even linear �� time (of course,
by making use of an exponential space). The results are given without proofs.
An almost complete bibliography of the domain, at the middle of October
2000, is also provided.}
}
@article{Paun:INT_J_COMPUT_MATH:P_Systems_with_:01,
author={Gheorghe P{\u a}un and Yasuhiro Suzuki and Hiroshi Tanaka},
title={{P} systems with Energy Accounting},
journal={International Journal of Computer Mathematics},
year={2001},
volume={78},
number={3},
pages={343--364}
}
@article{Georgescu:SUBBI:2001,
author={H. Georgescu},
title={An efficient way to model P systems by X machine systems},
journal={Studia Univ. Babes-Bolyai, Informatica},
year={2001},
volume={46},
number={1},
pages={3--17}
}
@article{Liu:JXMI:Evolutionary_Dy:01,
author={Jian Qin Liu and Katsunori Shimohara},
title={Evolutionary Dynamics for Heterogeneous {P} systems},
journal={Journal of Xi'an Mining Institute},
year={2001}
}
@article{Dassow:ActaCybernetica:P_Systems_with_:01,
author={J{\"u}rgen Dassow and Gheorghe P{\u a}un},
title={{P} systems with Communication Based on Concentration},
journal={Acta Cybernetica},
year={2001},
volume={15},
number={1},
pages={9--24},
abstract={We consider a variant of P systems where the communication of objects is
controlled by the 'concentration' of these objects: after each evolution
step, the objects are redistributed among the regions of the system in
such a way that each region contains the same number of copies of each
object (plus/minus one, when the number of objects is not divisible by
the number of regions). We show that P systems of this form, with only
one flip-flop catalyst but without using other control ingredients, can
generate the Parikh images of all matrix languages. When an unbounded number
of catalysts is available, a characterization of recursively enumerable
sets of vectors of natural numbers is obtained (by systems with only one
membrane).}
}
@article{Dassow:ACTA_INFORM:Tree-Systems_of:01,
author={J{\"u}rgen Dassow and Gheorghe P{\u a}un and Gabriel Thierrin and Sheng Yu},
title={Tree-Systems of Morphisms},
journal={Acta Informatica},
year={2001},
month={November},
volume={38},
number={2},
pages={131--153},
abstract={Starting from the idea of determinism in membrane systems, we introduce
a language generating device consisting of morphisms placed in the nodes
of a tree. Initial strings are given in the leaves; by iteratively applying
the morphisms to them, we produce new strings, which are collected in the
root of the tree. Such a device is called a tree-system of morphisms (in
short, a T system). We investigate here the power of T systems, both in
the extended (a terminal alphabet is considered and only strings over it
are accepted) and non-extended case, mainly in comparison with classes
of languages in Lindenmayer hierarchy.}
}
@article{Madhu_:ROMJIST:P_Systems_with_:01,
author={Mutyam Madhu and Kamala Krithivasan},
title={{P} systems with Dynamic Membrane Polarization},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={135--154},
abstract={We propose here a variant of P systems with polarized membranes of variable
thickness, in which the charge of a membrane is equal to the net charge
of the string-objects it contains. As the charge of the membrane changes,
applicable rules of that membrane will also change, i.e., the set of rules
of a membrane with the positive charge is different from the set of rules
of the same membrane with the negative charge or with the neutral charge.
With this new variant of P systems, with degree 3 we achieve computational
completeness. With a fixed membrane structure with each membrane having
thickness one computational completeness is achieved with four membranes.
A generalization of this system is also considered where computational
completeness is achieved with two membranes.}
}
@article{Frisco:ROMJIST:On_Two_Variants:01,
author={Pierluigi Frisco},
title={On Two Variants of Splicing {P} systems},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={89--100},
abstract={New computability models, called membrane systems or P systems, based on
the evolution of objects in a membrane structure, were recently introduced.
The seminal paper of Gheorghe Paun describes three ways to look at them:
transition, rewriting and splicing P systems having different properties.
Here we investigate two variants of splicing P systems improving results
concerning their generative capability. One minimal result concerning the
number of membranes used is obtained.}
}
@article{Freund:ROMJIST:Sequential_P_Sy:01,
author={Rudolf Freund},
title={Sequential {P} systems},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={77--88},
abstract={We consider sequential variants of P-systems, the new model for computations
using membrane structures and recently introduced by Gheorghe Paun. Using
the permeabilty of the membranes for specific objects as a kind of filter
turns out to be a very powerful mechanism in combination with suitable
rules to be applied within the membranes. Generalized P-systems, GP-systems
for short, constitute the most general model of sequential P-systems, considered
in this paper. GP-systems allow for the simulation of graph-controlled
grammars of arbitrary type based on productions working on single objects;
for example, the general results we state in this paper can immediately
be applied to the graph-controlled versions of context-free string grammars,
n-dimensional -context-free array grammars, and elementary graph grammars.
Moreover, we consider GP-systems as molecular computing devices using splicing
or cutting and recombination of strings. Various variants of such systems
have universal computational power, too, e.g., test tube systems based
on splicing or cutting and recombination of strings can be simulated by
the corresponding GP-systems.}
}
@article{Freund:BEATCS:Special_variant:01,
author={Rudolf Freund},
title={Special variants of {P} systems inducing an infinite hiearchy with respect
to the number of membranes},
journal={Bulletin of the EATCS},
year={2001},
month={October},
number={75},
pages={209--219}
}
@article{Krishna:ROMJIST:Hybrid_P_System:01,
author={Shankara Narayanan Krishna and K. Lakshmanan and Raghavan Rama},
title={Hybrid {P} systems},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={111--123},
abstract={In this paper, we propose Hybrid P Systems, which are generative mechanisms
using two types of rules: context-free rules and context adjoining rules.
We prove that systems with seven membranes characterize the family of recursively
enumerable languages. We also investigate the power of this variant with
less than seven membranes by comparing it with the families of matrix languages,
E0L and ET0L languages.}
}
@article{Krishna:AC:P_Sys_with_Pict_objs:2001,
author={Shankara Narayanan Krishna and Kamala Krithivasan and Raghavan Rama},
title={{P} systems with Picture Objects},
journal={Acta Cybernetica},
year={2001},
volume={15},
number={1},
pages={53--74},
abstract={New computability models called P systems, based on the evolution of objects
in a membrane structure, were recently introduced. In this paper, we consider
two variants of P systems having ``complex objects'' like pictures as the
underlying data structure. The first variant is capable of generating pictures
with interesting patterns. We also investigate the generative power of
this variant by comparing it with the families of two dimensional matrix
languages. The second variant has some applications in pattern generation.}
}
@article{Krishna:JALC:P_Systems_with_:01,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={{P} systems with Replicated Rewriting},
journal={Journal of Automata, Languages and Combinatorics},
year={2001},
volume={6},
number={3},
pages={345--350}
}
@article{Krishna:BEATCS:A_Note_on_Paral:01,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={A Note on Parallel Rewriting in {P} systems},
journal={Bulletin of the EATCS},
year={2001},
month={February},
number={73},
pages={147--151}
}
@article{Head_To_Appear,
author={Tom Head},
title={Aqueous Simulations of Membrane Computations},
journal={Romanian Journal of Information Science and Technology},
year={2001},
note={To appear},
abstract={A scheme of definitions that formalizes a limited family of membrane computations
ispresented. The purpose is to provide a link between one of the approaches
to biomolecular computation,called aqueous computing, and the newly developing
concept of membrane computing, also called P-systems computing. This link
allows one to view the already completed aqueous computations as wet labrealizations,
or test tube simulations, of P-systems computations. It is hoped that the
elementary linkageestablished here will be expanded and that it will suggest
further developments in both P-systems and aqueous computing.}
}
@article{Manca:ROMJIST:Monoidals_for_M:01,
author={Vincenzo Manca},
title={Monoidals for Molecules and Membranes},
journal={Romanian Journal of Information Science and Technology},
year={2001},
volume={4},
number={1-2},
pages={155--170},
abstract={Monoidals are computationally universal formalisms where a great quantity
of other formalisms can be easily represented. Many symbolic systems from
different areas are expressed as monoidals. The possibility is outlined
that these systems express localization aspects typical of membrane systems
and other phenomena such as temporality and multiplicity that are essential
in the formalization of molecule manipulation systems.}
}
@article{Manca:JALC:On_the_Power_of:01,
author={Vincenzo Manca and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={On the Power of {P} systems with Replicated Rewriting},
journal={Journal of Automata, Languages and Combinatorics},
year={2001},
volume={6},
number={3},
pages={359--374}
}
@article{Atanas:FUND_INFORM:Recursive_Calcu:02,
author={Adrian Atanasiu and Carlos Mart{\'i}n-Vide},
title={Recursive Calculus with Membranes},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={45--59},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={P systems are computing models where certain objects evolve in parallel
in a hierarchical membrane structure. Recent results show that this model
is a promising framework for solving NP-complete problems in polynomial
time. A variant of P systems with active membranes is proposed in this
paper. It uses a new operation called 'subordonation', based on the process
of 'endocytosis' of membranes: a membrane can be entirely absorbed by another
membrane, preserving its content. This class of P systems with active membranes
can compute all Turing computable mappings. Arithmetical operations defined
in [1] can be obtained as particular cases of primitive recursive functions,
but with a higher complexity degree.}
}
@article{PerezJ:FUND_INFORM:Simulating_Turi:02,
author={Alvaro Romero-Jim{\'e}nez and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Simulating {T}uring Machines by {P} systems with External Output},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={273--278},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={In [3] a variant of the computation model introduced by Gh. P!un in [1]
is considered: membrane systems with external output, which were proven
to be universal, in the sense that they are able to generate all Parikh
images of recursively enumerable languages. Here we give another proof
of the universality of this model. The proof is carried out associating
to each deterministic Turing machine a P system with external output that
simulates its running. Thus, although we work with symbol-objects, we get
strings as a result of computations, and in this way we generate directly
all recursively enumerable languages, instead of their images through Parikh
mapping, as it is done in [3].},
keywords={Natural computing, Membrane computing, Turing machines}
}
@article{Paun:NEW_GENERAT_COMPUT:The_Power_of_Co:02,
author={Andrei P{\u a}un and Gheorghe P{\u a}un},
title={The Power of Communication: {P} systems with Symport/Antiport},
journal={New Generation Computing},
year={2002},
month={May},
volume={20},
number={3},
pages={295--305},
abstract={In the attempt to have a framework where the computation is done by communication
only, we consider the biological phenomenon of trans-membrane transport
of couples of chemicals (one say symport when two chemicals pass together
through a membrane, in the same direction, and antiport when two chemicals
pass simultaneously through a membrane, in opposite directions). Surprisingly
enough, membrane systems without changing (evolving) the used objects and
with the communication based on rules of this type are computationally
complete, and this result is achieved even for pairs of communicated objects
(as encountered in biology). Five membranes are used; the number of membranes
is reduced to two if more than two chemicals may collaborate when passing
through membranes.},
keywords={antiport, computational universality, membrane computing, molecular computing,
symport}
}
@article{Paun:IJFCS:Comput_by_comm:2002,
author={Andrei P{\u a}un and Gheorghe P{\u a}un and Grzegorz Rozenberg},
title={Computing by Communication in networks of Membranes},
journal={International Journal of Foundations of Computer Science},
year={2002},
month={December},
volume={13},
number={6},
pages={779--798},
abstract={In this paper we consider networks of membranes which compute by communication
only, using symport/antiport rules. Such rules are used both for communication
with the environment and for direct communication among membranes. It turns
out that, rather surprisingly, networks with a small number of membranes
are computationally universal. This is proved both for the case of three
membranes where each membrane communicates with each other membrane, and
for the case of four membranes consisting of two pairs such that only the
membranes within each pair communicate directly. A single pair of communicating
membranes can compute the Parikh images of matrix languages. Several open
problems are also formulated.}
}
@article{Martin:J_UNIVERS_COMPUT_SCI:On_the_power_of:02,
author={Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un},
title={On the power of {P} systems with symport rules},
journal={Journal of Universal Computer Science},
year={2002},
volume={8},
number={2},
pages={317--331},
abstract={A purely communicative variant of P systems was considered recently, based
on the trans-membrane transport of couples of chemicals. When using both
symport rules (the chemicals pass together in the same direction) and antiport
rules (one chemical enters and the other exits a membrane), one obtains
the computational completeness, and the question was formulated what happens
when only symport rules are considered. We address here this question.
First, we surprisingly find that 'generalized' symport rules are sufficient:
if more than two chemicals pass together through membranes, then we get
again the power of Turing machines. Three results of this type are obtained,
with a trade-off between the number of chemicals which move together (at
least three in the best case) and the number of membranes used. The same
result is obtained for standard symport rules (couples of chemicals), if
the passing through membranes is conditioned by some permitting contexts
(certain chemicals should be present in the membrane). In this case, four
membranes suffice. The study of other variants of P systems with symport
rules (for instance, with forbidding contexts) is formulated as an open
problem.}
}
@article{Martin:BEATCS:Membrane_Comput:02,
author={Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un},
title={Membrane Computing: New Results, New Problems},
journal={Bulletin of the EATCS},
year={2002},
month={October},
number={78},
pages={204--212}
}
@article{Martin:FUND_INFORM:Membrane_system:02,
author={Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un and Grzegorz
Rozenberg},
title={Membrane systems with coupled transport: Universality and normal forms},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={1--15},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={This paper continues research on membrane systems which function by communication
only, meaning that there are no evolving rules for molecules. The whole
computation process relies on passage of molecules through membranes --
this provides communication between regions of the membrane system. Next
to transport of single molecules through membranes (uniport) we also study
a coupled transport of molecules, with two molecules passing either in
the same direction (symport) or in opposite directions (antiport). We study
the computational power of such membrane systems and prove that using only
symport one gets Turing universality. Moreover, we prove that five membranes
suffice to get Turing universality, and the number of membranes can be
decreased to three if forbidding context conditions for transport are used.}
}
@article{Martin:THEOR_COMPUT_SCI:Membrane_System:02,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Grzegorz Rozenberg},
title={Membrane Systems with Carriers},
journal={Theoretical Computer Science},
year={2002},
month={January},
volume={270},
number={1-2},
pages={779--796},
abstract={A membrane system is a model of computation which is inspired by some basic
features of biological membranes. In this paper we consider another biologically
inspired notion, viz., the notion of a carrier (or vehicle), as, e.g.,
used in gene cloning. We investigate the power of membrane systems where
the rules for the evolving of objects are replaced by the rules that carry
objects (by vehicles) through membranes. It turns out that these systems
(even with a small number of membranes, a small number of carriers, and
a small number of passengers taken by carriers) are computationally universal.},
keywords={P systems, Turing computability, membrane computing, molecular computing,
natural computing}
}
@article{Martin:CyS:On_the_Power_of:02,
author={Carlos Mart{\'i}n-Vide and Victor Mitrana and Gheorghe P{\u a}un},
title={On the Power of {P} systems with Valuations},
journal={Computaci{\'o}n y Sistemas},
year={2002},
volume={5},
number={2},
pages={120--127}
}
@article{NicolauJr:FUND_INFORM:C_Library:02,
author={Dan V. {Nicolau Jr.} and Gerardin Solana and Florin Fulga and Dan V. Nicolau},
title={A {C} Library for Simulating {P} Systems},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={241--248},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={The present paper describes an ANSI C library which has been developed to
facilitate the implementation and simulation of P systems on a computer.
Simple data structures are proposed which permit the representation of
membranes and their associated objects, and facilities are provided for
implementing both 'active' and 'non-active' membrane systems, including
actions for dissolving a membrane, dividing an existing membrane and creating
a new membrane.},
keywords={P systems, Software, Membranes, Simulation}
}
@article{Arroyo:J_UNIVERS_COMPUT_SCI:Membrane_Comput:02,
author={Fernando Arroyo and Angel Baranda and Juan Castellanos and Gheorghe P{\u a}un},
title={Membrane Computing: The Power of (Rule) Creation},
journal={Journal of Universal Computer Science},
year={2002},
volume={8},
number={3},
pages={369--381},
abstract={We consider a uniform way of treating objects and rules in P systems: we
start with multisets of rules, which are consumed when they are applied,
but the application of a rule may also produce rules, to be applied at
subsequent steps. We find that this natural and simple feature is surprisingly
powerful: systems with only one membrane can characterize the recursively
enumerable languages, both in the case of rewriting and of splicing rules;
the same result is obtained in the case of symbol?objects, for the recursively
enumerable sets of vectors of natural numbers.}
}
@article{Ciobanu:FUND_INFORM:Gene_Expression:02,
author={Gabriel Ciobanu and Bogdan Tanasa},
title={Gene Expression by Software Mechanisms},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={67--80},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={This paper describes the molecular interactions and coordination of cell
processes using computer operating system concepts related to synchronization
and communication. We argue that in molecular biology, the genes and their
chromatin context provide communication and interaction with various cell
processes in a similar way to that in which computer processes synchronize
and communicate with each other.},
keywords={Cell biology, operating systems, process communication, pipe, signals, modules}
}
@article{Ciobanu:FUND_INFORM:Membrane_Softwa:02,
author={Gabriel Ciobanu and Dorin Paraschiv},
title={{P} System Software Simulator},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={61--66},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={We present a software application that is intended to be a tool for people
working with P~systems. This software tool is called the Membrane Simulator
and it provides a graphical simulation for two variants of P systems: the
initial version of the catalytic hierarchical cell system and the active
membrane system.}
}
@article{Paun:THEOR_COMPUT_SCI:A_Guide_to_Memb:02,
author={Gheorghe P{\u a}un and Grzegorz Rozenberg},
title={A Guide to Membrane Computing},
journal={Theoretical Computer Science},
year={2002},
month={September},
volume={287},
number={1},
pages={73--100},
abstract={Membrane systems are models of computation which are inspired by some basic
features of biological membranes. In a membrane system multisets of objects
are placed in the compartments defined by the membrane structure, and the
objects evolve by means of 'reaction rules' also associated with the compartments,
and applied in a maximally parallel, nondeterministic manner. The objects
can pass through membranes, the membranes can change their permeability,
they can dissolve, and they can divide. These features are used in defining
transitions between configurations of the system, and sequences of transitions
are used to define computations. In the case of symbol-objects, we compute
a set of numbers, and in the case of string-objects we compute a set of
strings, hence a language. Many different classes of such computing devices
(now called P systems) have already been investigated. Most of them are
computationally universal, i.e., equal in power to Turing machines. Systems
with an enhanced parallelism are able to trade space for time and solve
in this way (at least in principle), by making use of an exponential space,
intractable problems in a feasible time. The present paper presents the
basic ideas of computing with membranes and some fundamental properties
(mostly concerning the computational power and efficiency) of P systems
of various types.},
keywords={Chomsky hierarchy, NP-complete problems, membrane computing, natural computing,
turing computability}
}
@article{Ardele:FUND_INFORM:The_relevance_o:02,
author={Ioan I. Ardelean},
title={The Relevance of Cell Membranes for {P} systems. {G}eneral Aspects},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={35--43},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={This paper presents the stucture, organization (hierarchy) and function
of cell membrane in bacteria, with special emphasis on: i) the hierarchy
of cell membranes in Gram-negative and Gram-positive bacteria, ii) two
main criteria for the classification of transport of ions and molecules
across cell membrane, iii) two important mechanisms of transport - symport
and antiport, and iv) the relevance of these biological realities for working
concepts in P systems such as membrane hierarchy and developmental rules.
The biological reality not only illustrates some central concepts in P
systems but also could give some suggestions for the theoretical development
of P systems and their possible implementation.}
}
@article{Giavitto:FUND_INFORM:The_topological:02,
author={Jean Louis Giavitto and Olivier Michel},
title={The Topological Structures of Membrane Computing},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={123--145},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={In its initial presentation, the P system formalism describes the topology
of the membranes as a set of nested regions. In this paper, we present
an algebraic structure developped in combinatorial topology that can be
used to describe finer adjacency relationships between membranes. Using
an appropriate abstract setting, this technical device enables us to reformulate
also the computation within a membrane and proposes a unified view on several
computational mechanisms initially inspired by biological processes. These
theoretical tools are instantiated in MGS, an experimental programming
language handling various types of membrane structures in a homogeneous
and uniform syntax.},
keywords={membrane computing, Gamma, CHAM, P system, L system, cellular automata,
group based fields, rewriting, topological collection, declarative programming
language}
}
@article{Aguado:FUND_INFORM:P_Systems_with_:02,
author = {Joaquin Aguado and Tudor Balanescu and Tony Cowling and Marian Gheorghe
and Mike Holcombe and Florentin Ipate},
title = {{P} systems with Replicated Rewriting and Stream {X-Machines} ({Eilenberg},
machines)},
journal = {Fundamenta Informaticae},
year = {2002},
month = {January},
volume = {49},
number = {1-3},
pages = {17--33},
note = {Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract = {The aim of this paper is to show how the P systems with replicated rewriting
can be modeled by X-machines (also called Eilenberg machines). In the first
approach, the parallel behaviour of the regions of a P system is simulated
by a sequential process involving a single X-machine. This allows the application
of the X-machine testing procedures in order to prove the correctness of
P systems. In the second approach, a P system is simulated by a communicating
system of X-machines. Each component of such a system is an X-machine associated
with a region of the given P system. The components act in parallel, as
their counterparts do in a P system, and use some specific mechanism for
communication and synchronisation.},
keywords = {P Systems, Finite state machines, (Stream) X-machines, Formal specifications},
}
@article{Mate:FUND_INFORM:On_the_power_of:02,
author={Jos{\'e} L. Mat{\'e} and Alfonso Rodr{\'i}guez-Pat{\'o}n and Andr{\'e}s Silva},
title={On the power of {P} systems with {DNA-worm-objects}},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={229--239},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={We introduce a variant of P systems with string-objects - called worm-objects
- inspired in the DNA computing area. These systems work with multisets
of string-objects processed by splitting, mutation, replication and recombination.
This model is simpler (we eliminate the replication operation) and more
realistic (the recombination operation is changed by the simpler one of
suffix-prefix or head-tail concatenation developed in the DNA computing
framework) than the previous one. The result of a computation is the set
of strings sent out of the system. We work with multisets of strings but
we generate languages instead of sets of numbers. We prove that, without
priority among rules or other control mechanisms, (1) these P systems with
at most three membranes can generate all recursively enumerable languages,
(2) with non-decreasing length mutation and splitting rules, three membranes
are enough to generate the family of context-sensitive languages, and (3)
with these restricted types of splitting and mutation rules, four membranes
can generate the family of recursively enumerable languages.},
keywords={Membrane computing, P systems, Recursively enumerable languages}
}
@article{Madhu_:FUND_INFORM:Contextual_P_Sy:02,
author={Kamala Krithivasan and Mutyam Madhu},
title={Contextual {P} systems},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={179--189},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={Generally, in P systems with string-objects one uses the Chomsky way of
rewriting for processing the objects. In this paper we consider the contextual
way of handling string-objects in P systems. We introduce some variants
of contextual grammars and prove that contextual P systems with rules corresponding
to these variants are more powerful than ordinary contextual grammars and
their variants. We also show that one-sided contextual P systems with right-sided
erased contexts and insertion contextual P systems with right-sided erased
contexts are computationally complete.},
keywords={P systems, contextual grammars, insertion grammars, contextual P systems,
recursively enumerable languages, Kuroda normal form, Pentonnen normal
form, computational completeness}
}
@article{Kudlek:FUND_INFORM:Closure_Propert:02,
author={Manfred Kudlek and Victor Mitrana},
title={Closure Properties of Multiset Language Families},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={191--203},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={Multiset languages are languages defined by multiset grammars in the sense
of [4]. We extend to multiset languages the usual operations defined for
string languages and define new operations specific for multiset languages.
The closure properties of the main classes of multiset languages are investigated.
Along these lines we introduce two notions of abstract family of multiset
languages.},
keywords={Multisets, Closure Properties}
}
@article{PerezJ:ROMJIST:Verifying_a_P:02,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Verifying a {P} system generating squares},
journal={Romanian Journal of Information Science and Technology},
year={2002},
volume={5},
number={2-3}
}
@article{PerezJ:FUND_INFORM:A_formalization:02,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={A Formalization of Transition {P} systems},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={261--271},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={In this paper we give a complete formalization of a new computability model
of a distributed parallel type which is inspired by some basic features
of living cells: transition P systems as they were given in [3], addressed
with completely different techniques than in [1] and [2]. For this, we
present a formal syntax and semantic of the transition P systems capturing
the synchronized work of P systems, and the nondeterministic and maximally
parallel manner in which the rules of these systems can be applied.},
keywords={Natural computing, P system, Formal verification}
}
@article{Madhu:Grammars:A_Note_on_Hybri:02,
author={Mutyam Madhu and Kamala Krithivasan},
title={A Note on Hybrid {P} systems},
journal={Grammars},
year={2002},
month={December},
volume={5},
number={3},
pages={239--244},
abstract={Generally, in rewriting P systems (Martin-Vide and Paun, 2000) one uses
Chomsky rules (Hopcroft and Ullman, 1979), whereas in contextual P systems
(Madhu and Krithivasan, 2002) we considered contextual rules (Marcus, 1969),
(Paun, 1997) for processing string-objects. By combining Chomsky rules
and contextual rules, a new class of P systems were introduced in Krishna
et al. (2001), the hybrid P systems. In this paper we continue the study
of hybrid P systems, and show that systems with two membranes are universal
in the case of contextual rules with a regular choice, and systems with
four membranes are universal in the case of contextual rules with finite
selection.}
}
@article{Madhu_:ACTA_INFORM:Generalized_Nor:02,
author={Mutyam Madhu and Kamala Krithivasan},
title={Generalized Normal Forms for Rewriting {P} systems},
journal={Acta Informatica},
year={2002},
month={September},
volume={38},
number={10},
pages={721--734},
abstract={P systems, introduced by Gh. Paun [9] as a new theoretical model for molecular
computations, are based on the notion of membrane structure. Several variants
of P systems have been proposed and shown to be computationally universal.
One of such variant is the rewriting P systems, where we consider string-objects
and process them using rewriting rules. Particular cases of normal forms
for rewriting P systems were proposed in [11-13]. In this work we introduce
the generalized normal form for rewriting P systems which take into consideration
the depth of the membrane structure and the number of rewriting rules present
in each membrane. Such generalized normal forms are given for rewriting
P systems with priorities, and for partially parallel rewriting P systems.
In this way, several results from the literature are generalized and improved.}
}
@article{Madhu_:BEATCS:Improved_Result:02,
author={Mutyam Madhu and Kamala Krithivasan},
title={Improved Results about Universality of {P} systems},
journal={Bulletin of the EATCS},
year={2002},
month={February},
number={76},
pages={162--168}
}
@article{Bottoni:ACTA_INFORM:Promoters_Inhibitors:2002,
author={Paolo Bottoni and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Grzegorz
Rozenberg},
title={Membrane systems with promoters/inhibitors},
journal={Acta Informatica},
year={2002},
month={September},
volume={38},
number={10},
pages={695--720},
abstract={Abstract. The computational model of membrane computing (formalized through
membrane systems, also called P systems) is based on the way that biological
membranes define compartments, each having its set of molecules and (enzymes
enhancing) reactions, with compartments communicating through the transport
of molecules through membranes. In this paper we augment the basic model
of membrane systems with promoters and inhibitors, which formalize the
reaction enhancing and reaction prohibiting roles of various substances
(molecules) present in cells. We formalize such membrane systems with promoters/inhibitors
and investigate their basic properties. In particular we establish universality
results, i.e., we provide characterizations of recursively enumerable sets
(of vectors of natural numbers) using these systems. It turns out that
systems with promoters/inhibitors achieve universal computations without
using the standard 'auxiliary' features of membrane systems, for instance,
without using catalysts.}
}
@article{Frisco:FUND_INFORM:A_Direct_Constr:02,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom and Paul Sant},
title={A Direct Construction of a Universal {P} system},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={103--122},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={We present a direct universal P system based on splicing. Our approach differs
from those shown in previous papers as the P system we construct takes
as input an encoding of another P system. Previous results were based on
the simulation of universal type-0 grammars or Turing machines. We think
that the approach we use can be applied to other variants of P systems.},
keywords={DNA computing, P systems, Splicing, Direct universal system}
}
@article{Freund:BEATCS:A_Short_Note_on:02,
author={Rudolf Freund and Marion Oswald},
title={A Short Note on Analysing {P} systems with Antiport Rules},
journal={Bulletin of the EATCS},
year={2002},
month={October},
number={78},
pages={231--236}
}
@article{Freund:FUND_INFORM:GP_systems_with:02,
author={Rudolf Freund and Marion Oswald},
title={{GP Systems} with forbidding context},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={81--102},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={We consider extended variants of GP systems, i.e., membrane systems with
sequential applications of evolution rules. The main features we explore
are applicability conditions (context conditions) on single objects as
well as on the remaining contents of the underlying compartment. For a
special very restricted variant only using forbidding context conditions
we already obtain universal computational power.}
}
@article{Marcus:FUND_INFORM:Membranes_versu:02,
author={Salomon Marcus},
title={Membranes versus {DNA}},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={223--227},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={Based on some recent arguments brought into attention by some important
authors, we point out the insufficiency of DNA in explaining life and the
importance of membranes in bridging this gap. We also discuss the delicate,
still open problem concerning the mathematical status of membrane.}
}
@article{Krishna:FUND_INFORM:On_the_Power_of:02,
author={Shankara Narayanan Krishna and K. Lakshmanan and Raghavan Rama},
title={On the Power of {P} systems with Contextual Rules},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={167--178},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={We consider P Systems with string objects which evolve by means of one-sided
contextual rules and erasing contextual rules. The generative power of
these systems with three or less than three membranes is investigated.
We show that systems with three membranes characterize the family of recursively
enumerable languages. When the string replication is used in one-sided
contextual rules, these systems are able of solving NP-complete problems
in linear time: this is exemplified with SAT and HPP.},
keywords={P Systems, One-sided contextual rules, Erasing contextual rules, Recursively
enumerable, NP-completeness}
}
@article{Ji:FUND_INFORM:The_Bhopalator::02,
author={Sungchul Ji},
title={The {Bhopalator}: An Information/Energy Dual Model of the Living Cell},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={147--165},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={A molecular model of the living cell known as the Bhopalator is described
with the hope of aiding mathematicians and computer scientists to develop
comprehensive algebraic models of the cell. The Bhopalator is energy/information
dual in the sense that it can be described using two complementary languages
- the energy/matter based language of physics and chemistry and the information/sign
based language of linguistics and mathematics. The availability of mathematical
models of the cell may eventually lead to developing computer models of
the living cell, resulting in important applications not only in biology
and medicine but also in computer science and computer industry. To stimulate
discussions among mathematicians and computer scientists, the algebraic
encoding of the essential characteristics of the Bhopalator may be referred
to as the C system (C indicating the cell), in analogy to the well-known
H and P systems.}
}
@article{Nishida:FUND_INFORM:Simulations_of_:02,
author={Taishin Yasunobu Nishida},
title={Simulations of Photosynthesis by a {K-Subset} Transforming System with Membranes},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={249--259},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={By considering the inner regions of living cells' membranes, P systems with
inner regions are introduced. Then, a new type of membrane computing systems
are considered, called $K$-subset transforming systems with membranes,
which can treat nonintegral multiplicities of objects. As an application,
a K-subset transforming system is proposed in order to model the light
reactions of the photosynthesis. The behaviour of such systems is simulated
on a computer.},
keywords={P System, nonintegral multiplicity, K-subset, photosynthesis}
}
@article{Manca:FUND_INFORM:DNA_and_membran:02,
author={Vincenzo Manca},
title={{DNA} and membrane algorithms for {SAT}},
journal={Fundamenta Informaticae},
year={2002},
month={January},
volume={49},
number={1-3},
pages={205--221},
note={Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos
Mart{\'i}n-Vide, Gheorghe P{\u a}un},
abstract={Some DNA algorithms proposed in the literature for propositional satisfiability
(SAT) are analyzed. In the class of 'extract model' the two sub-classes
of 'literal string' and 'clause string' algorithms are compared and a new
formulation of these algorithms is given in terms of membrane systems.
Then, the duality between literal string and clause string formulation
of SAT is expressed by means of 'singleton matrices' that introduce another
membrane algorithm for SAT. The analysis developed suggests the perspective
of membrane systems as problem-solving agents based on molecule localization,
transformation, and propagation.},
keywords={Satisfiability, DNA Computing, Membrane Systems, Molecular Computing, Unconventional
Computing Models}
}
@article{Obtulowicz:NC:Math_Models_Uncertainty:2003,
author={Adam Obtulowicz},
title={Mathematical Models of Uncertainty with a Regard to Membrane Systems},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={251--263},
abstract={A brief review is presented of the known mathematical models of uncertainty
taking into account its grounds such as randomness, indiscernibility, and
vagueness. Then, one discusses the models of the uncertainty caused by
indiscernibility and random indiscernibility with a regard to membrane
systems. The discussed models include rough sets, probabilistic rough sets,
and probabilistic fuzzy sets. An algebraic characterization of P systems
is presented, which makes possible to 'transfer' the methods of Petri net
theory to P system theory including the approach of the first theory to
models of uncertainty.},
keywords={Petri nets, fuzzy sets, membrane computing, probability, rough sets}
}
@article{Obtulo:BioSystems:(In_search_of)_:03,
author={Adam Obtulowicz and Gheorghe P{\u a}un},
title={({I}n search of) {P}robabilistic {P} systems},
journal={BioSystems},
year={2003},
month={July},
volume={70},
number={2},
pages={107--121},
abstract={The aim of this paper is to (preliminarily) discuss various ways of introducing
probabilities in membrane systems. We briefly present both ideas already
circulated in the literature and new proposals, trying to have a systematic
overview of possibilities of associating probabilities with the ingredients
of a membrane system: with (localization of) single objects, with multiplicities
of objects (hence with the multisets), with the rules (depending or not
on the previous applied rule), with the communication targets. For a certain
mode of using the probabilities associated with the evolution rules (in
string-object P systems) we obtain the computational universality.}
}
@article{Alhazov.etal:PSPACE:FI2003,
author = {Artiom Alhazov and Carlos Mart{\'i}n-Vide and Linqiang Pan},
title = {Solving a {PSPACE}-Complete Problem by
Recognizing {P} Systems with Restricted Active Membranes},
journal = {Fundamenta Informaticae},
year = {2003},
volume = {58},
number = {2},
pages = {67--77},
abstract = {P systems are parallel molecular computing models
based on processing multisets of objects in cell-like
membrane structures. Recently, Petr Sos{\'i}k has shown
that a semi-uniform family of P systems with active membranes
and 2-division is able to solve the PSPACE-complete problem
QBF-SAT in linear time; he has also conjectured that
the membrane dissolving rules of the (d) type may be omitted
but probably not the (f) type rules for non-elementary
membrane division. In this paper, we partially confirm
the conjecture proving that dissolving rules are not necessary.
Moreover, the construction is now uniform. It still remains open
whether or not non-elementary membrane division is needed.},
keywords = {Membrane computing, P system, PSPACE-complete problem, QBF-SAT problem},
url = {http://iospress.metapress.com/content/99n72anvn6bkl4mm/},
}
@article{Martin:TCS:Tissue_P_Systems:2003,
author={Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and Juan Pazos and Alfonso Rodr{\'i}guez-Pat{\'o}n},
title={Tissue {P} systems},
journal={Theoretical Computer Science},
year={2003},
month={March},
volume={296},
number={2},
pages={295--326},
abstract={Starting from the way the inter-cellular communication takes place by means
of protein channels (and also from the standard knowledge about neuron
functioning), we propose a computing model called a tissue P system, which
processes symbols in a multiset rewriting sense, in a net of cells. Each
cell has a finite state memory, processes multisets of symbol-impulses,
and can send impulses ('excitations') to the neighboring cells. Such cell
nets are shown to be rather powerful: they can simulate a Turing machine
even when using a small number of cells, each of them having a small number
of states. Moreover, in the case when each cell works in the maximal manner
and it can excite all the cells to which it can send impulses, then one
can easily solve the Hamiltonian Path Problem in linear time. A new characterization
of the Parikh images of ETOL languages is also obtained in this framework.
Besides such basic results, the paper provides a series of suggestions
for further research.},
keywords={Chomsky hierarchy, Lindenmayer hierarchy, NP-complete problems, P systems,
membrane computing, natural computing}
}
@article{Ferretti:TCS:On_Tree_Variants_of_rew_P_Sys:2003,
author={Claudio Ferretti and Giancarlo Mauri and Gheorghe P{\u a}un and Claudio
Zandron},
title={On three variants of rewriting {P} systems},
journal={Theoretical Computer Science},
year={2003},
month={May},
volume={301},
number={1-3},
pages={201--215},
abstract={We continue here the study of P systems with string objects processed by
rewriting rules, by investigating some questions which are classic in formal
language theory: leftmost derivation, conditional use of rules (permitting
and forbidding conditions), relationships with language families in Chomsky
and Lindenmayer hierarchies.},
keywords={Chomsky hierarchy, Lindenmayer systems, membrane computing, regulated rewriting}
}
@article{Besozzi:BioSystems:P_systems_with_:03,
author = {Daniela Besozzi and Claudio Ferretti and Giancarlo Mauri and Claudio Zandron},
title = {{P} Systems with deadlock},
journal = {BioSystems},
year = {2003},
month = {July},
volume = {70},
number = {2},
pages = {95--105},
abstract = {Rewriting P systems with parallel application of evolution rules, as defined
in Besozzi et al. [Parallel rewriting P systems with deadlock. In: M. Hagiya and
A. Ohuchi (Eds.), Pre-Proceedings of DNA8 Conference, Hokkaido University
Japan, June 2002a, pp. 171--183], are considered here. Different kinds of
parallelism methods are defined for string rewriting. The notion of deadlock
is then introduced to describe situations where rules with mixed target
indications are simultaneously applied to a common string. The generative
power of parallel P systems with deadlock is analyzed, with respect to
Lindenmayer systems, and some relations among different types of parallel
P systems with or without deadlock, allowing to rewrite all occurrences
of a single symbol, or all the symbols applying either any of the rules
or only those belonging to a specific set (table) of rules are studied.
Some open problems are also formulated.},
}
@article{Besozzi:TCS:Gemmating_P_Systems:2003,
author={Daniela Besozzi and Giancarlo Mauri and Gheorghe P{\u a}un and Claudio Zandron},
title={Gemmating {P} systems: collapsing hierarchies},
journal={Theoretical Computer Science},
year={2003},
month={March},
volume={296},
number={2},
pages={253--267},
abstract={We continue the analysis of P systems with gemmation of mobile membranes.
We solve an open problem from Besozzi et al. (Proc. Italian Conf. on Theoretical
Computer Science 2001, Lecture Notes in Computer Science, Vol. 2202, Springer,
Berlin, 2001, pp. 136-153), showing that the hierarchy on the number of
membranes collapses: systems with eight membranes characterize the recursively
enumerable languages (seven membranes are enough in the case of extended
systems). We also prove that P systems, which use only gemmation, but neither
classical rewriting rules nor in/out communications, can generate the same
family of languages. In this case, the hierarchy on the number of membranes
collapses to level nine.},
keywords={matrix grammar, membrane computing, recursively enumerable languages, universality}
}
@article{Csuhaj:NC:From_Watson_Crick_L_Systems_to:2003,
author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un and
Arto Salomaa},
title={From {W}atson-{C}rick {L} {Systems} to {Darwinian} {P} systems},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={299--318},
abstract={Watson-Crick L systems are language generating devices making use of Watson-Crick
complementarity, a fundamental concept of DNA computing. These devices
are Lindenmayer systems enriched with a trigger for complementarity transition:
if a 'bad' string is obtained, then the derivation continues with its complement
which is always a 'good' string. Membrane systems or P systems are distributed
parallel computing models which were abstracted from the structure and
the way of functioning of living cells. In this paper, we first interpret
the results known about the computational completeness of Watson-Crick
E0L systems in terms of membrane systems, then we introduce a related way
of controlling the evolution in P systems, by using the triggers not in
the operational manner (i.e., turning to the complement in a 'bad' configuration),
but in a 'Darwinian' sense: if a 'bad' configuration is reached, then the
system 'dies', that is, no result is obtained. The triggers (actually,
the checkers) are given as finite state multiset automata. We investigate
the computational power of these P systems. Their computational completeness
is proved, even for systems with non-cooperative rules, working in the
non-synchronized way, and controlled by only two finite state checkers;
if the systems work in the synchronized mode, then one checker for each
system suffices to obtain the computational completeness.},
keywords={L system, P system, Watson-Crick complementarity, membrane computing, recursively
enumerable language}
}
@article{Bernardini:NC:PXSystems:2003,
author={Francesco Bernardini and Marian Gheorghe and Mike Holcombe},
title={{PX systems} = {P} systems + {X} machines},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={201--213},
abstract={The paper is a survey of the main features of P systems, X machines and
of a new computational device called PX system. The sequential and the
parallel PX systems are presented. Results reflecting the computational
power of these models and their effectiveness in solving NP-complete problems
are briefly mentioned.},
keywords={P systems, Turing computability, X machines, molecular computing}
}
@article{Bernardini:BioSystems:Dynamical_aspec:03,
author={Francesco Bernardini and Vincenzo Manca},
title={Dynamical aspects of {P} systems},
journal={BioSystems},
year={2003},
month={July},
volume={70},
number={2},
pages={85--93},
abstract={A dynamical analysis of P systems is given that is focused on basic phenomena
of biological relevance. After a short presentation of a new kind of P
systems (PB systems), membrane systems with environment, called PBE systems,
are introduced that are more suitable for modeling complex membrane interactions.
Some types of periodicity and non-periodicity are considered for PBE systems
by showing some 'minimal' examples of systems that exhibit these properties.
In particular, a discrete formulation of the Belousov�Zhabotinsky (BZ)
reaction is given in terms of PBE systems. Some questions and open problems
for future research are indicated.}
}
@article{Ciobanu:BioSys:Distributed_algorithms:2003,
author={Gabriel Ciobanu},
title={Distributed algorithms over communicating membrane systems},
journal={BioSystems},
year={2003},
month={July},
volume={70},
number={2},
pages={123--133},
abstract={This paper presents fundamental distributed algorithms over membrane systems
with antiport carriers. We describe distributed algorithms for collecting
and dispersing information, leader election in these systems, and the mutual
exclusion problem. Finally, we consider membrane systems producing correct
results despite some failures at some of the components or the communication
links. We show that membrane systems with antiport carriers provide an
appropriate model for distributed computing, particularly for message-passing
algorithms interpreted here as membrane transport in both directions, namely
when two chemicals behave as input and output messages and pass the membranes
in both directions using antiport carriers.},
keywords={Membrane systems; Antiport carriers; Distributed and parallel computing;
Broadcast; Convergecast; Flooding; Leader election; Mutual exclusion; Fault
tolerance; Consensus}
}
@article{Paun:Theoria:Recent_computing_models:2003,
author={Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Recent computing models inspired from Biology: {DNA} and membrane computing},
journal={Theoria},
year={2003},
volume={18},
number={46},
pages={71--84},
abstract={We briefly present two areas of natural computing, vividly investigated
in the recent years: DNA computing and membrane computing. Both of them
have the roots in cellular biology and are rather developed at the theoretical
level (new concepts, models, paradigms of computer science, with mathematical
and epistemological significance have been considered in this framework),
but both areas are still looking for implementations of a practical interest.},
keywords={Computer Science, Mathematics, Turing computability, Biochemistry, DNA computing,
Membrane Computing.}
}
@article{Ardelean:NC:Modelling_Bio_Process:2003,
author={Ioan I. Ardelean and Matteo Cavaliere},
title={Modelling biological processes by using a probabilistic {P} system software},
journal={Natural Computing},
year={2003},
month={July},
volume={2},
number={2},
pages={173--197},
abstract={In this paper we present a probabilistic P system simulator that implements
the evolution-communication model proposed in (Cavaliere, 2003) enriched
with some probabilistic parameters inspired by the cell biology. After
describing the software and its working, we compare the mathematical model
used with the biological reality of the cell. Then, we present some mathematical
and biological applications showing how one can use this software to simulate
simple but interesting biological phenomena, related to respiration and
photosynthesis processes in some bacteria.},
keywords={bacteria, membrane computing, photosynthesis, probability, respiration,
software}
}
@article{Krithivasan:BEATCS:minimising_finite_state:2003,
author={Kamala Krithivasan and Sandeep V. Varma},
title={On minimising finite state {P} automata},
journal={Bulletin of the EATCS},
year={2003},
month={July},
volume={80},
pages={168--173}
}
@article{PerezJ:NC:Complexity_Classes:2003,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Complexity classes in models of cellular computing with membranes},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={265--285},
abstract={In this paper we introduce four complexity classes for cellular computing
systems with membranes: the first and the second ones contain all decision
problems solvable in polynomial time by a family of deterministic P systems,
without and with an input membrane, respectively; the third and fourth
classes contain all decision problems solvable in polynomial time by a
family of non-deterministic P systems, without and with an input membrane,
respectively. We illustrate the usefulness of these classes by solving
two NP�complete problems, namely HPP and SAT, in both variants of P systems.},
keywords={P systems, complexity classes, membrane computing}
}
@article{Cavaliere:NC:Forbidding_and_enforcing:2003,
author={Matteo Cavaliere and Nata{\u s}a Jonoska},
title={Forbidding and enforcing in membrane computing},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={215--228},
abstract={Motivated by biochemistry and the non-deterministic reactions between molecules,
the authors in (Ehrenfeucht and Rozenberg, 2003) introduced the concept
of forbidding-enforcing systems (fe-systems) that define families of languages.
Using the same concept we propose to study forbidding and enforcing within
membrane systems. Two approaches are presented; in the first case the membrane
system generates families of languages and in the second case the membrane
system generates a single language. We show that by using forbidding-enforcing
in membranes, families of languages that cannot be defined by any fe-system
can be generated. When a single language is generated, we show that SAT
can be solved in a constant time (at price of using an exponential space).
Also we show an example of a context-free language that can be generated
without any forbidders.},
keywords={DNA computing, forbidding-enforcing, languages, membrane computing}
}
@article{Ionescu:NaturalComputing:Unexpected:03,
author={Mihai Ionescu and Carlos Mart{\'i}n-Vide and Andrei P{\u a}un and Gheorghe P{\u a}un},
title={Unexpected universality results for three classes of {P} systems with symport/antiport},
journal={Natural Computing},
year={2003},
month={December},
volume={2},
number={4},
pages={337--348},
abstract={Symport and antiport are biological ways of transporting molecules through
membranes in ``collaborating'' pairs; in the case of symport the two molecules
pass in the same direction, in the case of antiport the two molecules pass
in opposite directions. Here we first survey the results about the computing
power of membrane systems (P systems) using only symport/antiport rules
(hence these systems compute by communication only), then we consider a
recently introduced, way of defining the result of a computation in a membrane
system: looking for the trace of certain objects in their movement through
membranes. Rather unexpected, in this way we get characterizations of recursively
enumerable languages by means of membrane systems with symport/antiport
which work with multisets of objects (note the qualitative difference between
the data structure used by computations � multisets: no ordering � and
the data structure of the output � strings: linear ordering). A similar
remark holds true for the case of analysing P systems, which work in an
automata-like manner: the sequence of certain distinguished objects taken
from the environment during a computation is the string recognized by the
computation. We also survey universality results from this area, with sketched
proofs. Some open problems are also formulated.},
keywords={Chomsky hierarchy, membrane computing, P system, Turing computability}
}
@article{Madhu:IJFCS:Probabilistic_R:03,
author={Mutyam Madhu},
title={Probabilistic Rewriting {P} systems},
journal={International Journal of Foundations of Computer Science},
year={2003},
month={February},
volume={14},
number={1},
pages={157--166},
abstract={In this paper we define a variant of P systems, namely, probabilistic rewriting
P systems, where the selection of rewriting rules is probabilistic. We
show that, with non-zero cut-point, probabilistic rewriting P systems with/without
priorities generate only finite languages, but with zero cut/point and
without priorities, probabilistic rewriting P systems of degree 1 characterize
the family of languages generated by matrix grammars. We also prove that
probabilistic rewriting P systems of degree 1 with zero cut-point and priorities
characterize recursively enumerable languages.}
}
@article{Madhu:IJCM:Class_P_automata:2003,
author={Mutyam Madhu and Kamala Krithivasan},
title={On a Class of {P} Automata},
journal={International Journal of Computer Mathematics},
year={2003},
month={September},
volume={80},
number={9},
pages={1111--1120},
abstract={In this paper, we propose a class of P automata in which each membrane has
a state, like in tissue P systems [5], and the computation starts at some
initial state and ends in a final state. Unlike the automaton considered
in [2], where rules are used in sequential manner, here we consider a variant
such that the rules can be applied in maximal mode (as defined in tissue
P systems). We show that P automata characterize the recursively enumerable
sets of vectors of natural numbers.},
keywords={P Systems, Tissue P Systems, One-way P Automata, Parikh Mapping, Matrix
Grammar, Recursively Enumerable Languages}
}
@article{Sabadini:ENTCS:2003,
author={N. Sabadini and R.F.C. Walters},
title={Hierarchical automata and P systems},
journal={Electronic Notes in Theoretical Computer Science},
year={2003},
number={78},
pages={1--15}
}
@article{Sosik:NC:Computational_power_cell_division:2003,
author={Petr Sos{\'i}k},
title={The computational power of cell division in {P} systems: Beating down parallel
computers?},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={287--298},
abstract={We study the computational power of cell division operations in the formal
framework of P systems, a mathematical model of cell-like membrane structure
with regulated transport of objects (molecules) through membranes. We show
that a uniform family of P systems with active membranes and 2-division
is able to solve the well-known PSPACE-complete problem QBF in linear time.
This result implies that such a family of P systems modelling cell division
is at least as powerful as so-called Second Machine Class computers. The
Second Machine Class, containing most of the fundamental parallel computer
models such as parallel RAM machines of types SIMD and MIMD, vector machines
and others, is characterized by using an exponential amount of resources
(processing units) with respect to the computing time.},
keywords={P system, Second Machine Class, membrane computing}
}
@article{Kefala:BioSystems:Simulation_and_:03,
author={Petros Kefalas and G. Eleftherakis and Mike Holcombe and Marian Gheorghe},
title={Simulation and verification of {P} systems through communicating {X}-machines},
journal={BioSystems},
year={2003},
month={July},
volume={70},
number={2},
pages={135--148},
abstract={The aim of this paper is to prove the suitability of a parallel distributed
computational model, communicating X-machines, to simulate in a natural
way a well established model of molecular computation, P systems, and to
present some further benefits of the approach allowing us to check for
some formal properties. A set of rules to transform any P system with symbol-objects
into a communicating X-machine model is presented and a variation of temporal
logic for X-machines is briefly discussed, which facilitates model checking
of desired properties of the system. Finally, the benefits resulting from
the transformation are discussed.}
}
@article{Ceterchi:NC:Array_Rewriting:2003,
author={Rodica Ceterchi and Mutyam Madhu and Gheorghe P{\u a}un and K.G. Subramanian},
title={Array-rewriting {P} systems},
journal={Natural Computing},
year={2003},
month={August},
volume={2},
number={3},
pages={229 - 249},
abstract={We consider array languages (sets of pictures consisting of symbols placed
in the lattice points of the 2D grid) and the possibility to handle them
with P systems. After proving binary normal forms for array matrix grammars
(which, even in the case when no appearance checking is used, are known
to generate the array languages of arbitrary array grammars), we prove
that the P systems with context-free rules (with three membranes and no
control on the communication or the use of rules) are computationally universal,
able to generate all computable array languages. Some open problems are
also formulated.},
keywords={P system, Turing computability, array languages, matrix grammar, membrane
computing}
}
@article{Krishna:TCS:Breaking_DES:2003,
author={Shankara Narayanan Krishna and Raghavan Rama},
title={Breaking {DES} Using {P} systems},
journal={Theoretical Computer Science},
year={2003},
month={April},
volume={299},
number={1-3},
pages={495--508},
abstract={Membrane systems, also called P systems, were introduced by Gh. Paun, as
a new class of biologically inspired distributed computing models. Several
variants of P systems were already shown to be computationally universal.
One of these variants, introduced in Gh. Paun (J. Automata Languages Combin.
6 (1) (2001) 75), is able to solve SAT in linear time. In this paper, we
show how this class of P systems (with membrane division) can theoretically
break the most widely used cryptosystem, DES. We prove that given an arbitrary
(plain-text, cipher-text) pair, one can recover the DES key in linear time
with respect to the length of the key.},
keywords={DES, P systems, membrane computing}
}
@article{Leporati:Simulating_the_Fredkin_Gate:JUCS:2004,
author={Alberto Leporati and Claudio Zandron and Giancarlo Mauri},
title={Simulating the {F}redkin {G}ate with Energy-Based {P} systems},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={600--619},
abstract={Reversibility plays a fundamental role when the possibility to perform computations
with minimal energy dissipation is considered. Many papers on reversible
computation have appeared in literature, the most famous of which is certainly
the work of Bennett on (universal) reversible Turing machines. Here we
consider the work of Fredkin and Toffoli on conservative logic, which is
a mathematical model that allows to describe computations which reflect
some properties of microdynamical laws of physics, such as reversibility
and conservation of the internal energy of the physical system used to
perform the computations. The model is based upon the Fredkin gate, a reversible
and 'conservative' (according to a definition given by Fredkin and Toffoli)
three-input/three-output boolean gate. In this paper we introduce energy
based P systems as a parallel and distributed model of computation in which
the amount of energy manipulated and/or consumed during computations is
taken into account. Moreover, we show how energy-based P systems can be
used to simulate the Fredkin gate. The proposed P systems that perform
the simulations turn out to be themselves reversible and conservative.},
keywords={Energy-based P systems, Fredkin gate, conservative logic, reversibility,
conservativeness}
}
@article{Cordon-Franco:Note_Complexity_Measures:JUCS:2004,
author={Andr{\'e}s Cord{\'o}n-Franco and Fernando Sancho-Caparrini},
title={A Note on Complexity Measures for Probabilistic {P} systems},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={559--568},
abstract={In this paper we present a first approach to the definition of different
entropy measures for probabilistic P systems in order to obtain some quantitative
parameters showing how complex the evolution of a P system is. To this
end, we define two possible measures, the first one to reflect the entropy
of the P system considered as the state space of possible computations,
and the second one to reflect the change of the P system as it evolves.},
keywords={P systems, Entropy, Natural Computing}
}
@article{CordonFranco:NGC:Prolog_simulator:2004,
author={Andr{\'e}s Cord{\'o}n-Franco and Miguel A. Guti{\'e}rrez-Naranjo and Mario J. P{\'e}rez-Jim{\'e}nez
and Fernando Sancho-Caparrini},
title={A {P}rolog Simulator for Deterministic {P} systems with Active Membranes},
journal={New Generation Computing},
year={2004},
month={August},
volume={22},
number={4},
pages={349--363},
abstract={In this paper we propose a new way to represent P systems with active membranes
based on Logic Programming techniques. This representation allows us to
express the set of rules and the configuration of the P system in each
step of the evolution as literals of an appropriate language of first order
logic. We provide a Prolog program to simulate the evolution of these P
systems and present some auxiliary tools to simulate the evolution of a
P system with active membranes using 2-division which solves the SAT problem
following the techniques presented in Reference 10).},
keywords={Logic Programming, Membrane Computing, Simulation, Prolog, SAT-problem.}
}
@article{Alhazov:IPL:SymbolSet:IPL2006,
author = {Artiom Alhazov},
title = {{P} Systems without Multiplicities of Symbol-Objects},
journal = {Information Processing Letters},
volume = {100},
number = {3},
year = {2006},
month = {November},
abstract = {In this paper we investigate P systems whose compartments
contain sets of symbol-objects rather than multisets of objects
as it is common in membrane computing. If the number of membranes
cannot grow, then in this framework we can characterize exactly
the regular languages. If membrane creation or membrane division
is allowed, then the Parikh sets of recursively enumerable languages
can be generated. The last result also implies the universality
of P systems with active membranes (with multisets of symbol-objects)
without polarizations.},
keywords = {Formal languages, Theory of computation, Distributed computing, Parallel processing, Membrane systems, Turing computability},
url = {http://dx.doi.org/10.1016/j.ipl.2005.01.017},
}
@article{Alhazov:DECP:JUCS2004,
author = {Artiom Alhazov},
title = {On Determinism of Evolution-Communication {P} systems},
journal = {Journal of Universal Computer Science},
year = {2004},
month = {May},
volume = {10},
number = {5},
pages = {502--508},
abstract = {It is commonly believed that a significant part
of the computational power of membrane systems comes from
their inherent non-determinism. Recently, R. Freund and Gh. P{\u a}un
have considered deterministic P systems, and formulated
the general question whether the computing (generative) capacity
of non-deterministic P systems is strictly larger than the (accepting)
capacity of their deterministic counterpart. In this paper, we study
the computational power of deterministic P systems in the
evolution-communication framework. It is known that
in the generative case, two membranes are enough for universality.
For the deterministic systems, we obtain the universality
with three membranes, leaving the original problem open.},
keywords = {Membrane computing, P system, Determinism, Computational completeness},
url = {http://www.jucs.org/jucs_10_5/on_determinism_of_evolution},
}
@article{Alhazov:MinECP:NGC2004,
author = {Artiom Alhazov},
title = {Minimizing Evolution-Communication {P} Systems and Automata},
journal = {New Generation Computing},
year = {2004},
month = {August},
volume = {22},
number = {4},
pages = {299--310},
abstract = {Evolution-communication P systems are a variant
of P systems allowing both rewriting rules and symport/antiport
rules, thus having separated the rewriting and the communication.
The purpose of this paper is to solve an open problem
stated in Reference 1), namely generating the family
of Turing computable sets of vectors of natural numbers
instead of the family of Turing computable sets of natural numbers.
The same construction also reduces the 3-membrane non-cooperative case
and the 2-membrane 1-catalyst case to the 2-membrane non-cooperative case.
Also, EC P automata are introduced and it is proved that 2-membrane
EC P automata with a promoter can accept all recursively enumerable languages.
Finally, a definition of an extended system is given, and its universality
is proved using the rules of more restricted types.},
keywords = {Membrane Computing, EC P Systems, EC P Automata, Turing Computability.},
url = {http://www.springerlink.com/content/b5707359hp67p8w2/},
}
@article{Alhazov.Pan:Polarizationless:Grammars2004,
author = {Artiom Alhazov and Linqiang Pan},
title = {Polarizationless {P} Systems with Active Membranes},
journal = {Grammars},
year = {2004},
volume = {7},
pages = {141--159},
abstract = {The subject of this paper is the continuation
of the studies of P systems with active membranes
without polarizations with the label-changing capacity
of some rules. Rewriting and communication rules
that do not change membrane labels can be applied
either sequentially or in a maximally parallel way.
We consider several classes of P systems and study
their generative power.
Particularly interesting, P systems with only evolution rules
used sequentially and changing labels compute exactly
the Parikh sets of matrix languages; the universality
is reached by P systems with evolution rules and communication
rules used sequentially. By direct constructions
we also prove that SAT can be solved in linear time
by systems with evolution rules changing labels
communication, and membrane division.
Several open problems are also formulated.},
eprint = {http://aartiom.50webs.com/articles/RelabN607.pdf},
url = {http://grlmc-dfilrom.urv.cat/1stschool_artiom.asp},
}
@article{Alhazov.etal:Trading_Polarizations:AI2004,
author = {Artiom Alhazov and Linqiang Pan and {\relax Gh}eorghe P{\u a}un},
title = {Trading Polarizations for Labels in {P} Systems with Active Membranes},
journal = {Acta Informatica},
year = {2004},
month = {December},
volume = {41},
number = {2-3},
pages = {111--144},
abstract = {This paper addresses the problem of removing the polarization
of membranes from P systems with active membranes - and this is achieved
by allowing the change of membrane labels by means of communication rules
or by membrane dividing rules. As consequences of these results
we obtain the universality of P systems with active membranes
which are allowed to change the labels of membranes, but do not use
polarizations. Universality results are easily obtained also by direct proofs.
By direct constructions, we also prove that SAT can be solved in linear time
by systems without polarizations and with label changing possibilities.
If non-elementary membranes can be divided, then SAT can be solved
in linear time without using polarizations and label changing.
Several open problems are also formulated.},
url = {http://dx.doi.org/10.1007/s00236-004-0153-z},
}
@article{Calude:BioSystems:Bio-steps_beyond_Turing:2004,
author={Cristian S. Calude and Gheorghe P{\u a}un},
title={Bio-steps beyond {T}uring},
journal={BioSystems},
year={2004},
month={November},
volume={77},
number={1-3},
pages={175--194},
abstract={Are there �biologically computing agents� capable to compute Turing uncomputable
functions? It is perhaps tempting to dismiss this question with a negative
answer. Quite the opposite, for the first time in the literature on molecular
computing we contend that the answer is not theoretically negative. Our
results will be formulated in the language of membrane computing (P systems).
Some mathematical results presented here are interesting in themselves.
In contrast with most speed-up methods which are based on non-determinism,
our results rest upon some universality results proved for deterministic
P systems. These results will be used for building 'accelerated P systems'.
In contrast with the case of Turing machines, acceleration is a part of
the hardware (not a quality of the environment) and it is realised either
by decreasing the size of 'reactors' or by speeding-up the communication
channels. Consequently, two acceleration postulates of biological inspiration
are introduced; each of them poses specific questions to biology. Finally,
in a more speculative part of the paper, we will deal with Turing non-computability
activity of the brain and possible forms of (extraterrestrial) intelligence.},
keywords={Turing; Bio-steps; P systems}
}
@article{Besozzi:NGC:Hierarchies_parallel:2004,
author={Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Hierarchies of Parallel Rewriting {P} Systems. A Survey},
journal={New Generation Computing},
year={2004},
month={August},
volume={22},
number={4},
pages={331--347},
abstract={The paper is about some families of rewriting P systems, where the application
of evolution rules is extended from the classical sequential rewriting
to the parallel one (as, for instance, in Lindenmayer systems). As a result,
consistency problems for the communication of strings may arise. Three
variants of parallel rewriting P systems (already present in the literature)
are considered here, together with the strategies they use to face the
communication problem, and some parallelism methods for string rewriting
are defined. We give a survey of all known results about each variant and
we state some relations among the three variants, thus establishing hierarchies
of parallel rewriting P systems. Various open problems related to the subject
are also presented.},
keywords={Membrane Computing, Parallel Rewriting, Lindenmayer System, Recursively
Enumerable Language.}
}
@article{Fontana:Finding_the_Maximum_Element:JUCS:2004,
author={Federico Fontana and Giuditta Franco},
title={Finding the Maximum Element Using {P} systems},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={567--580},
abstract={A nondeterministic, maximally parallel methodology for finding the maximum
element in a set of numerical values is presented, suitable for being implemented
on P systems. Several algorithms of maximum search are then developed for
different types of such systems, namely using priorities, nested membranes
and linked transport, and their performances are evaluated accordingly.
The proposed solutions are expected to find application inside membrane
models devoted to compute algorithmic procedures in which the greatest
element in a data set must be found. Dynamic algorithms for DNA sequence
alignment are an example of such procedures.},
keywords={Maximum value, P systems, Natural computing, Membrane computing}
}
@article{Arroyo:Simulating_Membrane_Systems:IJITA:2004,
author={Fernando Arroyo and Carmen Luengo and Luis Fernandez and Luis F. de Mingo and Juan Castellanos},
title={Simulating membrane systems in digital computers},
journal={International Journal "Information Theories \& Applications"},
year={2004},
volume={11},
number={1},
pages={29--34},
abstract={Membrane Computing started with the analogy between dome processes produced
inside the complex structure of living cells and computational processes.
In the same way that in other branches of Natural Computing, the model
is extracted from nature but it is not clear wether or not the model must
come back to nature to be implemented. As in other cases in Natural Computing:
Artificial Neural Networks, Genetic Algorithms, etc; the models have been
implemented in digital computers. Hence some papers have been published
considering inplementation of Membrane omputing in digital computers. This
paper introduces an overview in the field of simulation in Membrane Computing.}
}
@article{Bernardini:NGC:Lang_generated:2004,
author={Francesco Bernardini and Marian Gheorghe},
title={Languages Generated by {P} systems with Active Membranes},
journal={New Generation Computing},
year={2004},
month={August},
volume={22},
number={4},
pages={311--329},
abstract={We propose an alternative approach to generate languages by means of P systems:
building up an appropriate representation for a string by means of a corresponding
membrane structure and then generating the string by visiting the membrane
structure according to a well-specified strategy. To this aim, we consider
P systems with active membranes, allowing membrane creation or division
or duplication and dissolution, where the output of a computation may be
obtained either by visiting the tree associated with the membrane structure,
or by following the traces of a specific object, called traveller, or sending
out the objects. For each of these approaches, we provide characterizations
of recursively enumerable languages based on P systems that use different
sets of operations for modifying the membrane structure.},
keywords={Membrane Computing, P System, Recursively Enumerable Language.}
}
@article{Bernardini:Population_P_Systems:JUCS:2004,
author={Francesco Bernardini and Marian Gheorghe},
title={Population {P} systems},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={509--539},
abstract={This paper introduces a notion of population P systems as a class of tissue
P systems where the links between the cells can be modified by means of
a specific set of bond making rules. As well as this, cell division rules
which introduce new cells into the system, cell differentiation rules which
change the set of rules that can be used inside of a cell, and cell death
rules which remove cells from the system are also considered by introducing
a particular notion of population P systems with active cells. The paper
mainly reports universality results for the following models: (a) population
P systems where cells are restricted to communicate only by means of the
environment but never forming any bond; (b) population P systems with bond
making rules with restricted communication rules; (c) population P systems
possessing only the cell differentiation operation; and (d) population
P systems equipped with cell division rules and bond making rules.},
keywords={Membrane computing, Cell bonding, Cell division, Cell differentiation, Turing
computability}
}
@article{Ciobanu:NGC:P_Transducers:2004,
author={Gabriel Ciobanu and Gheorghe P{\u a}un and Gheorghe Stefanescu},
title={{P} transducers},
journal={New Generation Computing},
year={2004},
note={To appear}
}
@article{Paun:BEATCS:Membrane_Computing_After_2BWMC:2004,
author={Gheorghe P{\u a}un},
title={Membrane Computing (after the {Second} {Brainstorming} {Week}, {Sevilla},
February 2004)},
journal={Bulletin of the EATCS},
year={2004},
month={June},
abstract={We briefly present some of the ideas discussed and the results obtained
during the Second Brainstorming Week on Membrane Computing, held in Sevilla
at the beginning of February 2004. Detains can be found in the proceedings
volume (whose contents is appened to these notes), available through the
P page http://psystems.disco.unimib.it, maintained in Milano under the
auspices of the European Molecular Computing Consortium, EMCC, or through
the recently created membrane computing forum page, in Sevilla, at http://www.cs.us.es/gcn/foro.htm.}
}
@article{Paun:TCS:Membrane_division:2004,
author={Gheorghe P{\u a}un and Yasuhiro Suzuki and Hiroshi Tanaka and Takashi Yokomori},
title={On the power of membrane division in {P} systems},
journal={Theoretical Computer Science},
year={2004},
month={September},
volume={324},
number={1},
pages={61--85},
abstract={First, we consider P systems with active membranes, hence with the possibility
that the membranes can be divided, with non-cooperating evolution rules
(the objects always evolve separately). These systems are known to be able
to solve NP-complete problems in linear time. Here we give a normal form
theorem for such systems: their computational universality is preserved
even if only the elementary membranes are divided. The possibility of solving
SAT in linear time is preserved only when non-elementary membranes may
also be divided under the influence of objects in their region. Second,
we consider a slight generalization, namely, we allow that a membrane can
produce by division both a copy of itself and a copy of a membrane with
a different label; again, only elementary membranes may be divided. In
this case, we prove that the hierarchy on the maximal number of membranes
present in the system collapses: three membranes at a time are sufficient
in order to characterize the recursively enumerable sets of vectors of
natural numbers. This result is optimal, two membranes are shown not to
be sufficient. Third, we consider P systems with cooperating rules (several
objects may evolve together). Making use of this powerful feature, we show
that many NP-complete problems can be solved in linear time in a quite
uniform way (by systems which are very similar to each other), using only
elementary membranes division (and not further ingredients, such as electrical
charges). The degree of cooperation is minimal: two objects at a time.},
keywords={Membrane computing; Recursively enumerable language; Universality; SAT problem}
}
@article{Nepomuceno:A_Java_Simulator:JUCS:2004,
author={Isabel A. Nepomuceno-Chamorro},
title={A {J}ava Simulator for Membrane Computing},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={620--629},
abstract={Membrane Computing is a recent area of Natural Computing, a topic where
much work has been done but still much remains to be done. There are some
applications which have been developed in imperative languages, like C++,
or in declaratives languages, as Prolog, working in the framework of P
systems. In this paper, a software tool (called SimCM, from Spanish Simulador
de Computaci{\'o}n con Membranas) for handling P systems is presented. The
program can simulate basic transition P Systems where dissolution of membranes
and priority rules are allowed. The software application is carried out
in an imperative and object-oriented language - Java. We choose Java because
it is a scalable and distributed language. Working with Java is the first
step to cross the border between simulations and a distributed implementation
able to capture the parallelism existing in the membrane computing area.
This tool is a friendly application which allows us to follow the evolution
of a P system easily and in a visual way. The program can be used to move
the P system theory closer to the biologist and all the people who wants
to learn and understand how this model works.},
keywords={P system, Parallelism, Simulation, Java}
}
@article{Inouye:WSEATBM:2004,
author={J. Inouye and P.P. Dey},
title={Membranous Filter Sort},
journal={WSEA Transactions on Biology and Medicine},
year={2004},
month={October},
volume={1},
number={4},
note={ISSN: 1109-9518}
}
@article{Dersanambika:IJCM:Contextual_array_PS:2004,
author={K.S. Dersanambika and Kamala Krithivasan},
title={Contextual Array {P} systems},
journal={International Journal of Computer Mathematics},
year={2004},
month={August},
volume={81},
number={8},
pages={955--969},
abstract={We define external and internal array contextual P systems, which generate
rectangular arrays. We also introduce external array contextual P systems
with erased contexts. Some properties of these systems are discussed. We
obtain the relation between external array contextual P systems and external
array contextual grammars with regular control.},
keywords={Contextual Grammars, P Systems, Array Grammars, Regular Control, Contextual
P Systems}
}
@article{Cienciala:JCST:2004,
author={L. Cienciala and L. Ciencialova},
title={Membrane automata with priorities},
journal={Journal of Computer Science and Technology},
year={2004},
volume={19},
number={1},
pages={89--97}
}
@article{Cienciala2:JCST:2004,
author={L. Cienciala and L. Ciencialova},
title={Membrane automata with priorities},
journal={Journal of Computer Science and Technology},
year={2004},
volume={19},
number={1},
pages={89--97}
}
@article{Pan:Active_Membranes_Separation_Rules:JUCS:2004,
author={Linqiang Pan and Tseren Onolt Ishdorj},
title={{P} systems with Active Membranes and Separation Rules},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={630--649},
abstract={The P systems are a class of distributed parallel computing devices of a
biochemical type. In this paper, a new definition of separation rules in
P systems with active membranes is given. Under the new definition, the
efficiency and universality of P systems with active membranes and separation
rules instead of division rules are investigated.},
keywords={Natural computing, Membrane computing, Distributed computing}
}
@article{Cienciala:JCST:Membrane_automata:2004,
author={Lud{\u e}k Cienciala and Lucie Ciencialov{\'a}},
title={Membrane automata with priorities},
journal={Journal of Computer Science and Technology},
year={2004},
month={January},
volume={19},
number={1},
pages={89--97},
note={Special issue on bioinformatics},
abstract={In this paper the one-way P automata with priorities are introduced. Such
automata are P systems where the membranes are only allowed to consume
objects from parent membranes, under the given conditions. The result of
computation of these systems is the set of multiset sequences consumed
by skin membrane into the system. The rules associated in some order with
each membrane cannot modify any objects, they can only move them through
membrane. We show that P automata with priorities and two membranes can
accept every recursively enumerated language.},
keywords={P systems, membrane computing}
}
@article{Mutyam:TCS:improved_hier:2004,
author={Madhu Mutyam},
title={Rewriting {P} systems: improved hierarchies},
journal={Theoretical Computer Science},
year={2004},
note={In press},
abstract={Generally, for proving universality results about rewriting P systems one
considers matrix grammars in the strong binary normal form. Such grammars
contain both matrices with rules used in the appearance checking mode and
matrices without appearance checking rules. In the proofs of most of the
universality theorems reported in the literature, appearance checking matrices
are simulated by using only two membranes, while four membranes are used
for simulating matrices without appearance checking rules. Thus, a way
to improve these theorems is to diminish the number of membranes used for
simulating matrices without appearance checking rules. In this paper we
address this problem, and give first a general improved result about simulating
matrix grammars without appearance checking: three membranes are shown
to suffice. This result is then used to improve several universality results
from various membrane computing papers, for instance, about P systems with
replicated rewriting, with leftmost rewriting, with conditional communication,
as well as for hybrid P systems with finite choice.},
keywords={P systems; Rewriting P systems; Recursively enumerable languages; Computational
universality; Leftmost rewriting; Replicated rewriting; Matrix languages;
Conditional communication; Penttonen normal form; Hybrid P systems}
}
@article{Mutyam:JUCS:Rewriting_tissue_PS:2004,
author={Madhu Mutyam and Vaka Jaya Prakash and Kamala Krithivasan},
title={Rewriting tissue {P} systems},
journal={Journal of Universal Computer Science},
year={2004},
month={September},
volume={10},
number={9},
pages={1250--1271},
abstract={By considering string-objects and rewriting rules, we propose a variant
of tissue P systems, namely, rewriting tissue P systems. We show the computational
efficiency of rewriting tissue P systems by solving the Satisfiability
and the Hamiltonian path problems in linear time. We study the computational
capacity of rewriting tissue P systems and show that rewriting tissue P
systems with at most two cells and four states are computationally universal.
We also show the universality result of rewriting tissue P systems with
at most one cell and five states. Finally we propose some new directions
for future work.},
keywords={Tissue P systems, rewriting tissue P systems, computational universality,
matrix grammars}
}
@article{Perez-Jimenez:Modelos_de_CCM:BSEMA:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Alvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
title={Modelos de computacion celular con membranas},
journal={Boletin de la Sociedad Espa{\~n}ola de Matem{\'a}tica Aplicada},
year={2004},
month={September},
number={29},
pages={57--88}
}
@article{Perez-Jimenez:Packing_Items_into_Bins:JUCS:2004,
author={Mario J. P{\'e}rez-Jim{\'e}nez and Francisco Jos{\'e} Romero-Campero},
title={An Efficient Family of {P} systems for Packing Items into Bins},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={650--670},
abstract={In this paper we present an effective solution to the Bin Paching problem
using a family of recognizer P systems with active membranes. The analysis
of the solution presented here will be done from the point of view of complexity
classes. A CLIPS simulator for recognizer P systems is used to describe
a session for an instance of Bin Packing, using a P system from the designed
family.},
keywords={Membrane computing, Recognizer P systems, Complexity classes, Bin Packing
problem, CLIPS}
}
@article{Cavaliere:Symport/Antiport_of_Rules:JUCS:2004,
author={Matteo Cavaliere and Daniela Genova},
title={{P} systems with Symport/Antiport of Rules},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={540--558},
abstract={Moving 'instructions' instead of 'data' using transport mechanisms inspired
by biology is the basic idea of the computing device presented in this
paper. Specifically, we propose a new class of P systems that use both
evolution rules and symport/antiport rules. The idea of this kind of systems
is the following: during a computation, symbol-objects (the 'data') evolve
using evolution rules, but they cannot be moved; on the other hand, the
evolution rules (the 'instructions') can be moved across the membranes
using classical symport/antiport rules. We present a number of results
using different combinations of evolution rules (catalytic, non-cooperative)
and the weight of the symport/antiport rules. In particular, we show that
using non-cooperative rules and antiports of unbounded weight makes it
possible to obtain at least the Parikh set of ET0L languages. On the other
hand, using catalytic rules (one catalyst) and antiports of weight 2, these
system become universal. Several open problems are also presented.},
keywords={Membrane computing, Communication, Evolution, P system, Symport, Antiport}
}
@article{Cavaliere:TCS:Evolution_observation:2004,
author={Matteo Cavaliere and Peter Leupold},
title={Evolution and observation�a non-standard way to generate formal languages},
journal={Theoretical Computer Science},
year={2004},
month={August},
volume={321},
number={2-3},
pages={233-248},
abstract={In biology and chemistry a standard proceeding is to conduct an experiment,
observe its progress, and then take the result of this observation as the
final output. Inspired by this, we have introduced P/O systems (A. Alhazov,
C. Mart{\'i}n-Vide, Gh. Pun, Pre-Proc. of the Workshop on Membrane Computing
2003, Tarrragona, Spain; http://pizarro.fll.urv.es/continguts/linguistica/proyecto/reports/wmc03.html),
where languages are generated by multiset automata that observe the evolution
of membrane systems. Now we apply this approach also to more classical
devices of formal language theory. Namely, we use finite automata observing
the derivations of grammars or of Lindenmayer systems. We define several
modes of operation for grammar/observer systems. In two of these modes
a context-free grammar (or even a locally commutative context-free grammar)
with a finite automaton as observer suffices to generate any recursively
enumerable language. In a third case, we obtain a class of languages between
the context-free and context-sensitive ones.},
keywords={Formal languages; Evolution; Observation}
}
@article{Ionescu:Promoters/Inhibitors:JUCS:2004,
author={Mihai Ionescu and Dragos Sburlan},
title={On {P} systems with Promoters/Inhibitors},
journal={Journal of Universal Computer Science},
year={2004},
month={May},
volume={10},
number={5},
pages={581--599},
abstract={This article shows how the computational universality can be reached using
P systems with object rewriting non-cooperative rules, promoters/inhibitors
at the level of rules, and only one catalyst. Both generative and accepting
cases are studied. The theoretical issues presented are illustrated by
several examples.},
keywords={P Systems, universality, promoters, inhibitors}
}
@article{Jonoska:FUND_INFORM:Tree_operations:2004,
author={Nata{\u s}a Jonoska and Maurice Margenstern},
title={Tree operations in {P} systems and $\lambda$-calculus},
journal={Fundamenta Informaticae},
year={2004},
volume={59},
number={1},
pages={67--90},
abstract={In this paper we introduce a membrane system (named ?P systems) in which
the computation is performed through certain operations on the tree structure
of the membranes. The objects within the membranes play the role of catalysts
for the operations. The result of the computation is the final configuration
of the system. We show that ?P systems can simulate pure ?-calculus and
so they have universal computational power. We also show that NP-complete
problems can be solved in polynomial time in this way by showing that 3SAT
is solvable in linear time with linear input.}
}
@article{Ibarra:TCS:Comput_Complexity_Mem_sys:2004,
author={Oscar H. Ibarra},
title={On the computational complexity of membrane systems},
journal={Theoretical Computer Science},
year={2004},
month={June},
volume={320},
number={1},
pages={89--109},
abstract={We show how techniques in machine-based complexity can be used to analyze
the complexity of membrane computing systems. We focus on catalytic syslems,
communicating P systems, and systems with only symport/antiport rules,
but our techniques are applicable to other P systems that are universal.
We define space and time complexity measures and show hierarchies of complexity
classes similar to well-known results concerning Turing machines and counter
machines. We also show that the deterministic communicating P system simulating
a deterministic counter machine in (Sosik (2002)) (Pre-Proc. of Workshop
on Membrane Computing (WMC-CdeA2002), Curtea de Arges, Romania, 2002, pp.
371-382), (Sosik and Matysek (2002)) (Unconventional Models of Computation
2002, Lecture Notes in Computer Science, vol. 2509, Springer, Berlin, 2002,
pp. 264-275.) can be constructed to have a fixed number of membranes, answering
positively an open question in Sosik (2002), Sosik and Matysek (2002).
We prove that reachability of extended configurations for symport/antiport
systems (as well as for catalytic systems and communicating P systems)
can be decided in nondeterministic log n space and, hence, in deterministic
log2 n space or in polynomial time, improving the main result in Paun et
al. (2002) (On the reachability problem for P systems with symport/antiport,
2002, submitted for publication.), We propose two equivalent systems that
define languages (instead of multisets of objects): the first is a catalytic
system language generator and the other is a communicating P system acceptor
(or a symport/antiport system acceptor). These devices are universal and
therefore can also be analyzed with respect to space and time complexity.
Finally, we give a characterization of semilinear languages in terms of
a restricted form of catalytic system language generator.},
keywords={acceptor, catalytic system, communicating P system, generator, membrane
computing, reachability, semilinear, space bounded, symport/antiport system,
time bounded}
}
@article{Ibarra:TCS:Membrane_hierarchy:2004,
author={Oscar H. Ibarra},
title={On membrane hierarchy in {P} systems},
journal={Theoretical Computer Science},
year={2004},
note={In press},
abstract={We look at a restricted model of a communicating P system, called RCPS,
whose environment does not contain any object initially. The system can
expel objects into the environment but only expelled objects can be retrieved
from the environment. Such a system is initially given an input a1i1�anin
(with each ij representing the multiplicity of distinguished object ai,
1in) and is used as an acceptor. We show that RCPSs are equivalent to two-way
multihead finite automata over bounded languages (i.e., subsets of a1*�an*,
for some distinct symbols a1,�,an). We then show that there is an infinite
hierarchy of RCPS's in terms of the number of membranes: For every r, there
is an s>r and a unary language L accepted by an RCPS with s membranes that
cannot be accepted by an RCPS with r membranes. This provides an answer
to an open problem in (Membrane Computing: An Introduction, Springer, Berlin,
2002) which asks whether there is a nonuniversal model of a membrane computing
system which induces an infinite hierarchy on the number of membranes.
We also consider variants/generalizations of RCPSs, e.g, acceptors of languages;
models that allow a 'polynomial bounded' supply of objects in the environment
initially; models with tentacles, etc. We show that they also form an infinite
hierarchy with respect to the number of membranes (or tentacles). The proof
techniques can be used to obtain similar results for other restricted models
of P systems, like symport/antiport systems.},
keywords={Membrane computing; Communicating P system; Counter machine; Two-way multihead
finite automaton; Hierarchy; System with tentacles; Semilinear set}
}
@article{Ibarra:THEOR_COMPUT_SCI:Catalytic_P_systems:2004,
author={Oscar H. Ibarra and Zhe Dang and Omer Egecioglu},
title={Catalytic {P} systems, semilinear sets, and vector addition systems},
journal={Theoretical Computer Science},
year={2004},
month={January},
volume={312},
number={2-3},
pages={379--399},
note={A short version of this paper (without proofs) was presented at the 28th
International Symposium on Mathematical Foundations of Computer Science
(MFCS 2003). This research was supported in part by NSF Grants IIS-0101134
and CCR02-08595.},
abstract={We look at 1-region membrane computing systems which only use rules of the
form Ca -> Cv, where C is a catalyst, a is a noncatalyst, and v is a (possibly
null) string of noncatalysts. There are no rules of the form a -> v. Thus,
we can think of these systems as 'purely' catalytic. We consider two types:
(1) when the initial configuration contains only one catalyst, and (2)
when the initial configuration contains multiple catalysts. We show that
systems of the first type are equivalent to communication-free Petri nets,
which are also equivalent to commutative context-free grammars. They define
precisely the semilinear sets. This partially answers an open question
(in: WMC-CdeA'02, Lecture Notes in Computer Science, vol. 2597, Springer,
Berlin, 2003, pp. 400�409; Computationally universal P systems without
priorities: two catalysts are sufficient, available at http://psystems.disco.unimib.it,
2003). Systems of the second type define exactly the recursively enumerable
sets of tuples (i.e., Turing machine computable). We also study an extended
model where the rules are of the form q: (p,Ca -> Cv) (where q and p are
states), i.e., the application of the rules is guided by a finite-state
control. For this generalized model, type (1) as well as type (2) with
some restriction correspond to vector addition systems. Finally, we briefly
investigate the closure properties of catalytic systems.},
keywords={Catalytic system, Membrane computing, Reachability problem, Semilinear set,
Vector addition system}
}
@article{Frisco:THEOR_COMPUT_SCI:The_Conformon-P:04,
author={Pierluigi Frisco},
title={The {Conformon-P System}: A Molecular and Cell Biology-Inspired Computability
Model},
journal={Theoretical Computer Science},
year={2004},
month={January},
volume={312},
number={2-3},
pages={295--319},
abstract={A new theoretical computational model, called conformon-P system, based
on simple and basic concepts inspired from a theoretical model of the living
cell and membrane computing is presented. The computational power of it
and of some natural variants are studied. Links with Petri nets, reversible
computation, other interpretations and variants of the model are briefly
outlined.},
keywords={DNA computing; Conformon; P system}
}
@article{Frisco:Acta_Inform:PSys_Simulat_Counter_Autom:2004,
author={Pierluigi Frisco and Hendrik Jan Hoogeboom},
title={{P} systems with symport/antiport simulating counter automata},
journal={Acta Informatica},
year={2004},
month={December},
volume={41},
number={2-3},
pages={145--170},
abstract={The generative capability of several variants of P systems with symport/antiport
is studied via the simulation of counter automata. This leads to the reduction
of the complexity, expressed in number of membranes and weight of rules,
of P systems generating recursively enumerable sets.}
}
@article{Freund:TCS:From,
author={Rudolf Freund and Carlos Mart{\'i}n-Vide and Gheorghe P{\u a}un},
title={From regulated rewriting to computing with membranes: collapsing hierarchies},
journal={Theoretical Computer Science},
year={2004},
month={January},
volume={312},
number={2-3},
pages={143--188},
abstract={In addressing certain problems about membrane computing, a recent and active
branch of natural computing, it first was necessary to address certain
problems from the area of regulated rewriting. Thus, the present paper
is a contribution to both these domains.A central problem in membrane computing
is that of the hierarchy with respect to the number of membranes: Are systems
with n + 1 membranes more powerful than systems with n membranes? Does
the number of membranes induce an infinite hierarchy of the computed functions?
Usually, when proving the universality of membrane systems (also called
P systems), one starts from a matrix grammar and the number of membranes
depends on the number of non-terminal symbols used by this grammar in the
so-called appearance checking mode. We first prove that recursively enumerable
languages can be generated by matrix grammars with only two non-terminal
symbols being used in the appearance checking mode. The proofs of this
fact and of several related results are based on a simulation of register
machines by means of graph-controlled grammars.Then, we consider three
classes of membrane systems, and in all the three cases the hierarchies
with respect to the number of membranes are shown to collapse at level
four: systems with four membranes are computationally universal (but we
do not know whether or not this result is optimal).},
keywords={P system, graph-controlled grammar, matrix grammar, membrane computing,
non-terminal complexity, programmed grammar, recursively enumerable language,
register machine, regulated rewriting}
}
@article{Freund:TCS:Tissue_PS_channel_stat:2004,
author={Rudolf Freund and Gheorghe P{\u a}un and Mario J. P{\'e}rez-Jim{\'e}nez},
title={Tissue {P} systems with channel states},
journal={Theoretical Computer Science},
year={2004},
note={In press},
abstract={We consider tissue-like P systems with states associated with the links
(we call them synapses) between cells, controlling the passage of objects
across the links. We investigate the computing power of such devices for
the case of using�in a sequential manner�antiport rules of small weights.
Systems with two cells are proved to be universal when having arbitrarily
many states and minimal antiport rules, or one state and antiport rules
of weight two. Also the systems with arbitrarily many cells, three states,
and minimal antiport rules are universal. In contrast, the systems with
one cell and any number of states and rules of any weight only compute
Parikh sets of matrix languages (generated by matrix grammars without appearance
checking); characterizations of Parikh images of matrix languages are obtained
for such one-cell systems with antiport rules of a reduced weight.},
keywords={Matrix grammars; Membrane computing; P systems; States; Turing computability}
}
@article{Freund:TCS:Two_catalyst:2004,
author={Rudolf Freund and Lila Kari and Marion Oswald and Petr Sos{\'i}k},
title={Computationally universal {P} systems without priorities: two catalysts
are sufficient},
journal={Theoretical Computer Science},
year={2004},
note={In press},
abstract={The original model of P systems with symbol objects introduced by Paun was
shown to be computationally universal, provided that catalysts and priorities
of rules are used. By reduction via register machines Sosik´ and Freund
proved that the priorities may be omitted from the model without loss of
computational power. Freund, Oswald, and Sosik´ considered several variants
of P systems with catalysts (but without priorities) and investigated the
number of catalysts needed for these specific variants to be computationally
universal. It was shown that for the classical model of P systems with
the minimal number of two membranes the number of catalysts can be reduced
from six to five; using the idea of final states the number of catalysts
could even be reduced to four. In this paper we are able to reduce the
number of catalysts again: two catalysts are already sufficient. For P
systems with external output or extended P systems we even need only one
membrane and two catalysts. For the (purely) catalytic systems considered
by Ibarra only three catalysts are already enough.},
keywords={Membrane computing; P systems; Catalysts; Complexity; Universality}
}
@article{Freund:NGC:P_S_with_local_graph:2004,
author={Rudolf Freund and Marion Oswald},
title={{P} systems with Local Graph Productions},
journal={New Generation Computing},
year={2004},
month={August},
volume={22},
number={4},
pages={365--375},
abstract={P systems (membrane systems) of various types so far mainly have been considered
as computing devices working on multisets or strings. In this paper we
investigate P systems with local graph productions generating weakly connected
directed graphs. At least when equipped with a priority relation on the
rules, such P systems can generate any recursively enumerable language
of weakly connected directed graphs with only one membrane.},
keywords={Membrane Computing, Graph Grammar, Recursively Enumerable Language.}
}
@article{Krishna:NGC:Results_on_catalytic:2004,
author={Shankara Narayanan Krishna and Andrei P{\u a}un},
title={Results on Catalytic and Evolution-Communication {P} systems},
journal={New Generation Computing},
year={2004},
month={August},
volume={22},
number={4},
pages={377--394},
abstract={In this paper we give several improved universality results for two important
classes of P systems: P systems with catalysts and evolution-communication
P systems. First, the result from Reference 14), stating that six catalysts
ensure the universality, has been improved in two ways: using bistable
catalysts and using moving catalysts. Specifically, the universality can
be reached with one bistable catalyst and 2 usual catalysts (using five
membranes), as well as with one moving catalyst and three membranes, or
with two moving catalysts and only two membranes. The second part of the
paper deals with evolution-communication P systems, and we also give improved
universality results for this type of systems, in terms of the weight of
symport/antiport rules, number of membranes, or number of catalysts.},
keywords={Membrane Computing, Register Machine, Matrix Grammar, P System.}
}
@article{Nishida:JCI:NP_Complete_Optimization:2004,
author={Taishin Yasunobu Nishida},
title={An approximate algorithm for {NP}-complete optimization problems exploiting
{P} systems},
journal={Journal of Cybernetics and Informatics},
year={2004},
volume={V},
pages={109--112}
}
@article{Besozzi:Soft_Computing:Sept:2005,
author={D. Besozzi and E. Csuhaj-Varju and G. Mauri and C. Zandron},
title={On the power and size of extended gemmating P systems},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={650-6},
abstract={In [3] P systems with gemmation of mobile membranes were examined. It was
shown that (extended) systems with eight membranes are as powerful as the
Turing machines. Moreover, it was proved that extended gemmating P systems
with only pre-dynamical rules are still computationally complete: in this
case nine membranes are needed to obtain this computational power. In this
paper we improve the above results concerning the size bound of extended
gemmating P systems, namely we prove that these systems with at most five
membranes (with meta-priority relations and without communication rules)
form a class of universal computing devices, while in the case of extended
systems with only pre-dynamical rules six membranes are enough to determine
any recursively enumerable language.},
keywords={Membrane Computing, Gemmation, Recursively Enumerable Language, Geffert
Normal Form}
}
@article{Bernardini:Soft_Computing:Sept:2005,
author={F. Bernardini and M. Gheorghe},
title={Cell communication in tissue P systems: universality results},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={640-649},
abstract={We introduce an evolution-communication model for tissue P systems where
communication rules are inspired by the general mechanism of cell communication
based on signals and receptors: a multiset can enter a cell only in the
presence of another multiset. Some basic variants of this model are also
considered where communication is restricted either to be unidirectional
or to use special multisets of objects called receptors. The universality
for all these variants of tissue P systems is then proved by using two
cells (three cells in the case of unidirectional communication) and rules
of a minimal size.},
keywords={Membrane computing, Turing computability, Tissue}
}
@article{Bernardini:Almost_periodicity:FUND_INFORM:05,
author={Francesco Bernardini and Marian Gheorghe and Vincenzo Manca},
title={On {P} systems and almost periodicity},
journal={Fundamenta Informaticae},
year={2005},
note={To appear}
}
@article{Paun:S_A_3_objects_are_universal:FUND_INFORM:05,
author={Gheorghe P{\u a}un and Juan Pazos and Mario Jes{\'u}s P{\'e}rez-Jim{\'e}nez and Alfonso
Rodriguez-Pat{\'o}n},
title={Symport/antiport {P} systems with three objects are universal},
journal={Fundamenta Informaticae},
year={2005},
note={To appear}
}
@article{Ardelean:Soft_Computing:Sept:2005,
author={I.I. Ardelean and M. Cavaliere and D. Sburlan},
title={Computing using signals: from cells to P systems},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={631-639},
abstract={In cell biology a fundamental topic is the study of how biological signals
are managed by cells. Signals can arise from inside the cell or from the
external environment and the correct answer to certain signals is essential
for bacteria to survive in a certain environment. Starting from these biological
motivations we consider a model of P systems where the computation is controlled
by signals which move across the regions. In particular, we consider signals-based
P systems where the symbol-objects cannot be moved and the evolution rules
can be activated/inactivated using a finite number of signals (signal-promoters)
moved across the membranes, differently from standard P systems using promoters,
in our case signal-promoters cannot be created during the computation.
After discussing the biological motivations we show how this model becomes
universal when it uses one catalyst and a bounded number of signal-promoters.
Also results concerning signals-based P systems using non cooperative rules
together with several open problems are presented.},
keywords={Membrane Computing, Cell Biology, Turing Computability, L System}
}
@article{Ledesma:Soft_Computing:Sept:2005,
author={L. Ledesma and D. Manrique and A. Rodriguez-Paton},
title={A tissue P system and a DNA microfluidic device for solving the shortest
common superstring problem},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={679-685},
abstract={This paper describes a tissue P system for solving the Shortest Common Superstring
Problem in linear time. This tissue P system is well suited for parallel
and distributed implementation using a microfluidic device working with
DNA strands. The approach is not based on the usual brute force generate/test
technique applied in DNA computing, but it builds the space solution gradually.
The possible solutions/superstrings are build step by step through the
parallel distributed combination of strings using the overlapping concatenation
operation. Moreover, the DNA microfluidic device solves the problem autonomously,
without the need of external control or manipulation.},
keywords={Membrane computing, DNA computing, Microflow reactor, Shortest common superstring
problem}
}
@article{Pan.Alhazov.Ishdorj:FurtherMemOps:Soft_Computing2005,
author = {Linqiang Pan and Artiom Alhazov and {\relax Ts}eren-Onolt Isdorj},
title = {Further remarks on P systems with active membranes, separation, merging
and release rules},
journal = {Soft Computing},
year = {2005},
month = {September},
volume = {9},
number = {9},
pages = {686-690},
abstract = {The P systems are a class of distributed parallel
computing devices of a biochemical type. In this note
we show that by using membrane separation to obtain
exponential workspace, SAT problem can be solved in linear time
in a uniform and confluent way by active P systems
without polarizations. This improves some results already
obtained by A. Alhazov, T.-O. Isdorj. A universality result
related to membrane separation is also obtained.},
keywords = {Membrane computing, Turing computability, {SAT} problem},
url = {http://dx.doi.org/10.1007/s00500-004-0399-y},
}
@article{Gutierrez-Naranjo:Soft_Computing:Sept:2005,
author = {M.A. Guti{\'e}rrez-Naranjo and M.J. P{\'e}rez-Jim{\'e}nez and A. Riscos-N{\'u}{\~n}ez},
title = {A fast {P} system for finding a balanced 2-partition},
journal = {Soft Computing},
year = {2005},
month = {September},
volume = {9},
number = {9},
pages = {673-678},
abstract = {Numerical problems are not very frequently addressed in the P systems literature.
In this paper we present an effective solution to the 2-Partition problem
via a family of deterministic P systems with active membranes using 2-division.
The design of this solution is a sequel of several previous works on other
problems, mainly on the Subset-Sum and the Knapsack problems. Several improvements
are introduced and explained.},
keywords = {Complexity class, Membrane computing, Active membranes, {NP}-Complete problem},
}
@article{Cavaliere:Time_and_synchronization:FUND_INFORM:05,
author={Matteo Cavaliere and S. Sburlan},
title={Time and synchronization in membrane systems},
journal={Fundamenta Informaticae},
year={2005},
note={To appear}
}
@article{Frisco:Soft_Computing:Sept:2005,
author={P. Frisco},
title={About P systems with symport/antiport},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={664-672},
abstract={It is proved that four membranes suffice to a variant of P systems with
symport/antiport with maximal parallelism to generate all recursively enumerable
sets of numbers. P systems with symport/antiport without maximal parallelism
are also studied, considering two termination criteria.},
keywords={Membrane computing, Turing computability, Symport/Antiport, Counter automaton}
}
@article{Freund:Soft_Computing:Sept:2005,
author={R. Freund and A. Paun},
title={P systems with active membranes and without polarizations},
journal={Soft Computing},
year={2005},
month={September},
volume={9},
number={9},
pages={657-663},
abstract={P systems with active membranes but without using electrical charges (polarizations)
are shown to be complete for generating recursively enumerable string languages
when working on string objects and using only rules with membrane transitions
as well as rules with membrane dissolving and elementary membrane division,
but also when using various other kinds of rules, even including a new
type of rules allowing for membrane generation. In particular, allowing
for changing membrane labels turns out to be a very powerful control feature.},
keywords={Membrane computing, Recursively enumerable language, Membrane polarization}
}
@article{Krishna:Further_results:FUND_INFORM:05,
author={Shankara Narayanan Krishna and Raghavan Rama and H. Ramesh},
title={Further results on contextual/rewriting {P} systems},
journal={Fundamenta Informaticae},
year={2005},
note={To appear}
}
@article{Alhazov.etal:UnitEnergy:FI2006,
author = {Artiom Alhazov and Rudolf Freund and Alberto Leporati and Marion Oswald and Claudio Zandron},
title = {(Tissue) {P} Systems with Unit Rules and Energy Assigned to Membranes},
journal = {Fundamenta Informaticae},
volume = {74},
number = {4},
year = {2006},
month = {December},
pages = {391--408},
abstract = {We introduce a new variant of membrane systems where
the rules are directly assigned to membranes and, moreover
every membrane carries an energy value that can be changed
during a computation by objects passing through the membrane.
The result of a successful computation is considered
to be the distribution of energy values carried by the membranes.
We show that for systems working in the sequential mode
with a kind of priority relation on the rules we already obtain
universal computational power. When omitting the priority relation
we obtain a characterization of the family of Parikh sets of languages
generated by context-free matrix grammars. On the other hand
when using the maximally parallel mode, we do not need
a priority relation to obtain computational completeness.
Finally, we introduce the corresponding model of tissue P systems
with energy assigned to the membrane of each cell and objects
moving from one cell to another one in the environment as well
as being able to change the energy of a cell
when entering or leaving the cell. In each derivation step
only one object may pass through the membrane of each cell.
When using priorities on the rules in the sequential mode
(where in each derivation step only one cell is affected)
as well as without priorities in the maximally parallel mode
(where in each derivation step all cells possible are affected)
we again obtain computational completeness, whereas
without priorities on the rules in the sequential mode
we only get a characterization of the family of Parikh sets
of languages generated by context-free matrix grammars.},
keywords = {computational completeness, matrix grammars, membrane computing, P systems},
url = {http://iospress.metapress.com/content/5v45rcedw5rfyvnv/},
}
@article{Leporati:Reversible_P_systems:FI:2006,
author={A. Leporati and C. Zandron and G. Mauri},
title={Reversible {P} systems to simulate Fredkin circuits},
journal={Fundamenta Informaticae},
year={2006},
volume={74},
number={4},
pages={529--548}
}
@article{Obtulowicz:IJFCS:17:1:F2006,
author={Adam Obtulowicz},
title={Gandy's principles for mechanisms and membrane computing},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={167-181},
abstract={The interconnections between membrane computing [9,11] and Gandy's principles
for mechanisms in [3] are discussed. The embedding of the classes of hereditary
finite sets (used to formulate Gandy's principles) into the class of abstract
membrane systems is shown. A concept of a hereditary finite multiset is
introduced as a special case of hereditary finite sets and then a representation
of finite abstract membrane systems by hereditary finite multisets is presented.
In this framework, a counterpart of the idea of reassemblance of hereditary
finite sets is obtained for membrane systems.},
keywords={Membrane computing, hereditary finite sets, reassemblance}
}
@article{Leporati:IJFCS:17:1:F2006,
author={Alberto Leporati and Claudio Zandron and Miguel A. Guti{\'e}rrez-Naranjo},
title={{P} systems with input in binary form},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={127-146},
abstract={Current P systems which solve NP-complete numerical problems represent the
instances of the problems in unary notation. However, in classical complexity
theory, based upon Turing machines, switching from binary to unary encoded
instances generally corresponds to simplify the problem. In this paper
we show that, when working with P systems, we can assume without loss of
generality that instances are expressed in binary notation. More precisely,
we propose a simple method to encode binary numbers using multisets, and
a family of P systems which transforms such multisets into the usual unary
notation. Such a family could thus be composed with the unary P systems
currently proposed in the literature to obtain (uniform) families of P
systems which solve NP-complete numerical problems with instances encoded
in binary notation. We introduce also a framework which can be used to
design uniform families of P systems which solve NP-complete problems (both
numerical and non-numerical) working directly on binary encoded instances,
i.e., without first transforming them to unary notation. We illustrate
our framework by designing a family of P systems which solves the 3-SAT
problem. Next, we discuss the modifications needed to obtain a family of
P systems which solves the PARTITION numerical problem.},
keywords={Membrane computing, P systems, PARTITION, 3-SAT}
}
@article{Alhazov.etal:tCarpet:IJFCS2006,
author = {Artiom Alhazov and Rudolf Freund and Marion Oswald},
title = {Cell/Symbol Complexity of Tissue {P} Systems
with Symport/Antiport Rules},
journal = {International Journal of Foundations of Computer Science},
year = {2006},
month = {February},
volume = {17},
number = {1},
pages = {3-25},
abstract = {We consider tissue P systems with symport/antiport
rules and investigate their computational power when using
only a (very) small number of symbols and cells. Even when
using only one symbol, we need at most six (seven when allowing
only one channel between a cell and the environment) cells
to generate any recursively enumerable set of natural numbers.
On the other hand, with only one cell we can only generate
regular sets when using one channel with the environment
whereas one cell with two channels between the cell and the
environment obtains computational completeness with five symbols.
Between these extreme cases of one symbol and one cell
respectively, there seems to be a trade-off between the number
of cells and the number of symbols. For example, for the case
of tissue P systems with two channels between a cell and
the environment we show that computational completeness
can be obtained with two cells and three symbols as well as
with three cells and two symbols, respectively. Moreover
we also show that some variants of tissue P systems characterize
the families of finite or regular sets of natural numbers.},
keywords = {Membrane computing, antiport rules, cells
descriptional complexity, tissue P systems, universality},
url = {http://dx.doi.org/10.1142/S012905410600367X},
}
@article{Pescini:IJFCS:17:1:F2006,
author={Dario Pescini and Daniela Besozzi and Giancarlo Mauri and Claudio Zandron},
title={Dynamical probabilistic {P} systems},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={183-204},
abstract={Dynamical probabilistic P systems are discrete, stochastic, and parallel
devices, where the probability values associated with the rules change
during the evolution of the system. These systems are proposed as a novel
approach to the analysis and simulation of the behavior of complex systems.
We introduce all necessary definitions of these systems and of their dynamical
aspects, we describe the functioning of the parallel and stochastic algorithm
used in computer simulation, and evaluate its time complexity. Finally,
we show some applications of dynamical probabilistic P systems for the
investigation of the dynamics of the Lotka-Volterra system and of metapopulation
systems.},
keywords={P system, dynamical system, stochastic process, metapopulation}
}
@article{Sburlan:IJFCS:17:1:F2006,
author={Dragos Sburlan},
title={Further results on {P} systems with promoters/inhibitors},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={205-221},
abstract={This paper presents several results regarding P systems with non-cooperative
rules and promoters/inhibitors at the level of rules. For the class of
P systems using inhibitors, generating families of sets of vectors of numbers,
a characterization of the family of Parikh sets of ET0L languages is shown.
In the case of P systems with non-cooperative promoted rules even if an
upper bound was not given, the inclusion of the family PsET0L was proved.
Moreover, a characterization of such systems by means of a particular form
of random context grammars, therefore a sequential formal device, is proposed.},
keywords={P Systems, promoters, inhibitors, random context}
}
@article{Bernardini:TCS:2006_,
author={F. Bernardini and M. Gheorghe and N. Krasnogor},
title={Population {P} systems and quorum sensing in bacteria},
journal={Theoretical Computer Science},
year={2006},
note={¿?}
}
@article{Ciobanu:IJFCS:17:1:F2006,
author={Gabriel Ciobanu and Mihai Gontineac},
title={Mealy multiset automata},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={111-126},
abstract={In this paper we introduce and study Mealy multiset automata, presenting
some useful properties of multisets and comparing various approaches. We
present the notions of bisimulation, observability, and behavior for Mealy
multiset automata. We give a characterization of the bisimulation relation
between two Mealy multiset automata, and a result relating their general
behavior and sequential behavior. We define cascade and direct product
of Mealy multiset automata. Then we introduce Mealy membrane automata corresponding
to elementary P systems.},
keywords={Mealy automata, multisets, bisimulation, membranes systems}
}
@article{Chen:Handling_languages_with:ROMJIST:2006,
author={H. Chen and T.-O. Ishdorj and Gh. Paun and M.J. Perez-Jimenez},
title={Handling languages with spiking neural P systems with extended rules},
journal={Romanian Journal of Information Science and Technology},
year={2006},
note={Accepted}
}
@article{Chen:Handling,
author={H. Chen and T.-O. Ishdorj and Gh. Paun and M.J. Perez-Jimenez},
title={Handling languages with spiking neural P systems with extended rules},
journal={Romanian Journal of Information Science and Technology},
year={2006},
volume={9},
number={3},
pages={151--162}
}
@article{Subramanian:On,
author={K.G. Subramanian and S. Hemalatha and C. Sri Hari Nagore and M. Margenstern},
title={On the power of P systems with parallel rewriting and conditional communication},
journal={Romanian Journal of Information Science and Technology},
year={2006},
note={Accepted}
}
@article{Bianco:IJFCS:17:1:F2006,
author={Luca Bianco and Federico Fontana And Vincenzo Manca},
title={{P} systems with reaction maps},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={27-48},
abstract={Some recent types of membrane systems have shown their potential in the
modelling of specific processes governing biological cell behavior. These
models represent the cell as a huge and complex dynamical system in which
quantitative aspects, such as biochemical concentrations, must be related
to the discrete informational nature of the DNA and to the function of
the organelles living in the cytosol. In an effort to compute dynamical
(especially oscillatory) phenomena-so far mostly treated using differential
mathematical tools-by means of rewriting rules, we have enriched a known
family of membrane systems (P systems), with rules that are applied proportionally
to the values expressed by real functions called reaction maps. Such maps
are designed to model the dynamic behavior of a biochemical phenomenon
and their formalization is best worked out inside a family of P systems
called PB systems. The overall rule activity is controlled by an algorithm
that guarantees the system to evolve consistently with the available resources
(i.e., objects). Though radically different, PB systems with reaction maps
exhibit very interesting, often similar dynamic behavior as compared to
systems of differential equations. Successful simulations of the Lotka-Volterra
population dynamics, the Brusselator, and the Protein Kinase C activation
foster potential applications of these systems in computational systems
biology.},
keywords={Membrane computing, dynamical systems modelling, computational systems biology}
}
@article{Cardelli:IJFCS:17:1:F2006,
author={Luca Cardelli and Gheorghe Paun},
title={An universality result for a (mem)brane calculus based on mate/drip operations},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={49-68},
abstract={Operations with membranes are essential both in brane calculi and in membrane
computing. In this paper we take four basic operations from brane calculi,
pino, exo, mate, drip, we express them in terms of the membrane computing
formalism, and then we investigate the computing power of the P systems
using the mate, drip operations as unique evolution rules. All operations
are controlled by - and make evolve - multisets of protein-objects embedded
in the membranes themselves (not contained in the compartments of the cell,
as standard in membrane computing all compartments delimited by membranes
are here empty). Somewhat surprisingly, for systems which use the mate,
drip operations we obtain the Turing completeness. The power of P systems
based on other operations remains to be investigated.},
keywords={Brane calculi, membrane computing, universality, matrix grammar}
}
@article{Cavaliere:IJFCS:17:1:F2006,
author={Matteo Cavaliere and Vincenzo Deufemia},
title={Further results on time-free {P} systems},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={69-89},
abstract={Membrane systems (currently called P systems) are parallel computing devices
inspired by the structure and the functioning of living cells. A standard
feature of P systems is that each rule is executed in exactly one time
unit. Actually, in living cells different chemical reactions might take
different times to be executed moreover, it might be hard to know precisely
such time of execution. For this reason, in [7] two models of P systems
(time-free and clock-free P systems) have been defined and investigated,
where the time of execution of the rules is arbitrary and the output produced
by the system is always the same, independently of this time. Preliminary
results concerning time-free and clock-free P system have been obtained
in [6, 7, 8]. In this paper we continue these investigations by considering
different combinations of possible ingredients. In particular, we present
the universality of time-free P systems using bi-stable catalysts. Then,
we prove that this result implies that is not possible to decide whether
an arbitrary bi-stable catalytic P system is time-free. We present several
results about time-free evolution-communication P systems, where the computation
is a mixed application of evolution and symport/antiport rules. In this
case we obtain the universality even by using non-cooperative evolution
rules and antiports of weight one. Finally, we formulate several open problems.},
keywords={Membrane systems, decidability, time-free system, universality}
}
@article{Muskulus:IJFCS:17:1:F2006,
author={Michael Muskulus and Robert Brijder},
title={Complexity of bio-computation: symbolic dynamics in membrane systems},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={147-165},
abstract={We discuss aspects of biological relevance to the modelling of bio-computation
in a multiset rewriting system context: turnover, robustness against perturbations,
and the dataflow programming paradigm. The systems under consideration
are maximally parallel and asynchronous parallel membrane systems, the
latter corresponding to computation in which the notion of time is operationally
meaningless. A natural geometrical setting which seems promising for the
study of computational processes in general multiset rewriting systems
is presented. Configuration space corresponds to a subset of the lattice
N sub 0 super d, n, d, and state transitions correspond to vector addition.
The similarities and differences with Vector Addition Systems and Petri
nets are discussed. Symbolic dynamics are introduced on special partitions
of configuration space and we indicate different notions of complexity
for membrane systems based on this and related concepts such as graph complexity
and minimal automata. Some examples of synchronized, pipelined dataflow
computations are given and decompositions into functional subunits are
briefly commented on.},
keywords={Membrane systems, vector addition systems, symbolic dynamics, dataflow computation,
geometry of computation, automata decomposition, computational mechanics,
robust bio-computation}
}
@article{Ceterchi:IJFCS:17:1:F2006,
author={Rodica Ceterchi and Mario J. P{\'U}rez-Jim{\'U}nez},
title={On simulating a class of parallel architectures},
journal={International Journal of Foundations of Computer Science},
year={2006},
month={February},
volume={17},
number={1},
pages={91-110},
abstract={The purpose of this paper is twofold. On one hand, we introduce the concept
of P system with dynamic communication graphs in its full generality, independent
of applications. On the other hand, we illustrate one application of it
to the simulation of a class of parallel architectures. In this last direction
we extend previous work concerned with the simulation of particular architectures.},
keywords={Membrane computing, parallel architectures, dynamic communication, graphs}
}
@article{Freund:Pcolonies:IJCM:2006,
author={Rudolf Freund and Marion Oswald},
title={P colonies and prescribed teams},
journal={Intern. J. Computer Math.},
year={2006}
}
@article{Krishna:TCS:2006_,
author={S.N. Krishna},
title={Universality results for a brane calculus},
journal={Theoretical Computer Science},
year={2006},
note={¿?}
}
@article{Hemalatha:Array-rewriting:RMSLNS:2007,
author={D. Hemalatha and K.S. Dersanambika and K.G. Subramanian and C. Sri Hari
Nagore},
title={Array-rewriting P systems with conditional communication},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={155--160}
}
@article{Paun:Spiking_neural_P_systems:EATCS:2007,
author={Gh. Paun},
title={Spiking neural {P} systems. {A} tutorial},
journal={Bulletin of the EATCS},
year={2007},
month={February}
}
@article{Krithivasan:A,
author={K. Krithivasan},
title={A glimpse of membrane computing},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={49--61}
}
@article{Cienciala:On_the_power_of:IJFCS:2007,
author={L. Cienciala and L. Ciencialova and P. Frisco and P. Sosik},
title={On the power of deterministic and sequential communicating {P} systems},
journal={International Journal of Foundations of Computer Science},
year={2007},
volume={18},
number={2},
pages={415--431}
}
@article{Mutyam:Tissue:RMSLNS:2007,
author={M. Mutyam and K. Krithivasan},
title={Tissue P systems with leftmost derivation},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={187--196}
}
@article{Andrei:A_rewriting_logic:TCS:2007,
author={O. Andrei and G. Ciobanu and D. Lucanu},
title={A rewriting logic framework for operational semantics of membrane systems},
journal={Theoretical Computer Science},
year={2007},
volume={373},
number={3},
pages={163--181}
}
@article{Frisco:From,
author={P. Frisco},
title={From molecular computing to modelling with conformons and computing by observation},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={85--101}
}
@article{Krishna:On,
author={S.N. Krishna},
title={On the efficiency of a variant of P systems with mobile membranes},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={171--178}
}
@article{Krishna:An,
author={S.N. Krishna and R. Rama},
title={An infinite hierarchy for some variants of P systems},
journal={Ramanujan Math. Soc. Lecture Notes Series},
year={2007},
number={3},
pages={179--185}
}