P-Article

July 14, 2010

References

[1] Joaquin Aguado, Tudor Balanescu, Tony Cowling, Marian Gheorghe,Mike Holcombe, and Florentin Ipate. P systems with replicated rewritingand stream X-Machines (Eilenberg, machines). Fundamenta Informati-

cae, 49(1-3):17–33, January 2002. Special Issue: Membrane Computing(WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[2] Artiom Alhazov. Minimizing evolution-communication P systems andautomata. New Generation Computing, 22(4):299–310, August 2004.

[3] Artiom Alhazov. On determinism of evolution-communication P systems.Journal of Universal Computer Science, 10(5):502–508, May 2004.

[4] Artiom Alhazov. P systems without multiplicities of symbol-objects. In-

formation Processing Letters, 100(3), November 2006.

[5] Artiom Alhazov. Ciliate operations without context in a membrane com-puting framework. Romanian Journal of Information Science and Tech-

nology, 10(4):315–322, 2008.

[6] Artiom Alhazov, Elena Boian, Svetlana Cojocaru, and Yurii Rogozhin.Modelling inflections in Romanian language by P systems with stringreplication. Computer Science Journal of Moldova, 17(2(50)):160–178,2009.

[7] Artiom Alhazov, Svetlana Cojocaru, Ludmila Malahova, and Yurii Ro-gozhin. Dictionary search and update by P systems with string-objectsand active membranes. International Journal of Computers, Communi-

cations and Control, IV(3):206–213, 2009.

[8] Artiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, andClaudio Zandron. (tissue) P systems with unit rules and energy assignedto membranes. Fundamenta Informaticae, 74(4):391–408, December 2006.

[9] Artiom Alhazov, Rudolf Freund, and Marion Oswald. Cell/symbol com-plexity of tissue P systems with symport/antiport rules. International

Journal of Foundations of Computer Science, 17(1):3–25, February 2006.

1

[10] Artiom Alhazov, Rudolf Freund, Marion Oswald, and Sergey Verlan. Par-tial halting and minimal parallelism based on arbitrary rule partitions.Fundamenta Informaticae, 91(1):17–34, April 2009.

[11] Artiom Alhazov, Rudolf Freund, and Agustın Riscos-Nunez. Membranedivision, restricted membrane creation and object complexity in P sys-tems. International Journal of Computer Mathematics, 83(7):529–548,2006.

[12] Artiom Alhazov, Carlos Martın-Vide, and Linqiang Pan. Solving aPSPACE-complete problem by recognizing P systems with restricted ac-tive membranes. Fundamenta Informaticae, 58(2):67–77, 2003.

[13] Artiom Alhazov and Linqiang Pan. Polarizationless P systems with activemembranes. Grammars, 7:141–159, 2004.

[14] Artiom Alhazov, Linqiang Pan, and Gheorghe Paun. Trading polariza-tions for labels in P systems with active membranes. Acta Informatica,41(2-3):111–144, December 2004.

[15] Artiom Alhazov and Yurii Rogozhin. Generating languages by P sys-tems with minimal symport/antiport. The Computer Science Journal of

Moldova, 14(3):299–323, 2006.

[16] Artiom Alhazov, Yurii Rogozhin, and Sergey Verlan. Minimal cooperationin symport/antiport tissue P systems. International Journal of Founda-

tions of Computer Science, 18(1):163–180, February 2007.

[17] O. Andrei, G. Ciobanu, and D. Lucanu. A rewriting logic frameworkfor operational semantics of membrane systems. Theoretical Computer

Science, 373(3):163–181, 2007.

[18] Subbaiah Annadurai, Thiyagarajan Kalyani, Vincent Rajkumar Dare, andDurairaj Gnanaraj Thomas. P systems generating iso-picture languages.Progress in Natural Science, 18(5):617–622, 2008.

[19] Subbaiah Annadurai, Thiyagarajan Kalyani, Vincent Rajkumar Dare, andDurairaj Gnanaraj Thomas. Trajectory P systems. Progress in Natural

Science, 18(5):611–616, 2008.

[20] I.I. Ardelean, M. Cavaliere, and D. Sburlan. Computing using signals:from cells to p systems. Soft Computing, 9(9):631–639, September 2005.

[21] Ioan I. Ardelean. The relevance of cell membranes for P systems. Generalaspects. Fundamenta Informaticae, 49(1-3):35–43, January 2002. SpecialIssue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): CarlosMartın-Vide, Gheorghe Paun.

[22] Ioan I. Ardelean and Matteo Cavaliere. Modelling biological processes byusing a probabilistic P system software. Natural Computing, 2(2):173–197,July 2003.

2

[23] Fernando Arroyo, Angel Baranda, Juan Castellanos, and Gheorghe Paun.Membrane computing: The power of (rule) creation. Journal of Universal

Computer Science, 8(3):369–381, 2002.

[24] Fernando Arroyo, Carmen Luengo, Luis Fernandez, Luis F. de Mingo, andJuan Castellanos. Simulating membrane systems in digital computers.International Journal ”Information Theories & Applications”, 11(1):29–34, 2004.

[25] Adrian Atanasiu and Carlos Martın-Vide. Arithmetic with membranes.Romanian Journal of Information Science and Technology, 4(1-2):5–20,2001.

[26] Adrian Atanasiu and Carlos Martın-Vide. Recursive calculus with mem-branes. Fundamenta Informaticae, 49(1-3):45–59, January 2002. SpecialIssue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): CarlosMartın-Vide, Gheorghe Paun.

[27] Angel V. Baranda, Juan Castellanos, Rafael Gonzalo, Fernando Arroyo,and Luis-F. Mingo. Data structures for implementing transition P systemsin silico. Romanian Journal of Information Science and Technology, 4(1-2):21–32, 2001.

[28] Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, and SimoneTini. Compositional semantics and behavioral equivalences for P systems.Theoretical Computer Science, 395(1):77–100, 2008.

[29] Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, and SimoneTini. A P systems flat form preserving step-by-step behaviour. Funda-

menta Informaticae, 87(1):1–34, 2008.

[30] Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, and AngeloTroina. Bisimulations in calculi modelling membranes. Formal Aspects of

Computing, 20(4-5):351–377, 2008.

[31] F. Bernardini and M. Gheorghe. Cell communication in tissue p systems:universality results. Soft Computing, 9(9):640–649, September 2005.

[32] F. Bernardini, M. Gheorghe, and N. Krasnogor. Population P systemsand quorum sensing in bacteria. Theoretical Computer Science, 2006. ?

[33] Francesco Bernardini and Marian Gheorghe. Languages generated by Psystems with active membranes. New Generation Computing, 22(4):311–329, August 2004.

[34] Francesco Bernardini and Marian Gheorghe. Population P systems. Jour-

nal of Universal Computer Science, 10(5):509–539, May 2004.

[35] Francesco Bernardini, Marian Gheorghe, and Mike Holcombe. PX systems= P systems + X machines. Natural Computing, 2(3):201–213, August2003.

3

[36] Francesco Bernardini, Marian Gheorghe, and Vincenzo Manca. On P sys-tems and almost periodicity. Fundamenta Informaticae, 2005. To appear.

[37] Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, andSergey Verlan. How to synchronize the activity of all components of aP system? International Journal of Foundations of Computer Science,19(5):1183–1198, 2008.

[38] Francesco Bernardini and Vincenzo Manca. Dynamical aspects of P sys-tems. BioSystems, 70(2):85–93, July 2003.

[39] D. Besozzi, E. Csuhaj-Varju, G. Mauri, and C. Zandron. On the powerand size of extended gemmating p systems. Soft Computing, 9(9):650–6,September 2005.

