Abstract
P colony, which was introduced in [9], is an abstract computing device composed of independent agents, acting and evolving in a shared environment. In this paper we bring a new view to investigation of the behavior of the P colonies. The first part of the paper focuses on the modularity of the P colonies with checking rules. We group the agents into modules with specific function. In the second part of the paper we introduce improved results concerning the computational power of the P colonies with capacity one.
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
Cienciala, L., Ciencialová, L., Langer, M.: P Colonies with Capacity One and Modularity. In: Proceedings of the Ninth Brainstorming Week on Membrane Computing, Sevilla, pp. 71–90 (2011)
Ciencialová, L., Cienciala, L.: Variations on the theme: P Colonies. In: Kolář, D., Meduna, A. (eds.) Proceedings of the 1st International Workshop, WFM 2006, Ostrava, pp. 27–34 (2006)
Cienciala, L., Ciencialová, L., Kelemenová, A.: On the Number of Agents in P Colonies. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2007. LNCS, vol. 4860, pp. 193–208. Springer, Heidelberg (2007)
Csuhaj-Varjú, E., Kelemen, J., Kelemenová, A., Păun, G., Vaszil, G.: Cells in environment: P colonies. Multiple-valued Logic and Soft Computing 12(3-4), 201–215 (2006)
Csuhaj-Varjú, E., Margenstern, M., Vaszil, G.: P Colonies with a Bounded Number of Cells and Programs. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2006. LNCS, vol. 4361, pp. 352–366. Springer, Heidelberg (2006)
Freund, R., Oswald, M.: P colonies working in the maximally parallel and in the sequential mode. In: Ciobanu, G., Păun, G. (eds.) Pre-Proceedings of the 1st International Workshop on Theory and Application of P Systems, Timisoara, Romania, pp. 49–56 (2005)
Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theoretical Computer Science 7(1), 311–324 (1978)
Kelemen, J., Kelemenová, A.: On P colonies, a biochemically inspired model of computation. In: Proc. of the 6th International Symposium of Hungarian Researchers on Computational Intelligence, Budapest TECH, Hungary, pp. 40–56 (2005)
Kelemen, J., Kelemenová, A., Păun, G.: Preview of P colonies: A biochemically inspired computing model. In: Bedau, M., et al. (eds.) Workshop and Tutorial Proceedings, Ninth International Conference on the Simulation and Synthesis of Living Systems, ALIFE IX, Boston, Mass, pp. 82–86 (2004)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Engle-wood Cliffs (1967)
Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61, 108–143 (2000)
Păun, G.: Membrane computing: An introduction. Springer, Berlin (2002)
Păun, G., Rozenberg, G., Salomaa, A.: The Oxford Handbook of Membrane Computing. Oxford University Press (2009)
The P Systems Webpage (2008), http://ppage.psystems.eu [cit. 2011-10-03]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cienciala, L., Ciencialová, L., Langer, M. (2012). Modularity in P Colonies with Checking Rules. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds) Membrane Computing. CMC 2011. Lecture Notes in Computer Science, vol 7184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28024-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-28024-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28023-8
Online ISBN: 978-3-642-28024-5
eBook Packages: Computer ScienceComputer Science (R0)