Summary
After briefly presenting the basic ideas and types of results of membrane computing, we introduce a widely investigated class of P systems, with a direct biological motivation, the symport/antiport P systems. We recall the generative variants (including the case when the result of a computation is obtained by means of the trace of a specified object in its movement through membranes), as well as the automata-like variants. The central results about the computing power of these systems are recalled, and in this context several open problems are mentioned.
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
Alberts, B., et al: Molecular Biology of the Cell, 3rd ed. (Garland, New York, 1994)
Ardelean, I.I.: The relevance of biomembranes for P systems. Fundamenta Informaticae, 49(1–3), 35–43 (2002)
Calude, C.S., Dinneen, M.J., Păun, Gh. (eds.): Pre-Proceedings of Workshop on Multiset Processing, Curtea de Arge,s, Romania. CDMTCS Technical Report 140, University of Auckland, 2000
Calude, C.S., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.): Multiset Processing. Mathematical, Computer Science, and Molecular Computing Points of View, Lecture Notes in Computer Science, vol. 2235 (Springer, Berlin, Heidelberg, New York, 2001)
Cavaliere, M.: Evolution-communication P systems. In: [26], 134-145
Ciobanu, G., Dumitriu, D., Huzum, D., Moruz, G., Tanasă, B.: Client-server P systems in modeling molecular interaction. In: [26], 203-218
Csuhaj-Varju, E., Vaszil, G.: P automata. In: [26], 219-233
Freund, R., Martín-Vide, C., Obtulowicz, A., Păun, Gh.: On three classes of automata-like P systems. Submitted, 2003
Freund, R., Martín-Vide, C., Obtulowicz, A., Păun, Gh.: Initial automata-like P systems. Submitted, 2003
Freund, R., Oswald, M.: A short note on analysing P systems. Bulletin of the EATCS, 78, 231–236 (October 2002)
Freund, R., Păun, A.: Membrane systems with symport/antiport: universality results In: [26], 270-287
Frisco, P., Hoogeboom, H.J.: Simulating counter automata by P systems with symport/antiport. In: [26], 288-301
Ionescu, M., Martín-Vide, C., Păun, A., Păun, Gh.: Membrane systems with symport/antiport: (Unexpected) universality results. Proc. 8th Int. Meeting on DNA Based Computers (ed. by Hagiya, M., Obuchi, A.), Sapporo, Japan, 2002, 151–160
Ionescu, M., Martín-Vide, C., Păun, Gh.: P systems with symport/antiport rules: The traces of objects. Grammars, 5, 65–79 (2002)
Madhu, M., Krithivasan, K.: On a class of P automata. Submitted, 2002
Martín-Vide, C., Păun, A., Păun, Gh.: On the power of P systems with symport rules. Journal of Universal Computer Science, 8(2), 317–331 (2002)
Martín-Vide, C., Păun, A., Păun, Gh., Rozenberg, G.: Membrane systems with coupled transport: Universality and normal forms. Fundamenta Informaticae, 49(1-3), 1–15 (2002)
Minsky, M.: Computation: Finite and Infinite Machines (Prentice Hall, Englewood Cliffs, NJ, 1967)
Nishida, T.Y.: Simulations of photosynthesis by a K-subset transforming system with membranes. Fundamenta Informaticae, 49(1-3), 249–259 (2002)
Papadimitriou, Ch.P.: Computational Complexity (Addison-Wesley, Reading, MA, 1994)
Păun, A., Păun, Gh.: The power of communication: P systems with symport/ antiport. New Generation Computing, 20(3), 295–306 (2002)
Păun, A., Păun, Gh., Rodríguez-Patón, A.: Further remarks on P systems with symport rules. Annals of Al.I. Cuza University, Ia,si, Mathematics-Informatics Series, 10, 3–18 (2001)
Păun, A., Păun, Gh., Rozenberg, G.: Computing by communication in networks of membranes. International Journal of Foundations of Computer Science, 13(6), 779–798 (2002)
Păun, Gh.: Computing with membranes. Journal of Computer and System Sciences, 61(1), 108–143 (2000)
Păun, Gh.: Computing with Membranes: An Introduction (Springer, Berlin, Heidelberg, New York, 2002)
Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C. (eds.): Membrane Computing, Lecture Notes in Computer Science vol. 2597 (Springer, Berlin, Heidelberg, New York, 2003)
Pérez-Jiménez, M., Romero-Jiménez, A., Sancho-Caparrini, F.: Teoría de la Complejidad en Modelos de Computatión Celular con Membranas (Editorial Kronos, Sevilla, 2002)
Suzuki, Y., Fujiwara, Y., Tanaka, H., Takabayashi, J.: Artificial life applications of a class of P systems: Abstract rewriting systems on multisets. In: [4], 299-346
Suzuki, Y., Takabayashi, J., Tanaka, H.: Investigation of an ecological system by using an abstract rewriting system on multisets. In: Recent Topics in Mathematical and Computational Linguistics (ed. by Martín-Vide, C., Păun, Gh.) (The Publishing House of the Romanian Academy, Bucharest, 2000), 300–309
Suzuki, Y., Tanaka, H.: Artificial life and P systems. In: [3], 265-285
Zandron, C.: A Model for Molecular Computing: Membrane Systems. PhD Thesis, Universitá degli Studi di Milano, 2001
Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Unconventional Models of Computation (ed. by Antoniou, I., Calude, C.S., Dinneen, M.J.) (Springer, Berlin, Heidelberg, New York, 2000), 289–301
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Martín-Vide, C., Păun, G. (2004). P Systems with Symport/Antiport Rules. A Survey. In: Ciobanu, G., Rozenberg, G. (eds) Modelling in Molecular Biology. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18734-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-18734-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62269-4
Online ISBN: 978-3-642-18734-6
eBook Packages: Springer Book Archive