[40] Daniela Besozzi, Paolo Cazzaniga, Dario Pescini, and Giancarlo Mauri.Seasonal variance in P system models for metapopulations. Progress in

Natural Science, 17(4):392–400, 2007.

[41] Daniela Besozzi, Paolo Cazzaniga, Dario Pescini, and Giancarlo Mauri.Modelling metapopulations with stochastic membrane systems. Biosys-

tems, 91(3):499–514, 2008.

[42] Daniela Besozzi, Claudio Ferretti, Giancarlo Mauri, and Claudio Zandron.P systems with deadlock. BioSystems, 70(2):95–105, July 2003.

[43] Daniela Besozzi, Giancarlo Mauri, Gheorghe Paun, and Claudio Zandron.Gemmating P systems: collapsing hierarchies. Theoretical Computer Sci-

ence, 296(2):253–267, March 2003.

[44] Daniela Besozzi, Giancarlo Mauri, and Claudio Zandron. Hierarchiesof parallel rewriting P systems. a survey. New Generation Computing,22(4):331–347, August 2004.

[45] Luca Bianco, Federico Fontana, and Vincenzo Manca. P systems withreaction maps. International Journal of Foundations of Computer Science,17(1):27–48, February 2006.

[46] Luca Bianco and Vincenzo Manca. Symbolic generation and representa-tion of complex oscillations. International Journal of Computer Mathe-

matics, 83(7):549–568, 2006.

[47] Aneta Binder, Rudolf Freund, Georg Lojka, and Marion Oswald. Appli-cations of membrane systems in distributed systems. Progress in Natural

Science, 17(4):401–409, 2007.

[48] Cosmin Bonchis, Cornel Izbasa, and Gabriel Ciobanu. Information theoryover multisets. Computing and Informatics, 27(3+):441–451, 2008.

4

[49] Cosmin Bonchis, Cornel Izbasa, and Gabriel Ciobanu. Compositionalasynchronous membrane systems. Progress in Natural Science, 17(4):411–416, 2007.

[50] Paolo Bottoni, Carlos Martın-Vide, Gheorghe Paun, and Grzegorz Rozen-berg. Membrane systems with promoters/inhibitors. Acta Informatica,38(10):695–720, September 2002.

[51] Robert Brijder, Matteo Cavaliere, Agustın Riscos-Nunez, Grzegorz Rozen-berg, and Sburlan Dragos. Membrane systems with proteins embedded inmembranes. Theoretical Computer Science, 404(1-2):26–39, 2008.

[52] Nadia Busi. Using well-structured transition systems to decide divergencefor catalytic P systems. Theoretical Computer Science, 372(2-3):125–135,2007.

[53] Cristian S. Calude and Gheorghe Paun. Computing with cells and atomsin a nutshell. Complexity, 6(1):38–48, 2000.

[54] Cristian S. Calude and Gheorghe Paun. Bio-steps beyond Turing. BioSys-

tems, 77(1-3):175–194, November 2004.

[55] Cristian S. Calude, Gheorghe Paun, and Monica Tataram. A glimpse intonatural computing. Journal of Multi-Valuate Logic, 7:1–28, 2001.

[56] Luca Cardelli and Gheorghe Paun. An universality result for a(mem)brane calculus based on mate/drip operations. International Jour-

nal of Foundations of Computer Science, 17(1):49–68, February 2006.

[57] Alberto Castellini, Giuditta Franco, and Vincenzo Manca. Hybrid func-tional Petri nets as MP systems. Natural Computing, to appear.

[58] M. Cavaliere and I. Mura. Experiments on the reliability of stochasticspiking neural p systems. Natural Computing, to appear, 2008.

[59] Matteo Cavaliere and Vincenzo Deufemia. Further results on time-freeP systems. International Journal of Foundations of Computer Science,17(1):69–89, February 2006.

[60] Matteo Cavaliere, Rudolf Freund, Marion Oswald, and Dragos Sburlan.Multiset random context grammars, checkers, and transducers. Theoreti-

cal Computer Science, 372(2-3):136–151, 2007.

[61] Matteo Cavaliere and Daniela Genova. P systems with symport/antiportof rules. Journal of Universal Computer Science, 10(5):540–558, May2004.

[62] Matteo Cavaliere and Natasa Jonoska. Forbidding and enforcing in mem-brane computing. Natural Computing, 2(3):215–228, August 2003.

5

[63] Matteo Cavaliere and Peter Leupold. Evolution and observationa non-standard way to generate formal languages. Theoretical Computer Science,321(2-3):233–248, August 2004.

[64] Matteo Cavaliere, Radu Mardare, and Sean Sedwards. A multiset-basedmodel of synchronizing agents: Computability and robustness. Theoretical

Computer Science, 391(3):216–238, 2008.

[65] Matteo Cavaliere and Ivan Mura. Experiments on the reliability ofstochastic spiking neural P systems. Natural Computing, 7(4):453–470,2008.

[66] Matteo Cavaliere and S. Sburlan. Time and synchronization in membranesystems. Fundamenta Informaticae, 2005. To appear.

[67] Paolo Cazzaniga, Dario Pescini, Daniela Besozzi, Giancarlo Mauri, SoniaColombo, and Enzo Martegani. Modeling and stochastic simulation of theras/camp/pka pathway in the yeast saccharomyces cerevisiae evidences akey regulatory function for intracellular guanine nucleotides pools. Journal

of Biotechnology, 133(3):377–385, 2008.

[68] Rodica Ceterchi, Mutyam Madhu, Gheorghe Paun, and K.G. Subrama-nian. Array-rewriting P systems. Natural Computing, 2(3):229 – 249,August 2003.

[69] Rodica Ceterchi and Mario J. PUrez-JimUnez. On simulating a class ofparallel architectures. International Journal of Foundations of Computer

Science, 17(1):91–110, February 2006.

[70] Rodica Ceterchi and Alexandru Ioan Tomescu. Implementing sorting net-works with spiking neural P systems. Fundamenta Informaticae, 87(1):35–48, 2008.

[71] H. Chen, T.-O. Ishdorj, Gh. Paun, and M.J. Perez-Jimenez. Handlinglanguages with spiking neural p systems with extended rules. Romanian

Journal of Information Science and Technology, 2006. Accepted.

[72] H. Chen, T.-O. Ishdorj, Gh. Paun, and M.J. Perez-Jimenez. Handlinglanguages with spiking neural p systems with extended rules. Romanian

Journal of Information Science and Technology, 9(3):151–162, 2006.

[73] Smitha Cheruku, Andrei Paun, Francisco J. Romero-Campero, Mario J.Perez-Jimenez, and Oscar H. Ibarra. Simulating FAS-induced apoptosisby using P systems. Progress in Natural Science, 17(4):424–431, 2007.

[74] L. Cienciala and L. Ciencialova. Membrane automata with priorities.Journal of Computer Science and Technology, 19(1):89–97, 2004.

[75] L. Cienciala and L. Ciencialova. Membrane automata with priorities.Journal of Computer Science and Technology, 19(1):89–97, 2004.

6

[76] L. Cienciala, L. Ciencialova, P. Frisco, and P. Sosik. On the power of deter-ministic and sequential communicating P systems. International Journal

of Foundations of Computer Science, 18(2):415–431, 2007.

[77] Ludek Cienciala and Lucie Ciencialova. Membrane automata with prior-ities. Journal of Computer Science and Technology, 19(1):89–97, January2004. Special issue on bioinformatics.

