Abstract
This article introduces a new derivation mode for P systems. This mode permits to evaluate next possible configurations and to discard some of them according to forbidding conditions. The interesting point is that the software implementation of this mode needs very small modifications to the standard algorithm of rule assignment for maximal parallelism. The introduced mode has numerous advantages with respect to the maximally parallel mode, the most important one being that some non-deterministic proofs become deterministic. As an example we present a generalized communicating P system that accepts 2n in n steps in a deterministic way. Another example shows that in the deterministic case this mode is strictly more powerful than the maximally parallel derivation mode. Finally, this mode gives a natural way to define P systems that may accept or reject a computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alhazov, A., Rogozhin, Y., Verlan, S.: Symport/antiport tissue P systems with minimal cooperation. In: Proc. ESF Exploratory Workshop on Cellular Computing (Complexity Aspects), Sevilla, Spain, pp. 37–52
Binder, A., Freund, R., Lojka, G., Oswald, M.: Implementation of catalytic P systems. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 45–56. Springer, Heidelberg (2005)
Ciobanu, G., Pan, L., Păun, G., Pérez-Jiménez, M.J.: P systems with minimal parallelism. Theor. Comput. Sci. 378(1), 117–130 (2007)
Csuhaj-Varjú, E.: P automata. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 19–35. Springer, Heidelberg (2005)
Freund, R., Verlan, S.: A formal framework for static (tissue) P systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 271–284. Springer, Heidelberg (2007)
Freund, R., Kogler, M., Verlan, S.: P automata with controlled use of minimal communication rules. In: Bordihn, H., et al. (eds.) Proc. of Workshop on Non-Classical Models for Automata and Applications, Wroclaw, Poland, pp. 107–119 (2009)
Frisco, P., Hoogeboom, H.: P systems with symport/antiport simulating counter automata. Acta Informatica 41(2-3), 145–170 (2004)
Oswald, M.: P Automata. PhD thesis. Vienna Univ. of Technology (2003)
Păun, Gh.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Verlan, S., Bernardini, F., Gheorghe, M., Margenstern, M.: On communication in tissue P systems: conditional uniport. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 521–535. Springer, Heidelberg (2006)
Verlan, S., Bernardini, F., Gheorghe, M., Margenstern, M.: Generalized communicating P systems. Theor. Comput. Sci. 404(1-2), 170–184 (2008)
The Membrane Computing Web Page, http://ppage.psystems.eu
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verlan, S. (2010). Look-Ahead Evolution for P Systems. In: Păun, G., Pérez-Jiménez, M.J., Riscos-Núñez, A., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2009. Lecture Notes in Computer Science, vol 5957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11467-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-11467-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11466-3
Online ISBN: 978-3-642-11467-0
eBook Packages: Computer ScienceComputer Science (R0)