@article {945,
	title = {DCBA: Simulating population dynamics P systems with proportional objects distribution},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {257-276},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Population Dynamics P systems provide a formal framework for ecological modelling having a probabilistic (while keeping the maximal parallelism). Several simulation algorithms have been developed always trying to reach higher reliability in the way they reproduce the behaviour of the ecosystems being modelled.
It is natural for those algorithms to classify the rules into blocks, comprising rules that share identical left-hand side. Previous algorithms, such as the Binomial Block Based (BBB) or the Direct Non Deterministic distribution with Probabilities (DNDP), do not define a deterministic behaviour for blocks of rules competing for the same resources. In this paper we introduce the Direct distribution based on Consistent Blocks Algorithm (DCBA), a simulation algorithm which addresses that inherent non-determinism of the model by distributing proportionally the resources.},
	issn = {0302-9743},
	doi = {10.1007/978-3-642-36751-9_18},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_18},
	author = {Miguel A. Mart{\'\i}nez-del-Amor and Ignacio P{\'e}rez-Hurtado and Manuel Garc{\'\i}a-Quismondo and Luis F. Mac{\'\i}as-Ramos and Luis Valencia-Cabrera and {\'A}lvaro Romero-Jim{\'e}nez and Carmen Graciani-D{\'\i}az and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and M. Angels Colomer and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {946,
	title = {The efficiency of tissue P systems with cell separation relies on the environment},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {7762 (2013), 257-276},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {The classical definition of tissue P systems includes a distinguished alphabet with the special assumption that its elements are available in an arbitrarily large amount of copies. These objects are shared in a distinguished place of the system, called the environment. This ability of having infinitely many copies of some objects has been widely exploited in the design of efficient solutions to computationally hard problems by means of tissue P systems.
This paper deals with computational aspects of tissue P systems with cell separation where there is no such environment as described above. The main result is that only tractable problems can be efficiently solved by using this kind of P systems. Bearing in mind that NP{\textendash}complete problems can be efficiently solved by using tissue P systems without environment and with cell division, we deduce that in the framework of tissue P systems without environment, the kind of rules (separation versus division) provides a new frontier of the tractability of decision problems.},
	issn = {0302-9743},
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_17},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Miquel Rius-Font},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {947,
	title = {Spiking Neural P systems with functional astrocytes},
	journal = {Lecture Notes in Computer Science},
	year = {2013},
	pages = {228-242},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	abstract = {Spiking Neural P Systems (SN P Systems, for short) is a developing field within the universe of P Systems. New variants arise constantly as the study of their properties, such as computational completeness and computational efficiency, grows. Variants frequently incorporate new ingredients into the original model inspired by real neurophysiological structure of the brain. Astrocytes are one of the elements existing in that structure. Also known collectively as astroglia, astrocytes are characteristic star-shaped glial cells in the brain and spinal cord. In this paper, a new variant of Spiking Neural P Systems incorporating astrocytes is introduced. These astrocytes are modelled as computing devices capable of performing function computation in a single computation step. In order to experimentally study the action of Spiking Neural P Systems with astrocytes, it is necessary to develop software providing the required simulation tools. Within this trend, P{\textendash}Lingua offers a standard language for the definition of P Systems. Part of the same software project, pLinguaCore library provides particular implementations of parsers and simulators for the models specified in P{\textendash}Lingua. Along with the new SN P System variant with astrocytes, an extension of the P{\textendash}Lingua language allowing definition of these systems is presented in this paper, as well as an upgrade of pLinguaCore, including a parser and a simulator that supports the aforementioned variant.},
	issn = {0302-9743 },
	url = {http://link.springer.com/chapter/10.1007/978-3-642-36751-9_16},
	author = {Luis F. Mac{\'\i}as-Ramos and Mario J. P{\'e}rez-Jim{\'e}nez},
	editor = {Erzsebet Csuhaj-Varj{\'u} and Marian Gheorghe and Grzegorz Rozenberg and Arto Salomaa and Gy{\"o}rgy Vaszil}
}
@article {322,
	title = {Editing configurations of P systems},
	journal = {Fundamenta Informaticae},
	volume = {82},
	year = {2008},
	month = {08/2008},
	pages = {29-46},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {This paper proposes and investigates the possibility of transforming a configuration of a P system (the membrane structure and the multisets of symbol-objects present in the compartments) into another configuration by means of a given set of rules to be applied to the membranes and to the multisets of objects. Although this transformation is obtained during the computation in a P system, we consider it as a goal per se, as a pre-computation phase, when the system itself is built. In this framework, several important problems appear: the edit-distance between configurations (with respect to a given set of editing rules), normal forms, the reachability of configurations, or the existence of single configurations from which a given family of configurations can be constructed, only to mention a few. We investigate here some of these questions; the paper is mainly devoted to formulating problems in the new framework, to calling attention to the possible extensions and the usefulness of the present approach},
	issn = {0169-2968},
	url = {http://fi.mimuw.edu.pl/abs82.html},
	author = {Erzsebet Csuhaj-Varj{\'u} and Antonio di-Nola and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil}
}
@article {428,
	title = {Tissue-like P systems with dynamically emerging requests},
	journal = {International Journal of Foundations of Computer Science},
	volume = {19},
	year = {2008},
	month = {08/2008},
	pages = {729-745},
	publisher = {World Scientific},
	address = {London, U.K.},
	abstract = {We study tissue-like P systems which use string objects and communicate by introducing communication symbols in the strings. We prove that these systems are computationally complete and moreover, they are computationally efficient in the sense that NP-complete problems can be solved in this framework in polynomial time.},
	issn = {0129-0541},
	doi = {10.1142/S0129054108005917},
	url = {http://www.worldscinet.com/journals/ijfcs/19/preserved-docs/1903/S0129054108005917.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {582,
	title = {Tissue-like P systems communicating by request},
	journal = {Ramanujan Mathematical Society. Lecture Notes Series in Mathematics},
	year = {2008},
	pages = {143-154},
	publisher = {Ramanujan Mathematical Society},
	url = {http://www.ramanujanmathsociety.org/docs/lns/ln-issue3-contents.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {575,
	title = {Grammar systems versus membrane computing: the case of CD grammar systems},
	journal = {Fundamenta Informaticae},
	volume = {76},
	year = {2007},
	month = {03/2007},
	pages = {271-292},
	publisher = {IOS Press},
	address = {Warsaw, Poland},
	abstract = {In this paper we discuss some relationships between grammar systems and P systems (membrane systems), two areas of computer science dealing with distributed computing models, but with different motivations and different types of basic ingredients. We extend one of the most important communication protocols of cooperating distributed (CD) grammar systems, the so-called t-derivation mode, to P systems with string-objects: if no rule can be applied to a string in a region of a P system, then the string is moved to a neighbouring region, depending on the communication mode either in exactly one direction (in or out) or in both directions. We describe the computational power of the obtained classes of P systems in comparison with families of languages generated by grammars in the Chomsky hierarchy or with CD grammar systems and formulate several problems for future research. },
	issn = {0169-2968},
	url = {http://portal.acm.org/citation.cfm?id=1232734},
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
@article {266,
	title = {Editing configurations of P systems},
	journal = {Third Brainstorming Week on Membrane Computing},
	year = {2005},
	month = {1/31/05-2/4/05},
	pages = {131-154},
	publisher = {F{\'e}nix Editora},
	address = {Sevilla, Espa{\~n}a},
	isbn = {84-609-6771-9},
	attachments = {http://www.gcn.us.es/biblio/q=node/sites/all/modules/files/editing configurations of P systems.pdf},
	author = {Erzsebet Csuhaj-Varj{\'u} and Antonio di-Nola and Gheorghe Paun and Mario J. P{\'e}rez-Jim{\'e}nez and Gy{\"o}rgy Vaszil},
	editor = {Miguel A. Guti{\'e}rrez-Naranjo and Agust{\'\i}n Riscos-N{\'u}{\~n}ez and Francisco J. Romero-Campero and Dragos Sburlan}
}
@article {302,
	title = {A Polynomial Complexity Class in P Systems Using Membrane Division},
	journal = {Fifth International Workshop on Descriptional Complexity of Formal Systems},
	year = {2003},
	month = {12-14/07/2003},
	pages = {284-294},
	address = {Budapest (Hungary)},
	isbn = {963-311-356-3},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and {\'A}lvaro Romero-Jim{\'e}nez and Fernando Sancho-Caparrini},
	editor = {Erzsebet Csuhaj-Varj{\'u} and C. Kintala and D. Wotschke and Gy{\"o}rgy Vaszil}
}
@article {107,
	title = {PC grammar systems with five context-free components generate all recursively enumerable languages},
	journal = {Theoretical Computer Science},
	volume = {299},
	year = {2003},
	pages = {785 - 794   },
	publisher = {Elsevier},
	address = {Amsterdam (The Netherlands)},
	abstract = {Parallel communicating grammar systems (PC grammar systems, in short) are language generating devices consisting of several context-free grammars which work synchronously on their own sentential forms and communicate the generated strings to each other by request. These systems with eleven components are known to have the power of the Turing machines. We considerably improve this result, proving that five components suffice in order to generate any recursively enumerable language. 


},
	keywords = {descriptional complexity, parallel communicating grammar systems, recursively enumerable languages},
	issn = {0304-3975 },
	doi = {10.1016/S0304-3975(02)00852-6 },
	author = {Erzsebet Csuhaj-Varj{\'u} and Gheorghe Paun and Gy{\"o}rgy Vaszil}
}