[78] Ludek Cienciala, Lucie Ciencialova, and Alice Kelemenova. Homogeneousp colonies. Computing and Informatics, 27(3+):481–496, 2008.

[79] Gabriel Ciobanu. Distributed algorithms over communicating membranesystems. BioSystems, 70(2):123–133, July 2003.

[80] Gabriel Ciobanu and Bogdan Aman. On the relationship between mem-branes and ambients. Biosystems, 91(3):515–530, 2008.

[81] Gabriel Ciobanu and Laura Cornacel. Probabilistic transitions for P sys-tems. Progress in Natural Science, 17(4):431–441, 2007.

[82] Gabriel Ciobanu and Mihai Gontineac. Mealy multiset automata. In-

ternational Journal of Foundations of Computer Science, 17(1):111–126,February 2006.

[83] Gabriel Ciobanu, Linqiang Pan, Gheorghe Paun, and Mario J.Perez-Jimenez. P systems with minimal parallelism. Theoretic Computer Sci-

ence, 378:117–130, 2007.

[84] Gabriel Ciobanu and Dorin Paraschiv. P system software simulator. Fun-

damenta Informaticae, 49(1-3):61–66, January 2002. Special Issue: Mem-brane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[85] Gabriel Ciobanu, Gheorghe Paun, and Gheorghe Stefanescu. P transduc-ers. New Generation Computing, 2004. To appear.

[86] Gabriel Ciobanu and Andreas Resios. Computational complexity of simpleP systems. Fundamenta Informaticae, 87(1):49–59, 2008.

[87] Gabriel Ciobanu and Bogdan Tanasa. Gene expression by software mech-anisms. Fundamenta Informaticae, 49(1-3):67–80, January 2002. SpecialIssue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): CarlosMartın-Vide, Gheorghe Paun.

[88] Andres Cordon-Franco, Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, and Fernando Sancho-Caparrini. A Prolog simulator for deter-ministic P systems with active membranes. New Generation Computing,22(4):349–363, August 2004.

7

[89] Andres Cordon-Franco and Fernando Sancho-Caparrini. A note on com-plexity measures for probabilistic P systems. Journal of Universal Com-

puter Science, 10(5):559–568, May 2004.

[90] Monica Cordona, M. Angels Colomer, Mario J. Perez Jimenez, and AlbaZaragoza. Hierarchical clustering with membrane computing. Computing

and Informatics, 27(3+):497–513, 2008.

[91] David W. Corne and Pierluigi Frisco. Dynamics of HIV infection studiedwith cellular automata and conformon-P systems. Biosystems, 91(3):531–544, 2008.

[92] Erzsebet Csuhaj-Varju, Maurice Margenstern, Gyorgy Vaszil, and SergeyVerlan. On small universal antiport P systems. Theoretical Computer

Science, 372(2-3):152–164, 2007.

[93] Erzsebet Csuhaj-Varju, Carlos Martın-Vide, Gheorghe Paun, and ArtoSalomaa. From Watson-Crick L Systems to Darwinian P systems. Natural

Computing, 2(3):299–318, August 2003.

[94] Erzsebet Csuhaj-Varju, Gheorghe Paun, and Gyorgy Vaszil. Tissue-likeP systems with dynamically emerging requests. International Journal of

Foundations of Computer Science, 19(3):729–745, 2008.

[95] Erzsebet Csuhaj-Varju and Gyorgy Vaszil. (mem)brane automata. The-

oretical Computer Science, 404(1-2):52–60, 2008.

[96] Jurgen Dassow and Gheorghe Paun. On the power of membrane comput-ing. Journal of Universal Computer Science, 5(2):33–49, 1999.

[97] Jurgen Dassow and Gheorghe Paun. P systems with communication basedon concentration. Acta Cybernetica, 15(1):9–24, 2001.

[98] Jurgen Dassow, Gheorghe Paun, Gabriel Thierrin, and Sheng Yu. Tree-systems of morphisms. Acta Informatica, 38(2):131–153, November 2001.

[99] K.S. Dersanambika and Kamala Krithivasan. Contextual array P systems.International Journal of Computer Mathematics, 81(8):955–969, August2004.

[100] Agostino Dovier, Carla Piazza, and Gianfranco Rossi. A uniform approachto constraint-solving for lists multisets, compact lists, and sets. ACM

Transactions on Computational Logic, 9(3):15:1–15:30, 2008.

[101] Claudio Ferretti, Giancarlo Mauri, Gheorghe Paun, and Claudio Zandron.On three variants of rewriting P systems. Theoretical Computer Science,301(1-3):201–215, May 2003.

[102] Federico Fontana and Giuditta Franco. Finding the maximum elementusing P systems. Journal of Universal Computer Science, 10(5):567–580,May 2004.

8

[103] Federico Fontana and Vincenzo Manca. Discrete solutions to differentialequations by metabolic p systems. Theoretical Computer Science, 372(2-3):165–182, 2007.

[104] Federico Fontana and Vincenzo Manca. Predator-prey dynamics in P sys-tems ruled by metabolic algorithm. Biosystems, 91(3):545–557, 2008.

[105] G. Franco, N. Jonoska, B. Osborn, and A. Plaas. Knee joint injury andrepair modeled by membrane systems. Biosystems. To appear.

[106] Giuditta Franco, Natasa Jonoska, Barbara Osborn, and Anna Plaas.Knee joint injury and repair modeled by membrane systems. Biosystems,91(3):473–488, 2008.

[107] R. Freund and A. Paun. P systems with active membranes and withoutpolarizations. Soft Computing, 9(9):657–663, September 2005.

[108] Rudolf Freund. Generalized P systems with splicing and cut-ting/recombination. Grammars, 2(3):189–199, December 1999.

[109] Rudolf Freund. Sequential P systems. Romanian Journal of Information

Science and Technology, 4(1-2):77–88, 2001.

[110] Rudolf Freund. Special variants of P systems inducing an infinite hiearchywith respect to the number of membranes. Bulletin of the EATCS,(75):209–219, October 2001.

[111] Rudolf Freund, Mihai Ionescu, and Marion Oswald. Extended spikingneural P systems with decaying spikes and/or total spiking. International

Journal of Foundations of Computer Science, 19(5):1223–1234, 2008.

[112] Rudolf Freund, Lila Kari, Marion Oswald, and Petr Sosık. Computation-ally universal P systems without priorities: two catalysts are sufficient.Theoretical Computer Science, 2004. In press.

[113] Rudolf Freund, Carlos Martın-Vide, and Gheorghe Paun. From regulatedrewriting to computing with membranes: collapsing hierarchies. Theoret-

ical Computer Science, 312(2-3):143–188, January 2004.

[114] Rudolf Freund and Marion Oswald. GP Systems with forbidding con-text. Fundamenta Informaticae, 49(1-3):81–102, January 2002. SpecialIssue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): CarlosMartın-Vide, Gheorghe Paun.

[115] Rudolf Freund and Marion Oswald. A short note on analysing P systemswith antiport rules. Bulletin of the EATCS, (78):231–236, October 2002.

[116] Rudolf Freund and Marion Oswald. P systems with local graph produc-tions. New Generation Computing, 22(4):365–375, August 2004.

9

[117] Rudolf Freund and Marion Oswald. P colonies and prescribed teams.Intern. J. Computer Math., 2006.

[118] Rudolf Freund and Marion Oswald. Partial halting in P systems. Inter-

national Journal of Foundations of Computer Science, 18(6):1215–1225,2007.

[119] Rudolf Freund and Marion Oswald. Regular omega-languages defined byfinite extended spiking neural P systems. Fundamenta Informaticae, 83(1-2):65–73, 2008.

[120] Rudolf Freund, Marion Oswald, and Thomas Schirk. How a membraneagent buys goods in a membrane store. Progress in Natural Science,17(4):442–448, 2007.

[121] Rudolf Freund, Gheorghe Paun, and Mario J. Perez-Jimenez. Tissue Psystems with channel states. Theoretical Computer Science, 2004. Inpress.

[122] P. Frisco. About p systems with symport/antiport. Soft Computing,9(9):664–672, September 2005.

[123] P. Frisco. From molecular computing to modelling with conformons andcomputing by observation. Ramanujan Math. Soc. Lecture Notes Series,(3):85–101, 2007.

[124] Pierluigi Frisco. On two variants of splicing P systems. Romanian Journal

of Information Science and Technology, 4(1-2):89–100, 2001.

[125] Pierluigi Frisco. The Conformon-P System: A molecular and cell biology-inspired computability model. Theoretical Computer Science, 312(2-3):295–319, January 2004.

[126] Pierluigi Frisco and Hendrik Jan Hoogeboom. P systems with sym-port/antiport simulating counter automata. Acta Informatica, 41(2-3):145–170, December 2004.

[127] Pierluigi Frisco, Hendrik Jan Hoogeboom, and Paul Sant. A directconstruction of a universal P system. Fundamenta Informaticae, 49(1-3):103–122, January 2002. Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[128] Yan Gao and Hendrik Jan Hoogeboom. P systems with single passen-ger carriers. International Journal of Foundations of Computer Science,18(6):1227–1235, 2007.

[129] M. Garcia-Arnau, D. Manrique, A. Rodriguez-Paton, and P. Sosik. A psystem and a constructive membrane-inspired dna algorithm for solvingthe maximum clique problem. BioSystems, 90(3):687–697, 2007.

10

[130] M. Garcia-Arnau, D. Perez, A. Rodriguez-Paton, and P. Sosik. On thepower of elementary operations in spiking neural p systems. Natural Com-

puting, to appear, 2008.

[131] H. Georgescu. An efficient way to model p systems by x machine systems.Studia Univ. Babes-Bolyai, Informatica, 46(1):3–17, 2001.

[132] Marian Gheorghe, Natalio Krasnogor, and Miguel Camara. P systemsapplications to systems biology. Biosystems, 91(3):435–437, 2008.

[133] Marian Gheorghe, Vincenzo Manca, and Francisco J. Romero-Campero.Deterministic and stochastic P systems for modeling cellular processes.Natural Computing, to appear.

[134] Jean Louis Giavitto and Olivier Michel. The topological structures ofmembrane computing. Fundamenta Informaticae, 49(1-3):123–145, Jan-uary 2002. Special Issue: Membrane Computing (WMC-CdeA2001) GuestEditor(s): Carlos Martın-Vide, Gheorghe Paun.

[135] M.A. Gutierrez-Naranjo, M.J. Perez-Jimenez, and A. Riscos-Nunez. A fastP system for finding a balanced 2-partition. Soft Computing, 9(9):673–678,September 2005.

[136] Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, and AgustınRiscos-Nunez. On the degree of parallelism in membrane systems. Theo-

retical Computer Science, 372(2-3):183–195, 2007.

[137] Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, Agustın Riscos-Nunez, and Francisco J. Romero-Campero. Computational efficiency ofdissolution rules in membrane systems. International Journal of Computer

Mathematics, 83(7):593–611, 2006.

[138] Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, Agustın Riscos-Nunez, and Francisco J. Romero-Campero. How to express tumours usingmembrane systems. Progress in Natural Science, 17(4):449–457, 2007.

[139] Chen Haiming, Tseren-Onolt Ishdorj, and Gheorghe Paun. Computingalong the axon. Progress in Natural Science, 17(4):417–423, 2007.

[140] Tom Head. Aqueous simulations of membrane computations. Romanian

Journal of Information Science and Technology, 2001. To appear.

[141] D. Hemalatha, K.S. Dersanambika, K.G. Subramanian, and C. Sri HariNagore. Array-rewriting p systems with conditional communication. Ra-

manujan Math. Soc. Lecture Notes Series, (3):155–160, 2007.

[142] Chunyi Huang and Xiaoju Dong. Maximally parallel attribute on P sys-tems: Properties and applications. Progress in Natural Science, 18(5):629–632, 2008.

11

[143] L. Huang and N. Wang. A variant of p systems for optimization. Neuro-

computing, to appear.

[144] Liang Huang and Il Hong Suh. Controller design for a marine dieselengine using membrane computing. International Journal of Innovative

Computing, Information and Control, 5(4):899–912, 2009.

[145] Liang Huang, Lei Sun, Ning Wang, and Xiaoming Jin. Multiobjectiveoptimization of simulated moving bed by tissue P system. Chinese Journal

of Chemical Engineering, 15(5):683–690, 2007.

[146] Oscar H. Ibarra. On membrane hierarchy in P systems. Theoretical Com-

puter Science, 2004. In press.

[147] Oscar H. Ibarra. On the computational complexity of membrane systems.Theoretical Computer Science, 320(1):89–109, June 2004.

[148] Oscar H. Ibarra, Zhe Dang, and Omer Egecioglu. Catalytic P systems,semilinear sets, and vector addition systems. Theoretical Computer Sci-

ence, 312(2-3):379–399, January 2004. A short version of this paper (with-out proofs) was presented at the 28th International Symposium on Math-ematical Foundations of Computer Science (MFCS 2003). This researchwas supported in part by NSF Grants IIS-0101134 and CCR02-08595.

[149] Oscar H. Ibarra, Andrei Paun, Gheorghe Paun, Alfonso Rodrıguez-Paton,Petr Sosık, and Sara Woodworth. Normal forms for spiking neural P sys-tems. Theoretical Computer Science, 372(2-3):196–217, 2007.

[150] Oscar H. Ibarra and Sara Woodworth. Characterizing regular languagesby spiking neural P systems. International Journal of Foundations of

Computer Science, 18(6):1247–1256, 2007.

[151] J. Inouye and P.P. Dey. Membranous filter sort. WSEA Transactions on

Biology and Medicine, 1(4), October 2004. ISSN: 1109-9518.

[152] Mihai Ionescu, Carlos Martın-Vide, Andrei Paun, and Gheorghe Paun.Unexpected universality results for three classes of P systems with sym-port/antiport. Natural Computing, 2(4):337–348, December 2003.

[153] Mihai Ionescu and Dragos Sburlan. Some applications of spiking neuralP systems. Computing and Informatics, 27(3+):515–528, 2008.

[154] Mihai Ionescu and Dragos Sburlan. On P systems with promot-ers/inhibitors. Journal of Universal Computer Science, 10(5):581–599,May 2004.

[155] Tseren-Onolt Ishdorj and Alberto Leporati. Uniform solutions to SAT and3-SAT by spiking neural P, systems with pre-computed resources. Natural

Computing, 7(4):519–534, 2008.

12

[156] Tseren-Onolt Ishdorj, Alberto Leporati, Linqiang Pan, Xiangxiang Zeng,and Xingyi Zhang. Deterministic solutions to qsat and q3sat by spik-ing neural p systems with pre-computed resources. Theoretical Computer

Science.

[157] John Jack, Alfonso Rodrıguez-Paton, Oscar H. Ibarra, and Andrei Paun.Discrete nondeterministic modeling of the Fas pathway. International

Journal of Foundations of Computer Science, 19(5):1147–1162, 2008.

[158] Sungchul Ji. The Bhopalator: An information/energy dual model of theliving cell. Fundamenta Informaticae, 49(1-3):147–165, January 2002.Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s):Carlos Martın-Vide, Gheorghe Paun.

[159] Natasa Jonoska and Maurice Margenstern. Tree operations in P systemsand λ-calculus. Fundamenta Informaticae, 59(1):67–90, 2004.

[160] Lila Kari and Grzegorz Rozenberg. The many facets of natural computing.Communications of the ACM, 51(10):72–83, 2008.

[161] Petros Kefalas, G. Eleftherakis, Mike Holcombe, and Marian Gheorghe.Simulation and verification of P systems through communicating X-machines. BioSystems, 70(2):135–148, July 2003.

[162] Jozef Kelemen. Some questions inspired by (membrane computing moti-vated) language-theoretic models hardware. Computing and Informatics,27(3+):571–580, 2008.

[163] Jetty Kleijn and Maciej Koutny. Processes of membrane systems withpromoters and inhibitors. Theoretical Computer Science, 404(1-2):112–126, 2008.

[164] Jetty Kleijn and Maciej Koutny. A Petri net model for membrane systemswith dynamic structure. Natural Computing, to appear.

[165] Waldemar Korczynski. Paun’s systems as models of economic systems.Progress in Natural Science, 17(4):466–470, 2007.

[166] Shankara N. Krishna. Universality results for P systems based on branecalculi operations. Theoretical Computer Science, 371(1-2):83–105, 2007.

[167] Shankara Narayanan Krishna, Kamala Krithivasan, and Raghavan Rama.P systems with picture objects. Acta Cybernetica, 15(1):53–74, 2001.

[168] Shankara Narayanan Krishna, K. Lakshmanan, and Raghavan Rama. Hy-brid P systems. Romanian Journal of Information Science and Technol-

ogy, 4(1-2):111–123, 2001.

13

[169] Shankara Narayanan Krishna, K. Lakshmanan, and Raghavan Rama. Onthe power of P systems with contextual rules. Fundamenta Informati-

cae, 49(1-3):167–178, January 2002. Special Issue: Membrane Computing(WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[170] Shankara Narayanan Krishna and Andrei Paun. Results on catalyticand evolution-communication P systems. New Generation Computing,22(4):377–394, August 2004.

[171] Shankara Narayanan Krishna and Raghavan Rama. A variant of P sys-tems with active membranes: Solving NP-Complete problems. Romanian

Journal of Information Science and Technology, 2(4):357–367, 1999.

[172] Shankara Narayanan Krishna and Raghavan Rama. On the power of Psystems based on sequential/parallel rewriting. International Journal of

Computer Mathematics, 77(1-2):1–14, 2000.

[173] Shankara Narayanan Krishna and Raghavan Rama. A note on parallelrewriting in P systems. Bulletin of the EATCS, (73):147–151, February2001.

[174] Shankara Narayanan Krishna and Raghavan Rama. P systems with repli-cated rewriting. Journal of Automata, Languages and Combinatorics,6(3):345–350, 2001.

[175] Shankara Narayanan Krishna and Raghavan Rama. Breaking DES usingP systems. Theoretical Computer Science, 299(1-3):495–508, April 2003.

[176] Shankara Narayanan Krishna, Raghavan Rama, and H. Ramesh. Fur-ther results on contextual/rewriting P systems. Fundamenta Informaticae,2005. To appear.

[177] S.N. Krishna. Universality results for a brane calculus. Theoretical Com-

puter Science, 2006. ?

[178] S.N. Krishna. On the efficiency of a variant of p systems with mobilemembranes. Ramanujan Math. Soc. Lecture Notes Series, (3):171–178,2007.

[179] S.N. Krishna and R. Rama. An infinite hierarchy for some variants of psystems. Ramanujan Math. Soc. Lecture Notes Series, (3):179–185, 2007.

[180] K. Krithivasan. A glimpse of membrane computing. Ramanujan Math.

Soc. Lecture Notes Series, (3):49–61, 2007.

[181] Kamala Krithivasan and Mutyam Madhu. Contextual P systems. Funda-

menta Informaticae, 49(1-3):179–189, January 2002. Special Issue: Mem-brane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

14

[182] Kamala Krithivasan and Sandeep V. Varma. On minimising finite stateP automata. Bulletin of the EATCS, 80:168–173, July 2003.

[183] Manfred Kudlek and Victor Mitrana. Closure properties of multiset lan-guage families. Fundamenta Informaticae, 49(1-3):191–203, January 2002.Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s):Carlos Martın-Vide, Gheorghe Paun.

[184] L. Ledesma, D. Manrique, and A. Rodriguez-Paton. A tissue p systemand a dna microfluidic device for solving the shortest common superstringproblem. Soft Computing, 9(9):679–685, September 2005.

[185] A. Leporati, C. Zandron, and G. Mauri. Reversible P systems to simulatefredkin circuits. Fundamenta Informaticae, 74(4):529–548, 2006.

[186] Alberto Leporati, Daniela Besozzi, Paolo Cazzaniga, Claudio Ferretti, andDario Pescini. Computing with energy and chemical reactions. Natural

Computing, to appear.

[187] Alberto Leporati and Sara Felloni. Three “quantum” algorithms to solve3-SAT. Theoretical Computer Science, 372(2-3):218–241, 2007.

[188] Alberto Leporati and Miguel A. Gutierrez-Naranjo. Solving subset sumby spiking neural P systems with pre-computed resources. Fundamenta

Informaticae, 87(1):61–77, 2008.

[189] Alberto Leporati, Claudio Zandron, and Miguel A. Gutierrez-Naranjo. Psystems with input in binary form. International Journal of Foundations

of Computer Science, 17(1):127–146, February 2006.

[190] Alberto Leporati, Claudio Zandron, and Giancarlo Mauri. Simulatingthe Fredkin Gate with energy-based P systems. Journal of Universal

Computer Science, 10(5):600–619, May 2004.

[191] Alberto Leporati, Claudio Zandron, and Giancarlo Mauri. Solving thefactorization problem with P systems. Progress in Natural Science,17(4):471–478, 2007.

[192] Huang Liang, He Xiongxiong, Wang Ning, and Xie Yi. P systemsbased multi-objective optimization algorithm. Progress in Natural Sci-

ence, 17(4):458–465, 2007.

[193] Jian Qin Liu and Katsunori Shimohara. Evolutionary dynamics for het-erogeneous P systems. Journal of Xi’an Mining Institute, 2001.

[194] Mutyam Madhu. Probabilistic rewriting P systems. International Journal

of Foundations of Computer Science, 14(1):157–166, February 2003.

[195] Mutyam Madhu and Kamala Krithivasan. Inter-membrane communica-tion in P systems. Romanian Journal of Information Science and Tech-

nology, 3(4):335–352, 2000.

15

[196] Mutyam Madhu and Kamala Krithivasan. P systems with dynamic mem-brane polarization. Romanian Journal of Information Science and Tech-

nology, 4(1-2):135–154, 2001.

[197] Mutyam Madhu and Kamala Krithivasan. Generalized normal forms forrewriting P systems. Acta Informatica, 38(10):721–734, September 2002.

[198] Mutyam Madhu and Kamala Krithivasan. Improved results about uni-versality of P systems. Bulletin of the EATCS, (76):162–168, February2002.

[199] Mutyam Madhu and Kamala Krithivasan. A note on hybrid P systems.Grammars, 5(3):239–244, December 2002.

[200] Mutyam Madhu and Kamala Krithivasan. On a class of P automata. Inter-

national Journal of Computer Mathematics, 80(9):1111–1120, September2003.

[201] Vincenzo Manca. Monoidals for molecules and membranes. Romanian

Journal of Information Science and Technology, 4(1-2):155–170, 2001.

[202] Vincenzo Manca. DNA and membrane algorithms for SAT. Funda-

menta Informaticae, 49(1-3):205–221, January 2002. Special Issue: Mem-brane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[203] Vincenzo Manca. Metabolic P systems for biochemical dynamics. Progress

in Natural Science, 17(4):384–391, 2007.

[204] Vincenzo Manca. The metabolic algorithm for P systems: Principles andapplications. Theoretical Computer Science, 404(1-2):142–155, 2008.

[205] Vincenzo Manca and Luca Bianco. Biological networks in metabolic P sys-tems. Biosystems, 91(3):489–498, 2008.

[206] Vincenzo Manca, Carlos Martın-Vide, and Gheorghe Paun. On the powerof P systems with replicated rewriting. Journal of Automata, Languages

and Combinatorics, 6(3):359–374, 2001.

[207] Salomon Marcus. Membranes versus DNA. Fundamenta Informaticae,49(1-3):223–227, January 2002. Special Issue: Membrane Computing(WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[208] Radu Mardare, Matteo Cavaliere, and Sean Sedwards. A logical charac-terization of robustness, mutants and species in colonies of agents. Inte-

national Journal of Foundations of Computer Science, 19(5):1199–1221,2008.

[209] Carlos Martın-Vide, Victor Mitrana, and Gheorghe Paun. On the powerof P systems with valuations. Computacion y Sistemas, 5(2):120–127,2002.

16

[210] Carlos Martın-Vide, Andrei Paun, and Gheorghe Paun. Membrane com-puting: New results, new problems. Bulletin of the EATCS, (78):204–212,October 2002.

[211] Carlos Martın-Vide, Andrei Paun, and Gheorghe Paun. On the power ofP systems with symport rules. Journal of Universal Computer Science,8(2):317–331, 2002.

[212] Carlos Martın-Vide, Andrei Paun, Gheorghe Paun, and Grzegorz Rozen-berg. Membrane systems with coupled transport: Universality and normalforms. Fundamenta Informaticae, 49(1-3):1–15, January 2002. Special Is-sue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): CarlosMartın-Vide, Gheorghe Paun.

[213] Carlos Martın-Vide and Gheorghe Paun. Computing with membranes.One more collapsing hierarchy. Bulletin of the EATCS, (72):183–187,October 2000.

[214] Carlos Martın-Vide and Gheorghe Paun. Language generating by meansof membrane systems. Bulletin of the EATCS, (75):199–218, October2001.

[215] Carlos Martın-Vide, Gheorghe Paun, Juan Pazos, and Alfonso Rodrıguez-Paton. Tissue P systems. Theoretical Computer Science, 296(2):295–326,March 2003.

[216] Carlos Martın-Vide, Gheorghe Paun, and Alfonso Rodriguez-Paton. On Psystems with membrane creation. Computer Science Journal of Moldova,9(2):134–145, 2001.

[217] Carlos Martın-Vide, Gheorghe Paun, and Alfonso Rodriguez-Paton. Psystems with immediate communication. Romanian Journal of Informa-

tion Science and Technology, 4(1-2):171–182, 2001.

[218] Carlos Martın-Vide, Gheorghe Paun, and Grzegorz Rozenberg. Membranesystems with carriers. Theoretical Computer Science, 270(1-2):779–796,January 2002.

[219] Victor Martinez, Luis Fernandez, Fernando Arroyo, and Abraham Gutier-rez. HW implementation of a optimized algorithm for the application ofactive rules in a transition P-system. International Journal on Informa-

tion Theory and Applications, 14(4):324–331, 2007.

[220] Jose L. Mate, Alfonso Rodrıguez-Paton, and Andres Silva. On the powerof P systems with DNA-worm-objects. Fundamenta Informaticae, 49(1-3):229–239, January 2002. Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[221] V.P. Metta and K. Krithivasan. Spiking neural p systems and petri nets.submitted, 2008.

17

[222] Davide Molteni, Claudio Ferretti, and Giancarlo Mauri. Frequency mem-brane systems. Computing and Informatics, 27(3+):467–479, 2008.

[223] M. Muskulus, D. Besozzi, R. Brijder, P. Cazzaniga, S. Houweling,D. Pescini, and G. Rozenberg. Cycles and communicating classes in mem-brane systems and molecular dynamics. Theoretical Computer Science.To appear.

[224] M. Muskulus and R. Brijder. Complexity of biocomputation: symbolicdynamics in membrane systems. Intern. J. Found. Computer Sci. ToAppear.

[225] Michael Muskulus, Daniela Besozzi, Robert Brijder, Paolo Cazzaniga,Sanne Houweling, Dario Pescini, and Grzegorz Rozenberg. Cycles andcommunicating classes in membrane systems and molecular dynamics.Theoretical Computer Science, 372(2-3), 2007.

[226] Michael Muskulus and Robert Brijder. Complexity of bio-computation:symbolic dynamics in membrane systems. International Journal of Foun-

dations of Computer Science, 17(1):147–165, February 2006.

[227] M. Mutyam and K. Krithivasan. Tissue p systems with leftmost deriva-tion. Ramanujan Math. Soc. Lecture Notes Series, (3):187–196, 2007.

[228] Madhu Mutyam. Rewriting P systems: improved hierarchies. Theoretical

Computer Science, 2004. In press.

[229] Madhu Mutyam, Vaka Jaya Prakash, and Kamala Krithivasan. Rewritingtissue P systems. Journal of Universal Computer Science, 10(9):1250–1271, September 2004.

[230] Benedek Nagy and Laszlo Szegedi. Membrane computing and geographicaloperating systems. Journal of Universal Computer Science, 12(9):1312–1331, 2006.

[231] Isabel A. Nepomuceno-Chamorro. A Java simulator for membrane com-puting. Journal of Universal Computer Science, 10(5):620–629, May 2004.

[232] Van Nguyen, David Kearney, and Gianpaolo Gioiosa. An implementationof membrane computing using reconfigurable hardware. Computing and

Informatics, 27(3+):551–569, 2008.

[233] Dan V. Nicolau Jr., Gerardin Solana, Florin Fulga, and Dan V. Nicolau.A C library for simulating P systems. Fundamenta Informaticae, 49(1-3):241–248, January 2002. Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[234] Taishin Y. Nishida. Membrane algorithm with brownian subalgorithm andgenetic subalgorithm. International Journal of Foundations of Computer

Science, 18(6):1353–1360, 2007.

18

[235] Taishin Yasunobu Nishida. Simulations of photosynthesis by a K-Subsettransforming system with membranes. Fundamenta Informaticae, 49(1-3):249–259, January 2002. Special Issue: Membrane Computing (WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[236] Taishin Yasunobu Nishida. An approximate algorithm for NP-completeoptimization problems exploiting P systems. Journal of Cybernetics and

Informatics, V:109–112, 2004.

[237] Adam Obtulowicz. Deterministic P systems for solving SAT problem.Romanian Journal of Information Science and Technology, 4(1-2):195–202, 2001.

[238] Adam Obtulowicz. Membrane computing and one-way functions. In-

ternational Journal of Foundations of Computer Science, 12(4), August2001.

[239] Adam Obtulowicz. Mathematical models of uncertainty with a regard tomembrane systems. Natural Computing, 2(3):251–263, August 2003.

[240] Adam Obtulowicz. Gandy’s principles for mechanisms and membranecomputing. International Journal of Foundations of Computer Science,17(1):167–181, February 2006.

[241] Adam Obtulowicz and Gheorghe Paun. (In search of) Probabilistic Psystems. BioSystems, 70(2):107–121, July 2003.

[242] L. Pan and X. Zeng. A note on small universal spiking neural p systems.Pre-proceedings of Tenth Workshop on Membrane Computing, page 2009.

[243] Linqiang Pan and Artiom Alhazov. Solving HPP and SAT by P systemswith active membranes and separation rules. Acta Informatica, 43(2):131–145, 2006.

[244] Linqiang Pan, Artiom Alhazov, and Tseren-Onolt Isdorj. Further remarkson p systems with active membranes, separation, merging and releaserules. Soft Computing, 9(9):686–690, September 2005.

[245] Linqiang Pan and Tseren Onolt Ishdorj. P systems with active membranesand separation rules. Journal of Universal Computer Science, 10(5):630–649, May 2004.

[246] Linqiang Pan and Carlos Martın-Vide. Further remark on p systems withactive membranes and two polarizations. Journal of Parallel and Dis-

tributed Computing, 66:867–872, 2006.

[247] Linqiang Pan and Mario J. Perez-Jimenez. Computational complexity oftissue-like p systems. Journal of Complexity.

19

[248] Linqiang Pan and Gheorghe Paun. Spiking neural p systems with anti-spikes. Int. J. of Computers, Communications & Control, 4(3):273–282,2009.

[249] Linqiang Pan and Gheorghe Paun. Spiking neural p systems: An improvednormal form. Theoretical Computer Science, 411:906–918, 2010.

[250] Linqiang Pan, Xingyi Zhang, Xiangxiang Zeng, and Jun Wang. Researchadvances and prospect of spiking neural p systems. Chinese Journal of

Computers, 12:2090–2096, 2008.

[251] Andrei Paun. On P systems with partial parallel rewriting. Romanian

Journal of Information Science and Technology, 4(1-2):203–210, 2001.

[252] Andrei Paun and Gheorghe Paun. The power of communication: P sys-tems with symport/antiport. New Generation Computing, 20(3):295–305,May 2002.

[253] Andrei Paun, Gheorghe Paun, and Alfonso Rodriguez-Paton. Furtherremarks on P systems with symport rules. Ann. Univ. Al.I. Cuza Iasi,

Math.-Informatics Series, 10:3–18, 2001.

[254] Andrei Paun, Gheorghe Paun, and Grzegorz Rozenberg. Computing bycommunication in networks of membranes. International Journal of Foun-

dations of Computer Science, 13(6):779–798, December 2002.

[255] Gh. Paun. A quick overview of membrane computing with some detailsabout spiking neural P systems. Frontiers of Computer Science in China.To appear.

[256] Gh. Paun. Spiking neural P systems. A tutorial. Bulletin of the EATCS,February 2007.

[257] Gh. Paun. Tracing some open problems in membrane computing.ROMJIST, 10(4):303–314, 2007.

[258] Gh. Paun and R. Paun. Membrane computing models for economics. Aninvitation-survey. Studii si Cercetari de Calcul Economic si Cibernetica

Economica. To appear.

[259] Gh. Paun and M.J. Perez-Jimenez. Spiking neural p systems. recent re-sults, research topics. submitted, 2008.

[260] Gheorghe Paun. Computing with membranes. A correction. Two problemsand some bibliographical remarks. Bulletin of the EATCS, (69):141–144,October 1999.

[261] Gheorghe Paun. Computing with membranes. An introduction. Bulletin

of the EATCS, (67):139–152, February 1999.

20

[262] Gheorghe Paun. Computing with membranes. Journal of Computer and

System Sciences, 61(1):108–143, 2000. and Turku Center for ComputerScience-TUCS Report No 208.

[263] Gheorghe Paun. Computing with membranes (P systems): A variant.International Journal of Foundations of Computer Science, 11(1):167–182, March 2000. and CDMTCS TR 098, Univ. of Auckland, 1999(www.cs.auckland.ac.nz/CDMTCS).

[264] Gheorghe Paun. From cells to computers: Computing with membranes(P systems). BioSystems, 59(3):139–158, March 2001.

[265] Gheorghe Paun. P systems with active membranes: Attacking NP-Complete problems. Journal of Automata, Languages and Combina-

torics, 6(1):75–90, 2001. and CDMTCS TR 102, Univ. of Auckland, 1999(www.cs. auckland.ac.nz/CDMTCS).

[266] Gheorghe Paun. Membrane computing (after the Second BrainstormingWeek, Sevilla, february 2004). Bulletin of the EATCS, June 2004.

[267] Gheorghe Paun, Juan Pazos, Mario Jesus Perez-Jimenez, and AlfonsoRodriguez-Paton. Symport/antiport P systems with three objects areuniversal. Fundamenta Informaticae, 2005. To appear.

[268] Gheorghe Paun and Mario J. Perez-Jimenez. Recent computing models in-spired from biology: DNA and membrane computing. Theoria, 18(46):71–84, 2003.

[269] Gheorghe Paun and Grzegorz Rozenberg. A guide to membrane comput-ing. Theoretical Computer Science, 287(1):73–100, September 2002.

[270] Gheorghe Paun, Grzegorz Rozenberg, and Arto Salomaa. Membrane com-puting with external output. Fundamenta Informaticae, 41(3):313–340,February 2000.

[271] Gheorghe Paun, Yasuhiro Suzuki, and Hiroshi Tanaka. P systems withenergy accounting. International Journal of Computer Mathematics,78(3):343–364, 2001.

[272] Gheorghe Paun, Yasuhiro Suzuki, Hiroshi Tanaka, and Takashi Yokomori.On the power of membrane division in P systems. Theoretical Computer

Science, 324(1):61–85, September 2004.

[273] Gheorghe Paun and Takashi Yokomori. Simulating HSystems by P systems. Journal of Universal Com-

puter Science, 6(1):178–193, 2000. (www.iicm.edu/jucs).http://www.jucs.org/jucs_6_1/simulating_h_systems_by.

[274] Gheorghe Paun and Sheng Yu. On synchronization in P systems. Funda-

menta Informaticae, 38(4):397–410, June 1999.

21

[275] Mario J. Perez-Jimenez and Francisco Jose Romero-Campero. An efficientfamily of P systems for packing items into bins. Journal of Universal

Computer Science, 10(5):650–670, May 2004.

[276] Mario J. Perez-Jimenez, Alvaro Romero-Jimenez, and Fernando Sancho-Caparrini. Complexity classes in models of cellular computing with mem-branes. Natural Computing, 2(3):265–285, August 2003.

[277] Mario J. Perez-Jimenez, Alvaro Romero-Jimenez, and Fernando Sancho-Caparrini. Modelos de computacion celular con membranas. Boletin de la

Sociedad Espanola de Matematica Aplicada, (29):57–88, September 2004.

[278] Mario J. Perez-Jimenez and Fernando Sancho-Caparrini. A formaliza-tion of transition P systems. Fundamenta Informaticae, 49(1-3):261–271,January 2002. Special Issue: Membrane Computing (WMC-CdeA2001)Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[279] Mario J. Perez-Jimenez and Fernando Sancho-Caparrini. Verifying a Psystem generating squares. Romanian Journal of Information Science

and Technology, 5(2-3), 2002.

[280] Dario Pescini, Daniela Besozzi, Giancarlo Mauri, and Claudio Zandron.Dynamical probabilistic P systems. International Journal of Foundations

of Computer Science, 17(1):183–204, February 2006.

[281] Ion Petre. A normal form for P systems. Bulletin of the EATCS, (67):165–172, February 1999.

[282] Ion Petre and Luigia Petre. Mobile ambients and P systems. Journal of

Universal Computer Science, 5(9):588–598, 1999.

[283] Gheorghe Paun. Tracing some open problems in membrane computing.Romanian Journal of Information Science and Technology, 10(4):303–314,2007.

[284] H. Ramesh and Raghavan Rama. Rewriting P systems with condi-tional communication: Improved hierarchies. Computing and Informatics,27(3+):453–465, 2008.

[285] Alfonso Rodriguez-Paton. On the universality of P systems with mem-brane creation. Bulletin of the EATCS, (74):229–234, June 2001.

[286] F.J. Romero-Campero and M.J. Perez-Jimenez. A model of the quorumsensing system in vibrio fischeri. Artificial Life, 14(1):95–109, 2008.

[287] Francisco J. Romero-Campero, Marian Gheorghe, Gabriel Ciobanu,John M. Auld, and Mario J. Perez-Jimenez. Cellular modelling usingP systems and process algebra. Progress in Natural Science, 17(4):375–383, 2007.

22

[288] Francisco J. Romero-Campero and Mario J. Perez-Jimenez. A model ofthe quorum sensing system in Vibrio fischeri using P systems. Artificial

Life, 14(1):95–109, 2008.

[289] Francisco J. Romero-Campero and Mario J. Perez-Jimenez. Modellinggene expression control using P systems: The Lac Operon, a case study.Biosystems, 91(3):438–457, 2008.

[290] Alvaro Romero-Jimenez and Mario J. Perez-Jimenez. Simulating Turingmachines by P systems with external output. Fundamenta Informati-

cae, 49(1-3):273–278, January 2002. Special Issue: Membrane Computing(WMC-CdeA2001) Guest Editor(s): Carlos Martın-Vide, Gheorghe Paun.

[291] N. Sabadini and R.F.C. Walters. Hierarchical automata and p systems.Electronic Notes in Theoretical Computer Science, (78):1–15, 2003.

[292] Dragos Sburlan. Further results on P systems with promoters/inhibitors.International Journal of Foundations of Computer Science, 17(1):205–221,February 2006.

[293] S.N. and G. Ciobanu. On the computational power of enhanced mobilemembranes. submitted, 2008.

[294] Petr Sosık. The computational power of cell division in P systems: Beatingdown parallel computers? Natural Computing, 2(3):287–298, August 2003.

[295] Petr Sosık. The power of catalysts and priorities in membranes. Gram-

mars, 6:13–24, 2003.

[296] Petr Sosık and Alfonso Rodrıguez-Paton. Membrane computing and com-plexity theory: A characterization of PSPACE. Journal of Computer and

System Sciences, 73(1):137–152, 2007.

[297] Antoine Spicher, Olivier Michel, Mikolaj Cieslak, Jean-Louis Giavitto,and Przemyslaw Prusinkiewicz. Stochastic P systems and the simula-tion of biochemical processes with dynamic compartments. Biosystems,91(3):458–472, 2008.

[298] K. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, and Maurice Mar-genstern. Array P systems and t-communication. Fundamenta Informat-

icae, 91(1):145–159, 2009.

[299] K. G. Subramanian, R. Saravanan, M. Geethalakshmr, P. Helen Chandra,and M. Margenstern. P systems with array objects and array rewritingrules. Progress in Natural Science, 17(4):479–485, 2007.

[300] K.G. Subramanian, S. Hemalatha, C. Sri Hari Nagore, and M. Margen-stern. On the power of p systems with parallel rewriting and conditionalcommunication. Romanian Journal of Information Science and Technol-

ogy, 2006. Accepted.

23

[301] K.G. Subramanian, Linqiang Pan, See Keong Lee, and Atulya K. Nagar.P systems and context-free 2d picture languages. Proceedings of the 4th

BIC-TA, pages 336–340, 2009.

[302] Yasuhiro Suzuki and Hiroshi Tanaka. Chemical evolution among artificialproto-cells. Artificial Life, 7:54–63, 2000.

[303] Yasuhiro Suzuki and Hiroshi Tanaka. On a LISP implementation of a classof P systems. Romanian Journal of Information Science and Technology,3(2):173–186, 2000.

[304] C. Teuscher. From membranes to systems: self-configuration and self-replication in membrane systems. BioSystems. To appear (IPCAT 2005).

[305] Mai Umeki and Yasuhiro Suzuki. A simple membrane computingmethod for simulating bio-chemical reactions. Computing and Informat-

ics, 27(3+):515–528, 2008.

[306] Sergey Verlan, Francesco Bernardini, Marian Gheorghe, and Maurice Mar-genstern. Generalized communicating P systems. Theoretical Computer

Science, 404(1-2):170–184, 2008.

[307] Antonio Vitale, Giancarlo Mauri, and Claudio Zandron. Simulation ofa bounded symport/antiport P system with Brane calculi. Biosystems,91(3):558–571, 2008.

[308] J. Wang, H.J. Hoogeboom, L. Pan, and Gheorghe Paun. Spiking neural psystems with weights and thresholds. Pre-proceedings of Tenth Workshop

on Membrane Computing, 2009.

[309] Xu Xian. Tissue P systems with parallel rules on channels. Progress in

Natural Science, 17(4):486–491, 2007.

[310] Linmin Yang, Zhe Dang, and Oscar H. Ibarra. On stateless automata andP systems. Intenational Journal of Foundations of Computer Science,19(5):1259–1276, 2008.

[311] Claudio Zandron, Claudio Ferretti, and Giancarlo Mauri. Using membranefeatures in P systems. Romanian Journal of Information Science and

Technology, 4(1-2):241–257, 2001.

[312] Claudio Zandron, Alberto Leporati, Claudio Ferretti, Giancarlo Mauri,and Mario J. Perez-Jimenez. On the computational efficiency of polariza-tionless recognizer P systems with strong division and dissolution. Fun-

damenta Informaticae, 87(1):79–91, 2008.

[313] Xiangxiang Zeng, Chun Lu, and Linqiang Pan. A weakly universal spikingneural p system. Proceedings of the 4th BIC-TA, 2009.

24

[314] Ge-Xiang Zhang, Marian Gheorghe, and Chao-Zhong Wu. A quantum-inspired evolutionary algorithm based on P systems for knapsack problem.Fundamenta Informaticae, 87(1):93–116, 2008.

[315] Liang Zhang, Yao; Huang. A variant of p systems for optimization. NEU-

ROCOMPUTING, 72(4-6):1355–1360, 2009.

[316] Xingyi Zhang, Jun Wang, and Linqiang Pan. A note on the generativepower of axon p systems. International Journal of Computers, Commu-

nications & Control, 4:92–98, 2009.

[317] Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan. On string languagesgenerated by spiking neural p systems with exhaustive use of rules. Natural

Computing, 7(4):535–549, 2008.

[318] Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan. Smaller universalspiking neural p systems. Fundamenta Informaticae, 87(1):117–136, 2008.

[319] Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan. Smaller universalspiking neural P systems. Fundamenta Informaticae, 87(1):117–136, 2008.

[320] Xingyi Zhang, Xiangxiang Zeng, and Linqiang Pan. On string languagesgenerated by asynchronous spiking neural p systems. Theoretical Com-

puter Science, 410:2478–2488, 2009.

25